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

APS

Fault-tolerant gates on a logical qubit

Serge Rosenblum, Philip Reinhold, Wen-Long Ma, Liang Jiang, Luigi Frunzio, Robert J. Schoelkopf

Published Jan 1, 2019• 0 citations
OpenAlex

Related papers

Non-fault-tolerant T gates for the [7,1,3] quantum error-correction code

Yaakov S. Weinstein

We simulate the implementation of a $T$ gate, or $\frac{\ensuremath{\pi}}{8}$ gate, for a [7,1,3] encoded logical qubit in a nonequiprobable error environment. We demonstrate that the use of certain non-fault-tolerant methods in the implementation may nevertheless enable reliable quantum computation while reducing basic resource consumption. Reliability is determined by calculating gate fidelities for the one-qubit logical gate. Specifically, we show that despite using a non-fault-tolerant procedure in constructing a logical zero ancilla to implement the $T$ gate, the gate fidelity of the logical gate, after perfect error correction, has no first order error terms. Meaning, any errors that may have occurred during implementation are ``correctable'' and fault tolerance may still be achieved.

arXiv:1303.4291•Physical Review A•Mar 18, 2013•14 citations

Fault-tolerant encoding of a logical qubit

Norbert M. Linke

Bulletin of the American Physical Society•Jun 8, 2017•0 citations

Fault-tolerant control of an error-corrected qubit

Laird Egan, Dripto M. Debroy, Crystal Noel +8 more

arXiv:2009.11482•Nature•Oct 4, 2021•472 citations

Fault-tolerant logical gate networks for Calderbank-Shor-Steane codes

Andrew M. Steane, Ben Ibinson

Fault-tolerant logical operations for qubits encoded by Calderbank-Shor-Steane codes are discussed, with emphasis on methods that apply to codes of high rate, encoding $k$ qubits per block with $k>1$. It is shown that the logical qubits within a given block can be prepared by a single recovery operation in any state whose stabilizer generator separates into $X$ and $Z$ parts. Optimized methods to move logical qubits around and to achieve controlled-NOT and Toffoli gates are discussed. It is found that the number of time steps required to complete a fault-tolerant quantum computation is the same when $k>1$ as when $k=1$.

arXiv:quant-ph/0311014•Physical Review A•Nov 30, 2005•55 citations

Optical demonstration of quantum fault-tolerant threshold

Kai Sun, Ze-Yan Hao, Yan Wang +6 more

A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable to the output of a higher probability of correct logical qubits under the presence of errors. However, strict requirements to encode qubits and operators render the implementation of a full fault-tolerant computation challenging even for the achievable noisy intermediate-scale quantum technology. Especially the threshold for fault-tolerant computation still lacks experimental verification. Here, based on an all-optical setup, we experimentally demonstrate the existence of the threshold for the fault-tolerant protocol. Four physical qubits are represented as the spatial modes of two entangled photons, which are used to encode two logical qubits. The experimental results clearly show that when the error rate is below the threshold, the probability of correct output in the circuit, formed with fault-tolerant gates, is higher than that in the corresponding non-encoded circuit. In contrast, when the error rate is above the threshold, no advantage is observed in the fault-tolerant implementation. The developed high-accuracy optical system may provide a reliable platform to investigate error propagation in more complex circuits with fault-tolerant gates.

arXiv:2012.08927•Light Science & Applications•Jul 5, 2022•10 citations

Error-corrected gates on an encoded qubit

Philip Reinhold, Serge Rosenblum, Wen-Long Ma +3 more

arXiv:1907.12327•Nature Physics•Jun 8, 2020•103 citations
We simulate the implementation of a TTT gate, or $\frac{\ensuremath{\pi}}{8}$ gate, for a [7,1,3] encoded logical qubit in a nonequiprobable error environment. We demonstrate that the use of certain non-fault-tolerant methods in the implementation may nevertheless enable reliable quantum computation while reducing basic resource consumption. Reliability is determined by calculating gate fidelities for the one-qubit logical gate. Specifically, we show that despite using a non-fault-tolerant procedure in constructing a logical zero ancilla to implement the TTT gate, the gate fidelity of the logical gate, after perfect error correction, has no first order error terms. Meaning, any errors that may have occurred during implementation are ``correctable'' and fault tolerance may still be achieved.
Fault-tolerant logical operations for qubits encoded by Calderbank-Shor-Steane codes are discussed, with emphasis on methods that apply to codes of high rate, encoding kkk qubits per block with k>1k>1k>1. It is shown that the logical qubits within a given block can be prepared by a single recovery operation in any state whose stabilizer generator separates into XXX and ZZZ parts. Optimized methods to move logical qubits around and to achieve controlled-NOT and Toffoli gates are discussed. It is found that the number of time steps required to complete a fault-tolerant quantum computation is the same when k>1k>1k>1 as when k=1k=1k=1.
A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable to the output of a higher probability of correct logical qubits under the presence of errors. However, strict requirements to encode qubits and operators render the implementation of a full fault-tolerant computation challenging even for the achievable noisy intermediate-scale quantum technology. Especially the threshold for fault-tolerant computation still lacks experimental verification. Here, based on an all-optical setup, we experimentally demonstrate the existence of the threshold for the fault-tolerant protocol. Four physical qubits are represented as the spatial modes of two entangled photons, which are used to encode two logical qubits. The experimental results clearly show that when the error rate is below the threshold, the probability of correct output in the circuit, formed with fault-tolerant gates, is higher than that in the corresponding non-encoded circuit. In contrast, when the error rate is above the threshold, no advantage is observed in the fault-tolerant implementation. The developed high-accuracy optical system may provide a reliable platform to investigate error propagation in more complex circuits with fault-tolerant gates.