Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors

• URL: http://arxiv.org/abs/2306.17686v1
• Date: Fri, 30 Jun 2023 14:16:52 GMT
• Title: Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors
• Authors: Friederike Butt, Sascha Heu{\ss}en, Manuel Rispler, Markus M\"uller
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Topological color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Neither a two-dimensional nor a three-dimensional topology, however, can provide a universal gate set $\{$H, T, CNOT$\}$, with the T-gate missing in the two-dimensional and the H-gate in the three-dimensional case. These complementary shortcomings of the isolated topologies may be overcome in a combined approach, by switching between a two- and a three-dimensional code while maintaining the logical state. In this work, we construct resource-optimized deterministic and non-deterministic code switching protocols for two- and three-dimensional distance-three color codes using fault-tolerant quantum circuits based on flag-qubits. Deterministic protocols allow for the fault-tolerant implementation of logical gates on an encoded quantum state, while non-deterministic protocols may be used for the fault-tolerant preparation of magic states. Taking the error rates of state-of-the-art trapped-ion quantum processors as a reference, we find a logical failure probability of $3\%$ for deterministic logical gates, which cannot be realized transversally in the respective code. By replacing the three-dimensional distance-three color code in the protocol for magic state preparation with the morphed code introduced in [1], we reduce the logical failure rates by two orders of magnitude, thus rendering it a viable method for magic state preparation on near-term quantum processors. Our results demonstrate that code switching enables the fault-tolerant and deterministic implementation of a universal gate set under realistic conditions, and thereby provide a practical avenue to advance universal, fault-tolerant quantum computing and enable quantum algorithms on first, error-corrected logical qubits.

Related papers

• Measurement-free, scalable and fault-tolerant universal quantum computing [1.2600261666440378]
  We present a complete toolbox for fault-tolerant universal quantum computing without the need for measurements during algorithm execution. We develop new fault-tolerant, measurement-free protocols to transfer encoded information between 2D and 3D color codes. Our measurement-free approach provides a practical and scalable pathway for universal quantum computing on state-of-the-art quantum processors.
  arXiv  Detail & Related papers  (2024-10-17T14:04:14Z)
• 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)
• Experimental fault-tolerant code switching [1.9088985324817254]
  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.
  arXiv  Detail & Related papers  (2024-03-20T16:40:57Z)
• 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)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• 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)
• 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)
• Fault-tolerant circuit synthesis for universal fault-tolerant quantum computing [0.0]
  We present a quantum circuit synthesis algorithm for implementing universal fault-tolerant quantum computing based on geometricd codes. We show how to synthesize the set of universal fault-tolerant protocols for $[[7,1,3]]$ Steane code and the syndrome measurement protocol of $[[23, 1, 7]]$ Golay code.
  arXiv  Detail & Related papers  (2022-06-06T15:43:36Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

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.