Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 96 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 455 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Effectiveness of the syndrome extraction circuit with flag qubits on IBM quantum hardware (2403.10217v2)

Published 15 Mar 2024 in quant-ph

Abstract: Large-scale quantum circuits are required to exploit the advantages of quantum computers. Present-day quantum computers have become less reliable with increasing depths of quantum circuits. To overcome this limitation, quantum error-correction codes have been introduced. Although the success of quantum error correction codes has been announced in Google[1, 2] and neutral atom[3] quantum computers, there have been no reports on IBM quantum computers showing error suppression owing to its unique heavy-hexagon structure. This structure restricts connectivity, and quantum error-correction codes on IBM quantum computers require flag qubits. Here, we report the successful implementation of a syndrome extraction circuit with flag qubits on IBM quantum computers. Moreover, we demonstrate its effectiveness by considering the repetition code as a test code among the quantum error-correcting codes. Even though the data qubit is not adjacent to the syndrome qubit, logical error rates diminish exponentially as the distance of the repetition code increases from three to nine. Even when two flag qubits exist between the data and syndrome qubits, the logical error rates decrease as the distance increases similarly. This confirms the successful implementation of the syndrome extraction circuit with flag qubits on the IBM quantum computer.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (44)
  1. Google Quantum AI. Exponential suppression of bit or phase errors with cyclic error correction. Nature 595, 383 (2021).
  2. Google Quantum AI. Suppressing quantum errors by scaling a surface code logical qubit. Nature 614, 676-681 (2023).
  3. Logical quantum processor based on reconfigurable atom arrays. Nature, 1-3 (2023).
  4. J, Preskill. Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018).
  5. Steane, A. M. Error correcting codes in quantum theory. Phys. Rev. Lett. 77, 793-797 (1996).
  6. Gottesman, D. Stabilizer Codes and Quantum Error Correction. PhD thesis, California Institute of Technology (1997).
  7. Quantum codes on a lattice with boundary. Preprint at https://arxiv.org/abs/quant-ph/9811052 (1998).
  8. Topological quantum memory. J. Math. Phys. 43, 4452-4505 (2002).
  9. Kitaev, A. Y. Fault-tolerant quantum computation by anyons. Ann. Phys. 303, 2-30 (2003).
  10. Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012).
  11. Terhal, B. M. Quantum error correction for quantum memories. Rev. Mod. Phys. 87, 307 (2015).
  12. Universal quantum computation with ideal clifford gates and noisy ancillas. Phys. Rev. A 71, 022316 (2005).
  13. Effective fault-tolerant quantum computation with slow measurements. Phys. Rev. Lett. 98, 020501 (2007).
  14. Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics. Quantum 2, 43 (2018).
  15. Evidence for the utility of quantum computing before fault tolerance. Nature 618, 500-505 (2023).
  16. Laser-annealing josephson junctions for yielding scaled-up superconducting quantum processors. npj Quantum Inf. 7, 1 (2021).
  17. Fault-tolerant quantum computation with few qubits. npj Quantum Information 4.1 (2018)
  18. Quantum error correction with only two extra qubits. Phys. Rev. Lett. 121, 050502 (2018).
  19. Flag fault-tolerant error correction for any stabilizer code. PRX Quantum 1, 010302 (2020).
  20. Flag fault-tolerant error correction with arbitrary distance codes. Quantum 2, 53 (2018).
  21. Comparative study of quantum error correction strategies for the heavy-hexagonal lattice. arXiv preprint arXiv:2402.02185 (2024).
  22. Design of quantum error correcting code for biased error on heavy-hexagon structure. Quantum Information Processing, 22(6), 230. (2023)
  23. Encoding a magic state with beyond break-even fidelity. Nature 625.7994, 259-263 (2024).
  24. Repeated quantum error detection in a surface code. Nature Physics 16.8, 875-880 (2020).
  25. Fault-tolerant control of an error-corrected qubit. Nature 598.7880, 281-286 (2021).
  26. Realization of real-time fault-tolerant quantum error correction. Phys. Rev. X. 11.4, 041058 (2021).
  27. Realizing repeated quantum error correction in a distance-three surface code. Nature 605.7911, 669-674 (2022).
  28. Repetition code of 15 qubits. Physical Review A 97.5: 052313 (2018).
  29. Fault-tolerant operation of a logical qubit in a diamond quantum processor. Nature 606.7916, 884-889 (2022).
  30. Realization of an error-correcting surface code with superconducting qubits. Phys. Rev. Lett. 129.3, 030501 (2022).
  31. Quantum computer error structure probed by quantum error correction syndrome measurements. arXiv preprint arXiv:2310.12448 (2023).
  32. Demonstrating multi-round subsystem quantum error correction using matching and maximum likelihood decoders. Nat. Commun. 14, 2852 (2023).
  33. Topological and subsystem codes on low-degree graphs with flag qubits. Phys. Rev. X 10, 011022 (2020)
  34. Calibrated decoders for experimental quantum error correction. Phys. Rev. Lett. 128, 110504 (2022).
  35. IBM Quantum and Community. Qiskit: An open-source framework for quantum computing. https://doi.org/10.5281/zenodo.2573505 (2021).
  36. Realization of real-time fault-tolerant quantum error correction. Phys. Rev. X 11, 041058 (2021).
  37. O, Higgott PyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching ACM Transactions on Quantum Computing 3.3 (2022)
  38. Sparse Blossom: correcting a million errors per core second with minimum-weight matching arXiv:2303.15933 (2023)
  39. Gottesman, D. The Heisenberg representation of quantum computers. Preprint at https://arxiv.org/abs/quant-ph/9807006 (1998).
  40. Fast simulation of stabilizer circuits using a graph-state representation. Phys. Rev. A 73, 022334 (2006).
  41. Reducing Unitary and Spectator Errors in Cross Resonance with Optimized Rotary Echoes. PRX Quantum 1, 020318 (2020).
  42. C, Gidney Stim: a fast stabilizer circuit simulator. Quantum 5, 497 (2021).
  43. Efficient Z gates for quantum computing. Phys. Rev. A 96, 022330 (2017).
  44. Characterizing quantum gates via randomized benchmarking. Phys. Rev. A. 85, 042311 (2012).
Citations (1)
View on Semantic Scholar
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets