Constant-time magic state distillation

• URL: http://arxiv.org/abs/2410.17992v1
• Date: Wed, 23 Oct 2024 16:08:28 GMT
• Title: Constant-time magic state distillation
• Authors: Kwok Ho Wan,
• Abstract summary: We show that, with a re-configurable qubit architecture, we can perform fast, $mathcalO(1)$ code cycles magic state distillation. We confirm the error suppression ability of both distillation circuits, from input error rate $prightarrow mathcalO(p3)$ under circuit-level noise.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present numerical simulation results for the 7-to-1 and 15-to-1 state distillation circuits, constructed using transversal CNOTs acting on multiple surface code patches. The distillation circuits are decoded iteratively using the method outlined in [arXiv:2407.20976]. We show that, with a re-configurable qubit architecture, we can perform fast, $\mathcal{O}(1)$ code cycles magic state distillation. We confirm the error suppression ability of both distillation circuits, from input error rate $p\rightarrow \mathcal{O}(p^{3})$ under circuit-level noise.

Related papers

• Unfolded distillation: very low-cost magic state preparation for biased-noise qubits [1.8749305679160366]
  We propose a low-cost magic state distillation scheme for biased-noise qubits.<n>The logical fidelity remains nearly identical even at a more modest noise bias of $eta gtrsim 80$.<n>Our construction is based on unfolding the $X$ stabilizer group of the Hadamard 3D quantum Reed-Muller code in 2D.
  arXiv  Detail & Related papers  (2025-07-16T18:00:00Z)
• Non-degenerate noise-resilient superconducting qubit [0.531628684262717]
  We propose a superconducting qubit based on engineering the first and second harmonics of the Josephson energy and phase relation. By constructing a circuit such that $E_J2$ is negative and $|E_J1| ll |E_J2|$, we create a periodic potential with two non-degenerate minima. The qubit, which we dub "harmonium", is formed from the lowest-energy states of each minimum.
  arXiv  Detail & Related papers  (2025-02-21T13:34:31Z)
• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Low-overhead magic state distillation with color codes [1.3980986259786223]
  Fault-tolerant implementation of non-Clifford gates is a major challenge for achieving universal fault-tolerant quantum computing. We propose two carefully designed distillation schemes based on the 15-to-1 distillation circuit and lattice surgery. To reach a given target infidelity, our schemes require approximately two orders of magnitude fewer resources than the previous best magic state distillation schemes for color codes.
  arXiv  Detail & Related papers  (2024-09-12T02:20:17Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Finding Transformer Circuits with Edge Pruning [71.12127707678961]
  We propose Edge Pruning as an effective and scalable solution to automated circuit discovery. Our method finds circuits in GPT-2 that use less than half the number of edges compared to circuits found by previous methods. Thanks to its efficiency, we scale Edge Pruning to CodeLlama-13B, a model over 100x the scale that prior methods operate on.
  arXiv  Detail & Related papers  (2024-06-24T16:40:54Z)
• Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States [0.8009842832476994]
  We evaluate the spatial temporal overhead of two-level distillation implementations generating relatively high-fidelity magic states. We refine the second-level 15-to-1 implementation in it to capitalize on the small footprint of zero-level distillation.
  arXiv  Detail & Related papers  (2024-04-15T12:42:29Z)
• 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)
• Faster-than-Clifford Simulations of Entanglement Purification Circuits and Their Full-stack Optimization [0.0]
  We develop a simulation algorithm for distillation circuits with gate-simulation complexity of $mathcalO(1)$ steps. It enabled us to use a simple discrete optimization algorithm to design purification circuits from $n$ raw Bell pairs to $k$ purified pairs. The resulting purification circuits are the best-known purification circuits for finite-size noisy hardware.
  arXiv  Detail & Related papers  (2023-07-12T18:00:00Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• Fast quantum circuit cutting with randomized measurements [0.0]
  We propose a new method to extend the size of a quantum computation beyond the number of physical qubits available on a single device. This is accomplished by randomly inserting measure-and-prepare channels to express the output state of a large circuit as a separable state across distinct devices.
  arXiv  Detail & Related papers  (2022-07-29T15:13:04Z)
• Batch-efficient EigenDecomposition for Small and Medium Matrices [65.67315418971688]
  EigenDecomposition (ED) is at the heart of many computer vision algorithms and applications. We propose a QR-based ED method dedicated to the application scenarios of computer vision.
  arXiv  Detail & Related papers  (2022-07-09T09:14:12Z)
• On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
  We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
  arXiv  Detail & Related papers  (2021-01-12T21:36:16Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)

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.