Constant-Overhead Magic State Distillation

• URL: http://arxiv.org/abs/2408.07764v2
• Date: Wed, 21 Aug 2024 03:22:09 GMT
• Title: Constant-Overhead Magic State Distillation
• Authors: Adam Wills, Min-Hsiu Hsieh, Hayata Yamasaki,
• Abstract summary: Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. Existing protocols require polylogarithmically growing overheads with some $gamma > 0$. We develop protocols that achieve an $mathcalO(1)$ overhead, meaning the optimal $gamma = 0$.
• Score: 10.97201040724828
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. The protocol's overhead, defined as the number of input magic states required per output magic state with an error rate below $\epsilon$, typically grows as $\mathcal{O}(\log^\gamma(1/\epsilon))$. Achieving smaller overheads, i.e., smaller exponents $\gamma$, is highly desirable; however, all existing protocols require polylogarithmically growing overheads with some $\gamma > 0$, and identifying the smallest achievable exponent $\gamma$ for distilling magic states of qubits has remained challenging. To address this issue, we develop magic state distillation protocols for qubits with efficient, polynomial-time decoding that achieve an $\mathcal{O}(1)$ overhead, meaning the optimal exponent $\gamma = 0$; this improves over the previous best of $\gamma \approx 0.678$ due to Hastings and Haah. In our construction, we employ algebraic geometry codes to explicitly present asymptotically good quantum codes for $2^{10}$-dimensional qudits that support transversally implementable logical gates in the third level of the Clifford hierarchy. The use of asymptotically good codes with non-vanishing rate and relative distance leads to the constant overhead. These codes can be realised by representing each $2^{10}$-dimensional qudit as a set of $10$ qubits, using stabiliser operations on qubits. The $10$-qubit magic states distilled with these codes can be converted to and from conventional magic states for the controlled-controlled-$Z$ ($CCZ$) and $T$ gates on qubits with only a constant overhead loss, making it possible to achieve constant-overhead distillation of such standard magic states for qubits. These results resolve the fundamental open problem in quantum information theory concerning the construction of magic state distillation protocols with the optimal exponent.

Related papers

• Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates [23.22566380210149]
  We construct quantum codes that support $CCZ$ gates over qudits of arbitrary prime power dimension $q$. The only previously known construction with such linear dimension and distance required a growing alphabet size $q$.
  arXiv  Detail & Related papers  (2024-08-17T16:54:51Z)
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [38.729065908701585]
  We introduce a new class of qubit codes that we call Evenbly codes. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-16T17:18:13Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Low Overhead Qutrit Magic State Distillation [0.0]
  We show that using qutrits rather than qubits leads to a substantial reduction in the overhead cost associated with fault-tolerant quantum computing. We construct a family of $[[9m-k, k, 2]]_3$ triorthogonal qutrit error-correcting codes for any positive $m$ and $k$ with $k leq 3m-2 integers.
  arXiv  Detail & Related papers  (2024-03-10T14:56:07Z)
• Even more efficient magic state distillation by zero-level distillation [0.8009842832476994]
  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.
  arXiv  Detail & Related papers  (2024-03-06T19:01:28Z)
• 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)
• Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits [42.979881926959486]
  We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
  arXiv  Detail & Related papers  (2023-08-16T17:54:56Z)
• 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)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Divide-and-conquer verification method for noisy intermediate-scale quantum computation [0.0]
  noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse quantum computing chip. We propose a method to efficiently verify such noisy intermediate-scale quantum computation.
  arXiv  Detail & Related papers  (2021-09-30T08:56:30Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.