Fault-tolerant quantum computing with the parity code and noise-biased qubits (2404.11332v1)
Abstract: We present a fault-tolerant universal quantum computing architecture based on a code concatenation of noise-biased qubits and the parity architecture. The parity architecture can be understood as a LDPC code tailored specifically to obtain any desired logical connectivity from nearest neighbor physical interactions. The code layout can be dynamically adjusted to algorithmic requirements on-the-fly. This allows reaching arbitrary code distances and thereby exponential suppression of errors with a universal set of fault-tolerant gates. In addition to the previously explored tool-sets for concatenated cat codes, our approach features parallelizable interactions between arbitrary sets of qubits by directly addressing the parity qubits in the code. The proposed scheme enables codes with less physical qubit overhead compared to the repetition code with the same code distances, while requiring only weight-3 and weight-4 stabilizers and nearest neighbor 2D square-lattice connectivity.
- R. P. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21, 467 (1982).
- P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134.
- E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm (2014), arXiv:1411.4028 [quant-ph] .
- E. Knill, Quantum computing with realistically noisy devices, Nature 434, 39 (2005).
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th ed. (Cambridge University Press, USA, 2011).
- P. Shor, Fault-tolerant quantum computation, in Proceedings of 37th Conference on Foundations of Computer Science (1996) pp. 56–65.
- D. Gottesman, Stabilizer codes and quantum error correction (1997), arXiv:quant-ph/9705052 [quant-ph] .
- A. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303, 2 (2003).
- N. P. Breuckmann and J. N. Eberhardt, Quantum low-density parity-check codes, PRX Quantum 2, 040101 (2021).
- D. Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum 3, 128 (2019).
- A. G. Fowler and C. Gidney, Low overhead quantum computation using lattice surgery (2019), arXiv:1808.06709 [quant-ph] .
- A. G. Fowler, A. M. Stephens, and P. Groszkowski, High-threshold universal quantum computation on the surface code, Phys. Rev. A 80, 052312 (2009).
- J. Guillaud and M. Mirrahimi, Repetition cat qubits for fault-tolerant quantum computation, Phys. Rev. X 9, 041053 (2019a).
- A. Messinger, M. Fellner, and W. Lechner, Constant depth code deformations in the parity architecture, in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, 2023).
- W. Lechner, P. Hauke, and P. Zoller, A quantum annealing architecture with all-to-all connectivity from local interactions, Science Advances 1, e1500838 (2015).
- F. Pastawski and J. Preskill, Error correction for encoded quantum annealing, Physical Review A 93, 10.1103/physreva.93.052325 (2016).
- J. Guillaud and M. Mirrahimi, Repetition cat qubits for fault-tolerant quantum computation, Phys. Rev. X 9, 041053 (2019b).
- J. Guillaud, Repetition Cat Qubits, Ph.D. thesis, École Normale Supérieure (2021).
- B. M. Terhal, J. Conrad, and C. Vuillot, Towards scalable bosonic quantum error correction, Quantum Science and Technology 5, 043001 (2020).
- D. Gottesman and I. L. Chuang, Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature 402, 390 (1999).
- X. Zhou, D. W. Leung, and I. L. Chuang, Methodology for quantum logic gate construction, Phys. Rev. A 62, 052316 (2000).
- S. Bravyi and A. Kitaev, Universal quantum computation with ideal clifford gates and noisy ancillas, Phys. Rev. A 71, 022316 (2005).
- A. Steane, Multiple-particle interference and quantum error correction, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452, 2551 (1996).
- S. Bravyi and J. Haah, Magic-state distillation with low overhead, Phys. Rev. A 86, 052329 (2012).
- P. Webster, S. D. Bartlett, and D. Poulin, Reducing the overhead for quantum computation when noise is biased, Phys. Rev. A 92, 062309 (2015).