Quantum error correction with an Ising machine under circuit-level noise
Open Access
- 19 December 2023
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (4) , 043261
Abstract
Efficient decoding to estimate error locations from outcomes of syndrome measurements is the prerequisite for quantum error correction. Decoding in the presence of circuit-level noise including measurement errors should be considered in case of actual quantum computing devices. In this paper, we develop a decoder for circuit-level noise that solves the error estimation problems as Ising-type optimization problems. We confirm that the threshold theorem in the surface code under circuit-level noise is reproduced with an error threshold of approximately 0.4%. We also demonstrate the advantage of the decoder through which the error detection rate can be improved compared with other matching-based decoders. Our results reveal that a lower logical error rate can be obtained using our algorithm compared with that of the minimum-weight perfect matching algorithm.
Keywords
All Related Versions
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology (JPMXS0118067394, JPMXS0120319794)
- Japan Science and Technology Agency (JPMJPF2014, JPMJMS2061)
This publication has 35 references indexed in Scilit:
- Surface codes: Towards practical large-scale quantum computationPhysical Review A, 2012
- High-threshold universal quantum computation on the surface codePhysical Review A, 2009
- Topological fault-tolerance in cluster state quantum computationNew Journal of Physics, 2007
- Fault-Tolerant Quantum Computation with High Threshold in Two DimensionsPhysical Review Letters, 2007
- A fault-tolerant one-way quantum computerAnnals of Physics, 2006
- Fault-tolerant quantum computation by anyonsAnnals of Physics, 2003
- Topological quantum memoryJournal of Mathematical Physics, 2002
- Efficient algorithms for finding maximum matching in graphsACM Computing Surveys, 1986
- Optimization by Simulated AnnealingScience, 1983
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965