Partial randomized benchmarking

• URL: http://arxiv.org/abs/2111.04192v2
• Date: Tue, 21 Jun 2022 12:47:26 GMT
• Title: Partial randomized benchmarking
• Authors: Kirill Dubovitskii and Yuriy Makhlin
• Abstract summary: In randomized benchmarking of quantum logical gates, partial twirling can be used for simpler implementation, better scaling, and higher accuracy and reliability. We analyze such simplified, partial twirling and demonstrate that, unlike for the standard randomized benchmarking, the measured decay of fidelity is a linear combination of exponentials with different decay rates.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In randomized benchmarking of quantum logical gates, partial twirling can be used for simpler implementation, better scaling, and higher accuracy and reliability. For instance, for two-qubit gates, single-qubit twirling is easier to realize than full averaging. We analyze such simplified, partial twirling and demonstrate that, unlike for the standard randomized benchmarking, the measured decay of fidelity is a linear combination of exponentials with different decay rates (3 for two qubits and single-bit twirling). The evolution with the sequence length is governed by an iteration matrix, whose spectrum gives the decay rates. For generic two-qubit gates one slowest exponential dominates and characterizes gate errors in three channels. Its decay rate is close, but different from that in the standard randomized benchmarking, and we find the leading correction. Using relations to the local invariants of two-qubit gates we identify all exceptional gates with several slow exponentials and analyze possibilities to extract their decay rates from the measured curves.

Related papers

• Characterization of high-fidelity Raman qubit gates [0.0]
  We present a simple and fast tomographic method to measure the errors of Raman qubit gates possessing the Morris-Shore dynamic symmetry. The method is based on repeating the same gate multiple times, which amplifies the small coherent errors to sufficiently large values.
  arXiv  Detail & Related papers  (2023-10-06T13:15:24Z)
• The Implicit Bias of Batch Normalization in Linear Models and Two-layer Linear Convolutional Neural Networks [117.93273337740442]
  We show that gradient descent converges to a uniform margin classifier on the training data with an $exp(-Omega(log2 t))$ convergence rate. We also show that batch normalization has an implicit bias towards a patch-wise uniform margin.
  arXiv  Detail & Related papers  (2023-06-20T16:58:00Z)
• On Fault Tolerance of Circuits with Intermediate Qutrit-assisted Gate Decomposition [3.452050192629253]
  An intermediate qutrit implies that a qubit is operated as a qutrit in a particular execution cycle. We study the challenges of including fault-tolerance in such a decomposition.
  arXiv  Detail & Related papers  (2022-12-15T14:33:45Z)
• Non-Exponential Behaviour in Logical Randomized Benchmarking [0.0]
  We construct a gate and time-independent noise model that results in the output of a logical randomized benchmarking protocol. We show that the presence of machinery associated with the implementation of quantum error correction can facilitate non-exponential decay.
  arXiv  Detail & Related papers  (2022-12-11T12:30:27Z)
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit [0.4471952592011114]
  We implement a three-qubit gate by simultaneously applying two-qubit operations. We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once. We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
  arXiv  Detail & Related papers  (2022-07-06T19:42:29Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• A Logarithmic Bayesian Approach to Quantum Error Detection [0.0]
  We propose a pair of digital filters using logarithmic probabilities to achieve near-optimal performance on a three-qubit bit-flip code. These filters are approximations of an optimal filter that we derive explicitly for finite time steps. We demonstrate that the single-term and two-term filters are able to significantly outperform both a double threshold scheme and a linearized version of the Wonham filter.
  arXiv  Detail & Related papers  (2021-10-20T19:08:20Z)
• On the Double Descent of Random Features Models Trained with SGD [78.0918823643911]
  We study properties of random features (RF) regression in high dimensions optimized by gradient descent (SGD) We derive precise non-asymptotic error bounds of RF regression under both constant and adaptive step-size SGD setting. We observe the double descent phenomenon both theoretically and empirically.
  arXiv  Detail & Related papers  (2021-10-13T17:47:39Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Bayesian Bits: Unifying Quantization and Pruning [73.27732135853243]
  We introduce Bayesian Bits, a practical method for joint mixed precision quantization and pruning through gradient based optimization. We experimentally validate our proposed method on several benchmark datasets and show that we can learn pruned, mixed precision networks.
  arXiv  Detail & Related papers  (2020-05-14T16:00:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.