Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0908.0768 · Physical Review A

Error-correcting one-way quantum computation with global entangling gates

Jaewoo Joo, David L. Feder

Published Sep 11, 2009• 8 citations
arXivHTMLPDF

Abstract

We present an approach to one-way quantum computation (1WQC) that can compensate for single-qubit errors by encoding the logical information residing on physical qubits into five-qubit error-correcting code states. A logical two-qubit cluster state that is the fundamental resource for encoded quantum teleportation is then described by a graph state containing ten vertices with constant degree seven. Universal 1WQC that incorporates error correction requires only multiple copies of this logical two-qubit state and a logical four-qubit linear cluster state, which are prepared only just in advance of their use in order to minimize the accumulation of errors. We suggest how to implement this approach in systems characterized by qubits in regular two-dimensional lattices for which entangling gates are generically global operations, such as atoms in optical lattices, quantum dots, or superconducting qubits.

DOI
10.1103/physreva.80.032312

Related papers

One-way quantum computing in optical lattices with many-atom addressing

Tim Friesen, David L. Feder

One of the fundamental conditions for one-way quantum computation (1WQC) is the ability to make sequential measurements on isolated qubits that comprise the highly entangled resource for 1WQC, the cluster state. This has been a significant impediment in the implementation of 1WQC with ultracold atoms confined in optical lattices, because the width of the measuring lasers is generally much greater than the atomic (qubit) spacing. We demonstrate that deterministic 1WQC is nevertheless possible, with a polynomial increase in the number of operations, as long as the center of the beams can be positioned with high accuracy and the beam width is reproducible. Extending the number of cluster atoms, the scheme is also able to compensate for accidental measurements of an arbitrary number of nearby qubits.

arXiv:0707.3821•Physical Review A•Sep 10, 2008•6 citations

Quantum teleportation of physical qubits into logical code spaces

Yi-Han Luo, Ming-Cheng Chen, Manuel Erhard +13 more

Quantum error correction is an essential tool for reliably performing tasks for processing quantum information on a large scale. However, integration into quantum circuits to achieve these tasks is problematic when one realizes that nontransverse operations, which are essential for universal quantum computation, lead to the spread of errors. Quantum gate teleportation has been proposed as an elegant solution for this. Here, one replaces these fragile, nontransverse inline gates with the generation of specific, highly entangled offline resource states that can be teleported into the circuit to implement the nontransverse gate. As the first important step, we create a maximally entangled state between a physical and an error-correctable logical qubit and use it as a teleportation resource. We then demonstrate the teleportation of quantum information encoded on the physical qubit into the error-corrected logical qubit with fidelities up to 0.786. Our scheme can be designed to be fully fault tolerant so that it can be used in future large-scale quantum technologies.

arXiv:2009.06242•Proceedings of the National Academy of Sciences•Sep 3, 2021•52 citations

Experimental exploration of five-qubit quantum error-correcting code with superconducting qubits

Ming Gong, Xiao Yuan, Shiyu Wang +19 more

Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal quantum error-correcting code, with the subsequent verification of all key features including the identification of an arbitrary physical error, the capability for transversal manipulation of the logical state and state decoding. To address this challenge, we experimentally realise the [5, 1, 3] code, the so-called smallest perfect code that permits corrections of generic single-qubit errors. In the experiment, having optimised the encoding circuit, we employ an array of superconducting qubits to realise the [5, 1, 3] code for several typical logical states including the magic state, an indispensable resource for realising non-Clifford gates. The encoded states are prepared with an average fidelity of [Formula: see text] while with a high fidelity of [Formula: see text] in the code space. Then, the arbitrary single-qubit errors introduced manually are identified by measuring the stabilisers. We further implement logical Pauli operations with a fidelity of [Formula: see text] within the code space. Finally, we realise the decoding circuit and recover the input state with an overall fidelity of [Formula: see text], in total with 92 gates. Our work demonstrates each key aspect of the [5, 1, 3] code and verifies the viability of experimental realisation of quantum error-correcting codes with superconducting qubits.

arXiv:1907.04507•National Science Review•Jan 15, 2021•79 citations

Cluster-based architecture for fault-tolerant quantum computation

Keisuke Fujii, Katsuji Yamamoto

We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite different way from the usual circuit-based architecture where physical gates are recursively replaced by logical gates with error-correction gadgets. Instead, some relevant cluster states, say fundamental clusters, are recursively constructed through verification and postselection in advance for the higher-level one-way computation, which namely provides error-precorrection of gate operations. A suitable code such as the Steane seven-qubit code is adopted for transversal operations. This concatenated construction of verified fundamental clusters has a simple transversal structure of logical errors, and achieves a high noise threshold $~3%$ for computation by using appropriate verification procedures. Since the postselection is localized within each fundamental cluster with the help of deterministic bare controlled-$Z$ gates without verification, divergence of resources is restrained, which reconciles postselection with scalability.

arXiv:0912.5150•Physical Review A•Apr 27, 2010•18 citations

Addressable gate-based logical computation with quantum LDPC codes

Laura Pecorari, Francesco Paolo Guerci, Hugo Perrin +1 more

Quantum computing relies on quantum error correction for high-fidelity logical operations, but scaling to achieve near-term quantum utility is highly resource-intensive. High-rate quantum LDPC codes can reduce error correction overhead, yet realizing high-rate fault-tolerant computation with these codes remains a central challenge. Apart of the lattice surgery approach, standard schemes for realizing logical gates have so far been restricted to performing global operations on all logical qubits at the same time. Another approach relies on low-rate code switching methods. In this work, we introduce a gate-based protocol for addressable single- and multi-qubit Clifford operations on individual logical qubits encoded within one or more quantum LDPC codes. Our scheme leverages logical transversal operations via an auxiliary Bacon-Shor code to perform logical operations with constant time overhead enabled by teleportation. We demonstrate the implementation of an overcomplete logical Clifford gate set and perform numerical simulations to evaluate the error-correction performance of our protocol. Finally, we observe that our scheme can be integrated with magic state cultivation protocols to achieve universal, gate-based, and fully addressable quantum computation.

quant-pharXiv:2511.06124•Nov 11, 2025•9 citations

Experimental Implementation of Encoded Logical Qubit Operations in a Perfect Quantum Error Correcting Code

Jingfu Zhang, Raymond Laflamme, Dieter Suter

Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit encoded in a five qubit system that allows correction of arbitrary single-qubit errors. We perform quantum process tomography of the encoded gate operations, demonstrate the successful correction of all possible single-qubit errors, and measure the fidelity of the encoded logical gate operations.

arXiv:1208.4797•Physical Review Letters•Sep 6, 2012•64 citations
We present an approach to one-way quantum computation (1WQC) that can compensate for single-qubit errors by encoding the logical information residing on physical qubits into five-qubit error-correcting code states. A logical two-qubit cluster state that is the fundamental resource for encoded quantum teleportation is then described by a graph state containing ten vertices with constant degree seven. Universal 1WQC that incorporates error correction requires only multiple copies of this logical two-qubit state and a logical four-qubit linear cluster state, which are prepared only just in advance of their use in order to minimize the accumulation of errors. We suggest how to implement this approach in systems characterized by qubits in regular two-dimensional lattices for which entangling gates are generically global operations, such as atoms in optical lattices, quantum dots, or superconducting qubits.
One of the fundamental conditions for one-way quantum computation (1WQC) is the ability to make sequential measurements on isolated qubits that comprise the highly entangled resource for 1WQC, the cluster state. This has been a significant impediment in the implementation of 1WQC with ultracold atoms confined in optical lattices, because the width of the measuring lasers is generally much greater than the atomic (qubit) spacing. We demonstrate that deterministic 1WQC is nevertheless possible, with a polynomial increase in the number of operations, as long as the center of the beams can be positioned with high accuracy and the beam width is reproducible. Extending the number of cluster atoms, the scheme is also able to compensate for accidental measurements of an arbitrary number of nearby qubits.
Quantum error correction is an essential tool for reliably performing tasks for processing quantum information on a large scale. However, integration into quantum circuits to achieve these tasks is problematic when one realizes that nontransverse operations, which are essential for universal quantum computation, lead to the spread of errors. Quantum gate teleportation has been proposed as an elegant solution for this. Here, one replaces these fragile, nontransverse inline gates with the generation of specific, highly entangled offline resource states that can be teleported into the circuit to implement the nontransverse gate. As the first important step, we create a maximally entangled state between a physical and an error-correctable logical qubit and use it as a teleportation resource. We then demonstrate the teleportation of quantum information encoded on the physical qubit into the error-corrected logical qubit with fidelities up to 0.786. Our scheme can be designed to be fully fault tolerant so that it can be used in future large-scale quantum technologies.
Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal quantum error-correcting code, with the subsequent verification of all key features including the identification of an arbitrary physical error, the capability for transversal manipulation of the logical state and state decoding. To address this challenge, we experimentally realise the [5, 1, 3] code, the so-called smallest perfect code that permits corrections of generic single-qubit errors. In the experiment, having optimised the encoding circuit, we employ an array of superconducting qubits to realise the [5, 1, 3] code for several typical logical states including the magic state, an indispensable resource for realising non-Clifford gates. The encoded states are prepared with an average fidelity of [Formula: see text] while with a high fidelity of [Formula: see text] in the code space. Then, the arbitrary single-qubit errors introduced manually are identified by measuring the stabilisers. We further implement logical Pauli operations with a fidelity of [Formula: see text] within the code space. Finally, we realise the decoding circuit and recover the input state with an overall fidelity of [Formula: see text], in total with 92 gates. Our work demonstrates each key aspect of the [5, 1, 3] code and verifies the viability of experimental realisation of quantum error-correcting codes with superconducting qubits.
We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite different way from the usual circuit-based architecture where physical gates are recursively replaced by logical gates with error-correction gadgets. Instead, some relevant cluster states, say fundamental clusters, are recursively constructed through verification and postselection in advance for the higher-level one-way computation, which namely provides error-precorrection of gate operations. A suitable code such as the Steane seven-qubit code is adopted for transversal operations. This concatenated construction of verified fundamental clusters has a simple transversal structure of logical errors, and achieves a high noise threshold  3~3% 3 for computation by using appropriate verification procedures. Since the postselection is localized within each fundamental cluster with the help of deterministic bare controlled-ZZZ gates without verification, divergence of resources is restrained, which reconciles postselection with scalability.
Quantum computing relies on quantum error correction for high-fidelity logical operations, but scaling to achieve near-term quantum utility is highly resource-intensive. High-rate quantum LDPC codes can reduce error correction overhead, yet realizing high-rate fault-tolerant computation with these codes remains a central challenge. Apart of the lattice surgery approach, standard schemes for realizing logical gates have so far been restricted to performing global operations on all logical qubits at the same time. Another approach relies on low-rate code switching methods. In this work, we introduce a gate-based protocol for addressable single- and multi-qubit Clifford operations on individual logical qubits encoded within one or more quantum LDPC codes. Our scheme leverages logical transversal operations via an auxiliary Bacon-Shor code to perform logical operations with constant time overhead enabled by teleportation. We demonstrate the implementation of an overcomplete logical Clifford gate set and perform numerical simulations to evaluate the error-correction performance of our protocol. Finally, we observe that our scheme can be integrated with magic state cultivation protocols to achieve universal, gate-based, and fully addressable quantum computation.
Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit encoded in a five qubit system that allows correction of arbitrary single-qubit errors. We perform quantum process tomography of the encoded gate operations, demonstrate the successful correction of all possible single-qubit errors, and measure the fidelity of the encoded logical gate operations.