Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Even more efficient magic state distillation by zero-level distillation (2403.03991v1)

Published 6 Mar 2024 in quant-ph

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 takes a large spatiotemporal overhead, which is one of the major bottlenecks for the realization of fault-tolerant quantum computers (FTQC). Here we propose zero-level distillation, which prepares a high fidelity logical magic state using physical qubits on a square lattice using nearest-neighbor two-qubit gates without using multiple logical qubits. The key idea behind is using the Steane code to distill a logical magic state by using noisy Clifford gates with error detection. Then the Steane code state is teleported or converted to the surface codes. By carefully designing such circuits fault-tolerantly, the error rate of the logical magic state scales $\sim 100 \times p2$ 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 two (one) orders of magnitude. This contributes to reducing both space and time overhead for early FTQC as well as full-fledged FTQC combined with conventional multi-level 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

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