Papers
Topics
Authors
Recent
Search
2000 character limit reached

Efficient Magic State Distillation by Zero-Level Distillation

Published 6 Mar 2024 in quant-ph | (2403.03991v2)

Abstract: Magic state distillation (MSD) is an essential element for universal fault-tolerant quantum computing, which distills a high-fidelity magic state from noisy magic states using ideal (error-corrected) Clifford operations. For ideal Clifford operations, it needs to be performed on the logical qubits and hence incurs a large spatiotemporal overhead, which is one of the major bottlenecks for the realization of fault-tolerant quantum computers (FTQCs). Here we propose zero-level distillation, which prepares a high-fidelity logical magic state at the physical level, namely zero level, using physical qubits and nearest-neighbor two-qubit gates on a square lattice. We develop a zero-level distillation circuit and show that distillation can be made even more efficient than the conventional sophisticated approaches with logical level distillations. The key idea involves the Knill et al.-type distillation using the Steane code and its careful mapping to the square-lattice architecture with error detection. The distilled magic state on the Steane-code state is then teleported or converted to surface codes. We numerically find that the error rate of the logical magic state scales as approximately $100 \times p{2}$ in terms of the physical error rate $p$. For example, with a physical error rate of $p = 10{-4}$ ($10{-3}$), the logical error rate is reduced to $p_{L} = 10{-6}$ ($10{-4}$), resulting in an improvement of 2 (1) orders of magnitude. This contributes to reducing both space and time overhead for early FTQC as well as full-fledged FTQC combined with conventional multilevel distillation protocols.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484–1509, 1997.
  2. Quantum algorithm for linear systems of equations. Physical review letters, 103(15):150502, 2009.
  3. Simulated quantum computation of molecular energies. Science, 309(5741):1704–1707, 2005.
  4. A. Morvan et al. Phase transition in random circuit sampling, 2023.
  5. Evidence for the utility of quantum computing before fault tolerance. Nature, 618(7965):500–505, Jun 2023.
  6. John Preskill. Quantum Computing in the NISQ era and beyond. Quantum, 2:79, August 2018.
  7. Variational quantum algorithms. Nature Reviews Physics, 3(9):625–644, Sep 2021.
  8. Peter W Shor. Scheme for reducing decoherence in quantum computer memory. Physical review A, 52(4):R2493, 1995.
  9. Keisuke Fujii. Quantum computation with topological codes: from qubit to topological fault-tolerance, 2015.
  10. A.Yu. Kitaev. Fault-tolerant quantum computation by anyons. Annals of Physics, 303(1):2–30, 2003.
  11. Measurement-based quantum computation with the toric code states. Phys. Rev. A, 76:022304, Aug 2007.
  12. Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A, 86:032324, Sep 2012.
  13. A one-way quantum computer. Phys. Rev. Lett., 86:5188–5191, May 2001.
  14. Emanuel Knill Bryan Eastin. Restrictions on transversal encoded quantum gate sets. Phys. Rev. Lett. 102, 110502, 2009.
  15. Universal quantum computation with ideal clifford gates and noisy ancillas. Physical Review A, 71(2):022316, 2005.
  16. Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature, 402(6760):390–393, 1999.
  17. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum, 5:433, April 2021.
  18. Hayato Goto. Minimizing resource overheads for fault-tolerant preparation of encoded states of the steane code. Scientific Reports volume 6, Article number: 19578, 2016.
  19. Partially fault-tolerant quantum computing architecture with error-corrected clifford gates and space-time efficient analog rotations, 2023.
  20. Daniel Litinski. Magic State Distillation: Not as Costly as You Think. Quantum, 3:205, December 2019.
  21. Resilient quantum computation. Science, 279(5349):342–345, 1998.
  22. Resilient quantum computation: error models and thresholds. Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454(1969):365–384, 1998.
  23. Fault-tolerant interface between quantum memories and quantum processors. Nature Communications, 8(1):1321, 2017.
  24. Fault-tolerant quantum error correction on near-term quantum processors using flag and bridge qubits. Physical Review A, 101(3):032333, 2020.
  25. Qulacs: a fast and versatile quantum circuit simulator for research purpose. Quantum, 5:559, 2021.
  26. Simulation and performance analysis of quantum error correction with a rotated surface code under a realistic noise model. Phys. Rev. Res., 6:013024, Jan 2024.
Citations (6)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Collections

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

Tweets

Sign up for free to view the 3 tweets with 2 likes about this paper.