Experimental fault-tolerant code switching

• URL: http://arxiv.org/abs/2403.13732v1
• Date: Wed, 20 Mar 2024 16:40:57 GMT
• Title: Experimental fault-tolerant code switching
• Authors: Ivan Pogorelov, Friederike Butt, Lukas Postler, Christian D. Marciniak, Philipp Schindler, Markus Müller, Thomas Monz,
• Abstract summary: We present the first experimental implementation of fault-tolerant code switching between two codes. We construct logical circuits and prepare 12 different logical states which are not accessible in a fault-tolerant way within a single code. Our results experimentally open up a new route towards deterministic control over logical qubits with low auxiliary qubit overhead.
• Score: 1.9088985324817254
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction is a crucial tool for mitigating hardware errors in quantum computers by encoding logical information into multiple physical qubits. However, no single error-correcting code allows for an intrinsically fault-tolerant implementation of all the gates needed for universal quantum computing [1-3]. One way to tackle this problem is to switch between two suitable error-correcting codes, while preserving the encoded logical information, which in combination give access to a fault-tolerant universal gate set [4-6]. In this work, we present the first experimental implementation of fault-tolerant code switching between two codes. One is the seven-qubit color code [7], which features fault-tolerant CNOT and $H$ quantum gates, while the other one, the 10-qubit code [8], allows for a fault-tolerant $T$-gate implementation. Together they form a complementary universal gate set. Building on essential code switching building blocks, we construct logical circuits and prepare 12 different logical states which are not accessible natively in a fault-tolerant way within a single code. Finally, we use code switching to entangle two logical qubits employing the full universal gate set in a single logical quantum circuit. Our results experimentally open up a new route towards deterministic control over logical qubits with low auxiliary qubit overhead, not relying on the probabilistic preparation of resource states.

Related papers

• Efficient fault-tolerant code switching via one-way transversal CNOT gates [0.0]
  We present a code scheme that respects the constraints of FT circuit design by only making use of switching gates. We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors. We discuss how the scheme can be implemented with a large degree of parallelization, provided that logical auxiliary qubits can be prepared reliably enough.
  arXiv  Detail & Related papers  (2024-09-20T12:54:47Z)
• Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code [0.0]
  We observe improved performance for encoded circuits implementing non-Clifford gates. Our results illustrate the potential of using codes with quantum gates to implement non-trivial algorithms.
  arXiv  Detail & Related papers  (2023-09-15T18:00:02Z)
• Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors [0.0]
  Top color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Top color codes can provide a universal gate set $$H, T, C$$, with the T-gate missing in the T-dimensional and the H-gate in the three-dimensional case. We construct resource-optimized deterministic and non-deterministic code switching protocols for two- and three-dimensional distance-three color codes.
  arXiv  Detail & Related papers  (2023-06-30T14:16:52Z)
• 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)
• Protecting Expressive Circuits with a Quantum Error Detection Code [0.0]
  We develop a quantum error detection code for implementations on existing trapped-ion computers. By encoding $k$ logical qubits into $k+2$ physical qubits, this code presents fault-tolerant state initialisation and syndrome measurement circuits.
  arXiv  Detail & Related papers  (2022-11-12T16:46:35Z)
• A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
  Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
  arXiv  Detail & Related papers  (2022-09-08T17:55:30Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Experimental Characterization of Fault-Tolerant Circuits in Small-Scale Quantum Processors [67.47400131519277]
  A code's logical gate set may be deemed fault-tolerant for gate sequences larger than 10 gates. Some circuits did not satisfy the fault tolerance criterion. It is most accurate to assess the fault tolerance criterion when the circuits tested are restricted to those that give rise to an output state with a low dimension.
  arXiv  Detail & Related papers  (2021-12-08T01:52:36Z)
• Demonstration of fault-tolerant universal quantum gate operations [1.1817296279855427]
  Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits. Errors caused by imperfect operations do not spread uncontrollably through the quantum register. We demonstrate a fault-tolerant universal set of gates on two logical qubits in a trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2021-11-24T17:34:14Z)
• 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)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)

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.