Quantum computer error structure probed by quantum error correction syndrome measurements
Abstract: With quantum devices rapidly approaching qualities and scales needed for fault tolerance, the validity of simplified error models underpinning the study of quantum error correction needs to be experimentally evaluated. In this work, we have assessed the performance of IBM superconducting quantum computer devices implementing heavy-hexagon code syndrome measurements with increasing circuit sizes up to 23 qubits, against the error assumptions underpinning code threshold calculations. Circuit operator change rate statistics in the presence of depolarizing and biased noise were modelled using analytic functions of error model parameters. Data from 16 repeated syndrome measurement cycles was found to be inconsistent with a uniform depolarizing noise model, favouring instead biased and inhomogeneous noise models. Spatial-temporal correlations investigated via $Z$ stabilizer measurements revealed significant temporal correlation in detection events. These results highlight the non-trivial structure which may be present in the noise of quantum error correction circuits, revealed by operator measurement statistics, and support the development of noise-tailored codes and decoders to adapt.
- R. P. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21, 467 (1982).
- E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm (2014), arXiv:1411.4028 [quant-ph] .
- J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2, 79 (2018).
- S. Brandhofer, S. Devitt, and I. Polian, Arsonisq: Analyzing quantum algorithms on near-term architectures, in 2021 IEEE European Test Symposium (ETS) (2021) pp. 1–6.
- P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A 52, R2493 (1995).
- P. W. Shor, Fault-tolerant quantum computation, in Proceedings of 37th Conference on Foundations of Computer Science (1996) pp. 56–65.
- J. M. Martinis, Saving superconducting quantum processors from decay and correlated errors generated by gamma and cosmic rays, npj Quantum Information 7, 90 (2021).
- C. Gidney and M. Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, Quantum 5, 433 (2021).
- D. Litinski, A game of surface codes: Large-scale quantum computing with lattice surgery, Quantum 3, 128 (2019).
- E. Magesan, J. M. Gambetta, and J. Emerson, Scalable and robust randomized benchmarking of quantum processes, Phys. Rev. Lett. 106, 180504 (2011).
- R. Raussendorf, J. Harrington, and K. Goyal, Topological fault-tolerance in cluster state quantum computation, New Journal of Physics 9, 199 (2007).
- A. M. Stephens, Fault-tolerant thresholds for quantum error correction with the surface code, Phys. Rev. A 89, 022321 (2014).
- Y. Fujiwara, Instantaneous quantum channel estimation during quantum information processing (2014), arXiv:1405.6267 [quant-ph] .
- M.-X. Huo and Y. Li, Learning time-dependent noise to reduce logical errors: real time error rate estimation in quantum error correction, New Journal of Physics 19, 123032 (2017).
- J. R. Wootton, Syndrome-derived error rates as a benchmark of quantum hardware (2022a), arXiv:2207.00553 [quant-ph] .
- A. Morvan et al., Phase transition in random circuit sampling (2023), arXiv:2304.11119 [quant-ph] .
- Z. Chen et al., Exponential suppression of bit or phase errors with cyclic error correction, Nature 595, 383 (2021).
- Y. Zhao et al., Realization of an error-correcting surface code with superconducting qubits, Phys. Rev. Lett. 129, 030501 (2022b).
- J. R. Wootton, Measurements of floquet code plaquette stabilizers (2022b), arXiv:2210.13154 [quant-ph] .
- R. Acharya et al., Suppressing quantum errors by scaling a surface code logical qubit, Nature 614, 676 (2023).
- K. J. Satzinger et al., Realizing topologically ordered states on a quantum processor, Science 374, 1237 (2021).
- S. Xu et al., Digital simulation of projective non-abelian anyons with 68 superconducting qubits, Chinese Physics Letters 40, 060301 (2023).
- A. G. Fowler, Proof of finite surface code threshold for matching, Phys. Rev. Lett. 109, 180502 (2012).
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010).
- D. Gottesman, Stabilizer codes and quantum error correction (1997), arXiv:quant-ph/9705052 [quant-ph] .
- P. Aliferis and A. W. Cross, Subsystem fault tolerance with the bacon-shor code, Phys. Rev. Lett. 98, 220502 (2007).
- A. G. Fowler and J. M. Martinis, Quantifying the effects of local many-qubit errors and nonlocal two-qubit errors on the surface code, Phys. Rev. A 89, 032316 (2014).
- J. J. Wallman and J. Emerson, Noise tailoring for scalable quantum computation via randomized compiling, Phys. Rev. A 94, 052325 (2016).
- Y. Tomita and K. M. Svore, Low-distance surface codes under realistic quantum noise, Phys. Rev. A 90, 062320 (2014).
- N. H. Nickerson and B. J. Brown, Analysing correlated noise on the surface code using adaptive decoding algorithms, Quantum 3, 131 (2019).
- C. Chamberland and E. T. Campbell, Universal quantum computing with twist-free and temporally encoded lattice surgery, PRX Quantum 3, 010331 (2022).
- D. Gottesman, The heisenberg representation of quantum computers (1998), arXiv:quant-ph/9807006 [quant-ph] .
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.