A small and interesting architecture for early fault-tolerant quantum computers

• URL: http://arxiv.org/abs/2507.20387v1
• Date: Sun, 27 Jul 2025 19:07:12 GMT
• Title: A small and interesting architecture for early fault-tolerant quantum computers
• Abstract summary: We present an architecture for early fault-tolerant quantum computers based on the smallest interesting colour code.<n>It consists of single-qubit measurements and preparations in the X and bases, single-qubit Hadamard (H) gates, and three-qubit controlled-controlled-Z (CCZ) gates.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present an architecture for early fault-tolerant quantum computers based on the smallest interesting colour code (Earl Campbell, 2016). It realizes a universal logical gate set consisting of single-qubit measurements and preparations in the X and Z bases, single- qubit Hadamard (H) gates, and three-qubit controlled-controlled-Z (CCZ) gates. State teleportations between [[4, 2, 2]] (2D) and [[8, 3, 2]] (3D) error-detecting color codes allow one to make use of the respective transversal H and CCZ gates that these codes possess. As such, minimizing the number of logical quantum teleportation operations, not the number of logical quantum non-Clifford gates, is the relevant optimization goal. To help hardware developers characterize this architecture, we also provide an experimental protocol tailored to testing logical quantum circuits expressed in it.

Related papers

• Complementary 3D color codes for transversal quantum logic [4.568256986294634]
  Transversal logical gates provide a direct route to fault-tolerant quantum computation, but the Eastin-Knill theorem forbids a universal gate set within a single quantum error-correcting code.<n>We propose a hybrid architecture based on the tetrahedral three-dimensional color code and its Hadamard-bitsed counterpart, which we call the H-tetrahedral code.<n>We complete a universal gate set through a pieceably fault-tolerant round-leaved construction of a logical controlled-$Z$ gate between two H-tetrahedral codes.
  arXiv  Detail & Related papers  (2026-07-06T14:01:07Z)
• Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery [0.34286994433699663]
  We report on the generation and certification of genuine logical multipartite entanglement in a trapped-ion quantum processor.<n>The gate set is accessed via lattice surgery across two different codes.<n>These demonstrations showcase the core building blocks of an architecture for fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2026-07-05T11:01:11Z)
• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• Exploiting Movable Logical Qubits for Lattice Surgery Compilation [43.290156259065554]
  We introduce a paradigm shift by exploiting movable logical qubits via teleportation during the logical lattice surgery CNOT gate.<n> Numerical simulations show that the proposed approach can substantially reduce the routed circuit depth.<n>An open-source implementation of our method is available on GitHub.
  arXiv  Detail & Related papers  (2025-12-03T19:00:04Z)
• Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads [0.0]
  Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds.<n>Type 1 architectures consist of small quantum nodes connected via Greenberger-e-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements.<n>Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local.<n>Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as lattice gates, lattice surgery, and teleportation.
  arXiv  Detail & Related papers  (2025-11-17T18:14:38Z)
• Architectural mechanisms of a universal fault-tolerant quantum computer [26.089864626892876]
  Quantum error correction (QEC) is believed to be essential for the realization of large-scale quantum computers.<n>Here we utilize reconfigurable arrays of up to 448 neutral atoms to implement all key elements of a universal, fault-tolerant quantum processing architecture.
  arXiv  Detail & Related papers  (2025-06-25T17:53:57Z)
• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer.<n>Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• 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)
• Logical quantum processor based on reconfigurable atom arrays [27.489364850707926]
  We report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Results herald the advent of early error-corrected quantum computation.
  arXiv  Detail & Related papers  (2023-12-07T01:54:45Z)
• 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)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• 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)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• 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)
• Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers [45.66259474547513]
  We design quantum circuits by using the standard cell approach borrowed from classical circuit design. We present evidence that, when compared with automatic routing methods, our layout-aware routers are significantly faster and achieve shallower 3D circuits.
  arXiv  Detail & Related papers  (2022-06-10T10:54:46Z)
• 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)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.