Code switching revisited: Low-overhead magic state preparation using color codes

• URL: http://arxiv.org/abs/2410.07327v3
• Date: Wed, 23 Apr 2025 18:03:18 GMT
• Title: Code switching revisited: Low-overhead magic state preparation using color codes
• Authors: Lucas Daguerre, Isaac H. Kim,
• Abstract summary: We propose a protocol to prepare a high-fidelity magic state on a two-dimensional (2D) color code using a three-dimensional (3D) color code.<n>We numerically demonstrate that these modifications lead to a significant improvement in the fidelity of the magic state.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a protocol to prepare a high-fidelity magic state on a two-dimensional (2D) color code using a three-dimensional (3D) color code. Our method modifies the known code switching protocol with (i) a recently discovered transversal gate between the 2D and the 3D code and (ii) a judicious use of flag-based postselection. We numerically demonstrate that these modifications lead to a significant improvement in the fidelity of the magic state. For instance, subjected to a uniform circuit-level noise of $10^{-3}$ (excluding idling noise), our code switching protocol yields a magic state encoded in the distance-$3$ 2D color code with a logical infidelity of $4.6\times 10^{-5}\pm 1.6 \times 10^{-5}$ (quantified by an error-corrected logical state tomography) with an $84\%$ of acceptance rate. Used in conjunction with a postselection approach, extrapolation from a polynomial fit suggests a fidelity improvement to $5.1 \times 10^{-7}$ for the same code. Our protocol is aimed for architectures that allow nonlocal connectivity and should be readily implementable in near-term devices. Finally, we also present a simulation technique akin to an extended stabilizer simulator which effectively incorporates the non-Clifford $T$-gate, that permits to simulate the protocol without resorting to a resource intensive state-vector simulation.

Related papers

• Efficient Magic State Cultivation on $\mathbb{RP}^2$ [4.828791769306579]
  We propose a new magic state cultivation protocol that produces a logical $mathrmT$ state on a rotated surface code. Small $mathbbRP2$ codes are used to hold logical information and checked by syndrome extraction circuits. Our protocol requires about an order of magnitude smaller space-time volume to reach a target logical error rate around $10-9$ compared to the original MSC protocol.
  arXiv  Detail & Related papers  (2025-03-24T13:20:57Z)
• 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)
• Scaling and logic in the color code on a superconducting quantum processor [109.61104855764401]
  We present a demonstration of the color code on a superconducting processor, achieving logical error suppression and performing logical operations. We inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection. This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors.
  arXiv  Detail & Related papers  (2024-12-18T19:00:05Z)
• 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)
• Scalable 3D Registration via Truncated Entry-wise Absolute Residuals [65.04922801371363]
  A $3$D registration approach can process more than ten million ($107$) point pairs with over $99%$ random outliers. We call our method TEAR, as it involves minimizing an outlier-robust loss that computes Truncated Entry-wise Absolute Residuals.
  arXiv  Detail & Related papers  (2024-04-01T04:43:39Z)
• Facilitating Practical Fault-tolerant Quantum Computing Based on Color Codes [0.6963971634605797]
  In this work, we address several key issues to facilitate practical fault-tolerant quantum computing based on color codes. First, by introducing decoding graphs with error-rate-related weights, we obtained the threshold of $0.57%$ of the triangular color code. Second, our work firstly investigates the circuit-level decoding of color code lattice surgery, and gives an efficient decoding algorithm. Third, a new state injection protocol of the triangular color code is proposed, reducing the output magic state error rate in one round of 15 to 1 distillation by two orders of magnitude compared to a previous rough protocol.
  arXiv  Detail & Related papers  (2023-09-11T03:56:18Z)
• Code conversion with the quantum Golay code for a universal transversal gate set [0.13597551064547497]
  The $[[7,1,3]]$ Steane code and $[[23,1,7]]$ quantum Golay code have been identified as good candidates for fault-tolerant quantum computing via code concatenation. A crucial ingredient to this procedure is the $[49,1,5]]$ triorthogonal code, which can itself be seen as related to the self-dual $[[17,1,5]]$ 2D color code.
  arXiv  Detail & Related papers  (2023-07-26T18:00:04Z)
• Learning Deep Implicit Functions for 3D Shapes with Dynamic Code Clouds [56.385495276042406]
  Deep Implicit Function (DIF) has gained popularity as an efficient 3D shape representation. We propose to learn DIF with Dynamic Code Cloud, named DCC-DIF. Our method explicitly associates local codes with learnable position vectors, and the position vectors are continuous and can be dynamically optimized.
  arXiv  Detail & Related papers  (2022-03-26T11:07:59Z)
• Low-overhead quantum computing with the color code [1.4999444543328293]
  We show that an approach based on the color code can lead to considerable reductions in the resource overheads. We propose a lattice surgery scheme that exploits the rich structure of the color-code phase to perform arbitrary pairs of commuting logical Pauli measurements in parallel.
  arXiv  Detail & Related papers  (2022-01-19T19:00:02Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• A decoder for the triangular color code by matching on a M\"obius strip [3.8073142980733]
  The color code is remarkable for its ability to perform fault-tolerant logic gates. This motivates the design of practical decoders that minimise the resource cost of color-code quantum computation. Our decoder is derived using relations among the stabilizers that preserve global conservation laws at the lattice boundary.
  arXiv  Detail & Related papers  (2021-08-25T18:00:03Z)
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes [63.62764375279861]
  We compare two leading FT implementations of the T gate in 2D color codes under circuit noise. We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
  arXiv  Detail & Related papers  (2021-01-06T19:00:01Z)
• Efficient color code decoders in $d\geq 2$ dimensions from toric code decoders [77.34726150561087]
  We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds. We numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise.
  arXiv  Detail & Related papers  (2019-05-17T17:41:50Z)

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.