Planar fault-tolerant circuits for non-Clifford gates on the 2D color code

• URL: http://arxiv.org/abs/2505.05175v1
• Date: Thu, 08 May 2025 12:23:22 GMT
• Title: Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
• Authors: Andreas Bauer, Julio C. Magdalena de la Fuente,
• Abstract summary: We introduce a family of scalable planar fault-tolerant circuits that implement logical non-Clifford operations on a 2D color code.<n>The circuits are relatively simple, consisting only of physical $T$ gates, $ CX$ gates, and few-qubit measurements.<n>We describe in detail how fault tolerance is achieved using a "just-in-time" decoding strategy.
• Score: 0.66648433950413
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a family of scalable planar fault-tolerant circuits that implement logical non-Clifford operations on a 2D color code, such as a logical $T$ gate or a logical non-Pauli measurement that prepares a magic $|T\rangle$ state. The circuits are relatively simple, consisting only of physical $T$ gates, $CX$ gates, and few-qubit measurements. They can be implemented with an array of qubits on a 2D chip with nearest-neighbor couplings, and no wire crossings. The construction is based on a spacetime path integral representation of a non-Abelian 2+1D topological phase, which is related to the 3D color code. We turn the path integral into a circuit by expressing it as a spacetime $ZX$ tensor network, and then traversing it in some chosen time direction. We describe in detail how fault tolerance is achieved using a "just-in-time" decoding strategy, for which we repurpose and extend state-of-the-art color-code matching decoders.

Related papers

• Universal fault tolerant quantum computation in 2D without getting tied in knots [1.796950496605906]
  We show how to perform fault-tolerant non-Clifford gates in two dimensions.<n>We formulate a path framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits.
  arXiv  Detail & Related papers  (2025-03-19T23:59:46Z)
• Quantum Codes with Addressable and Transversal Non-Clifford Gates [8.194994143531677]
  We study codes that support gates which induce $textitaddressable$ logical gates.<n>We develop a formalism for constructing quantum codes with $textitaddressable and $ell neq 2$ gates.
  arXiv  Detail & Related papers  (2025-02-03T22:24:34Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>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.<n>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.<n>We inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection.<n>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)
• Targeted Clifford logical gates for hypergraph product codes [61.269295538188636]
  We construct explicit targeted logical gates for hypergraph product codes. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• Color code with a logical control-$S$ gate using transversal $T$ rotations [2.1756081703276]
  Three-dimensional examples of the color code have shown us how its structure, specifically the intersection of the supports of logical operators, can give rise to non-Clifford $T$ and $CCZ$. Here we present a color code with a logical control-$S$ gate that is accomplished with $Tdagger$ rotations on its physical qubits.
  arXiv  Detail & Related papers  (2024-11-22T16:08:33Z)
• Quantum Rainbow Codes [0.0]
  We introduce rainbow codes, a novel class of quantum error correcting codes generalising colour codes and pin codes. Rainbow codes can be defined on any $Ddimensional simplicial complex that admits a valid $(D+1)$colouring of its $0simplices.
  arXiv  Detail & Related papers  (2024-08-23T14:56:55Z)
• The x+y Floquet code: A simple example for topological quantum computation in the path integral approach [0.7873629568804646]
  We construct a new fault-tolerant circuit for the toric-code phase by traversing its path integral on a $(x,y,z)$ cubic lattice in the $x+y$ direction.<n>We show how to incorporate boundaries and corners into the fault-tolerant circuit and how to perform topologically protected logic gates.
  arXiv  Detail & Related papers  (2024-08-14T03:15:08Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
  We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit. This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
  arXiv  Detail & Related papers  (2023-04-04T23:06:22Z)
• 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)
• 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)

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.