Even more efficient magic state distillation by zero-level distillation
- URL: http://arxiv.org/abs/2403.03991v1
- Date: Wed, 6 Mar 2024 19:01:28 GMT
- Title: Even more efficient magic state distillation by zero-level distillation
- Authors: Tomohiro Itogawa, Yugo Takada, Yutaka Hirano, Keisuke Fujii
- Abstract summary: We propose zero-level distillation, which prepares a high fidelity logical magic state using physical qubits on a square lattice.
The key idea behind is using the Steane code to distill a logical magic state by using noisy Clifford gates with error detection.
- Score: 0.8009842832476994
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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 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 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.
Related papers
- Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - Logical Magic State Preparation with Fidelity Beyond the Distillation
Threshold on a Superconducting Quantum Processor [20.66929930736679]
Fault-tolerant quantum computing based on surface code has emerged as an attractive candidate for practical large-scale quantum computers.
We present a hardware-efficient and scalable protocol for arbitrary logical state preparation for the rotated surface code.
We further experimentally implement it on the textitZuchongzhi 2.1 superconducting quantum processor.
arXiv Detail & Related papers (2023-05-25T12:10:59Z) - Transversal Injection: A method for direct encoding of ancilla states
for non-Clifford gates using stabiliser codes [55.90903601048249]
We introduce a protocol to potentially reduce this overhead for non-Clifford gates.
Preliminary results hint at high quality fidelities at larger distances.
arXiv Detail & Related papers (2022-11-18T06:03:10Z) - Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
We report the measurement of logical qubit performance scaling across multiple code sizes.
Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number.
Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
arXiv Detail & Related papers (2022-07-13T18:00:02Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - Demonstration of Shor encoding on a trapped-ion quantum computer [0.7036032466145112]
Fault-tolerant quantum error correction (QEC) is crucial for unlocking the true power of quantum computers.
QEC codes use multiple physical qubits to encode a logical qubit, which is protected against errors at the physical qubit level.
arXiv Detail & Related papers (2021-04-02T19:14:30Z) - Exponential suppression of bit or phase flip errors with repetitive
error correction [56.362599585843085]
State-of-the-art quantum platforms typically have physical error rates near $10-3$.
Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits.
We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
arXiv Detail & Related papers (2021-02-11T17:11:20Z) - Quantum error mitigation as a universal error-minimization technique:
applications from NISQ to FTQC eras [0.9622115055919379]
In the early years of fault-tolerant quantum computing (FTQC), the available code distance and the number of magic states will be restricted.
Here, we integrate quantum error correction and quantum error mitigation into an efficient FTQC architecture.
This scheme will dramatically alleviate the required computational overheads and hasten the arrival of the FTQC era.
arXiv Detail & Related papers (2020-10-08T10:27:29Z) - Constant depth fault-tolerant Clifford circuits for multi-qubit large
block codes [2.3513645401551333]
This paper focuses on Calderbank-Shor-Steane $[![ n,k,d ]!]$ (CSS) codes and their logical FT Clifford circuits.
We show that the depth of an arbitrary logical Clifford circuit can be implemented fault-tolerantly in $O(1)$ steps emphin-situ via either Knill or Steane syndrome measurement circuit.
arXiv Detail & Related papers (2020-03-27T11:07:16Z) - Very low overhead fault-tolerant magic state preparation using redundant
ancilla encoding and flag qubits [1.2891210250935146]
We introduce a new concept which we call redundant ancilla encoding.
We show that our scheme can produce magic states using an order of magnitude fewer qubits and space-time overhead.
arXiv Detail & Related papers (2020-03-06T06:24:02Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.