Experimental Pauli-frame randomization on a superconducting qubit
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
The promise of quantum computing with imperfect qubits relies on the ability of a quantum computing system to scale cheaply through error correction and fault-tolerance. While fault-tolerance requires relatively mild assumptions about the nature of qubit errors, the overhead associated with coherent and non-Markovian errors can be orders of magnitude larger than the overhead associated with purely stochastic Markovian errors. One proposal to address this challenge is to randomize the circuits of interest, shaping the errors to be stochastic Pauli errors but leaving the aggregate computation unaffected. The randomization technique can also suppress couplings to slow degrees of freedom associated with non-Markovian evolution. Here we demonstrate the implementation of Pauli-frame randomization in a superconducting circuit system, exploiting a flexible programming and control infrastructure to achieve this with low effort. We use high-accuracy gate-set tomography to characterize in detail the properties of the circuit error, with and without the randomization procedure, which allows us to make rigorous statements about Markovianity as well as the nature of the observed errors. We demonstrate that randomization suppresses signatures of non-Markovian evolution to statistically insignificant levels, from a Markovian model violation ranging from $43\sigma$ to $1987\sigma$, down to violations between $0.3\sigma$ and $2.7\sigma$ under randomization. Moreover, we demonstrate that, under randomization, the experimental errors are well described by a Pauli error model, with model violations that are similarly insignificant (between $0.8\sigma$ and $2.7\sigma$). Importantly, all these improvements in the model accuracy were obtained without degradation to fidelity, and with some improvements to error rates as quantified by the diamond norm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860 · cited 1×
“If the computational gates consist of Clifford group operations [23] (a set of operations sufficient for error correction), the effect of these random Pauli operations can be easily tracked [24, 25] so that the computation itself can be unrandomized by reinterpreting measurement results.”
BackgroundImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“If the computational gates consist of Clifford group operations [28] (a set of operations sufficient for the most promising approaches to error correction and fault tolerance), the effect of these random Pauli operations can be easily tracked [29,30] so that the computation can be unrandomized by simply reinterpreting…”
BackgroundQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 1×
“Here we use a superconducting qubit system to implement a proposal known as Pauli-Frame Randomization (PFR) [12, 13], and discuss some additional benefits of the randomization process, such as decoupling of slow”
MethodRandomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019
Prescription for experimental determination of the dynamics of a quantum black box
Chuang, I. L., & Nielsen, M. A. (1997) · Journal of Modern Optics · doi:10.1080/09500349708231894 · Cited by 949 · cited 1×
“At heart, GST is a sophisticated refinement of a quantum process tomography [45,46], providing a complete reconstruction of the action of quantum operations.”
BackgroundA simple formula for the average gate fidelity of a quantum dynamical operation
Nielsen, M. A. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01272-0 · Cited by 725
Complete Characterization of a Quantum Process: The Two-Bit Quantum Gate
Poyatos, J. F., Cirac, J. I., & Zoller, P. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.390 · Cited by 694 · cited 1×
“At heart, GST is a sophisticated refinement of a quantum process tomography [45,46], providing a complete reconstruction of the action of quantum operations.”
BackgroundFault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513 · cited 1×
“[10] Dorit Aharonov and Michael Ben-Or, “Fault-tolerant quantum computation with constant error rate,” SIAM Journal on Computing 38, 1207–1282 (2008).”
BackgroundScalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502
Characterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M., & Emerson, J. (2012) · Physical Review A · doi:10.1103/physreva.85.042311 · Cited by 464
Experimental Demonstration of Fault-Tolerant State Preparation with Superconducting Qubits
Takita, M., Cross, A. W., Córcoles, A. D., Chow, J. M., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180501 · Cited by 228
Random Decoupling Schemes for Quantum Dynamical Control and Error Suppression
Viola, L., & Knill, E. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.060502 · Cited by 180
Cited by
Stim: a fast stabilizer circuit simulator
Gidney, C. (2021) · Quantum · doi:10.22331/q-2021-07-06-497 · Cited by 415
“This even works if the simulator is replaced by a physical quantum computer [29].”
BackgroundDirect Randomized Benchmarking for Multiqubit Devices
Proctor, T. J., Carignan-Dugas, A., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.030503 · Cited by 118
Scalable Randomized Benchmarking of Quantum Computers Using Mirror Circuits
Proctor, T., Seritan, S., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.150502 · Cited by 68
Metadata
- Authors
- Ware, M., Ribeill, G., Ristè, D., Ryan, C. A., Johnson, B., & da Silva, M. P.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2021-04-08
- Volume
- 103
- Issue
- 4
- ISSN
- 2331-8422 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2792514889
- Cited by
- 43
- References
- 13
- Type
- posted content
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.