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

Threshold Circuits and Quantum Gates

Leporati

Published Jan 8, 2003• 1 citation
OpenAlex

Related papers

Single electron threshold logic based Feynman gate implementation

Arpita Ghosh, Amit Jain, Nameirakpam Basanta Singh +1 more

The paper presents design and simulation of, one of the quantum reversible gates, the Feynman gate, using the single electron threshold logic gate. One of the most emerging areas in quantum computing is the application of reversible gates in computational circuits for increasing the computational efficiency. Here the presented approach combines the advantages of the single electron threshold logic as well as the properties of the reversible gate. The stability of the circuit is also discussed.

International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN)•Sep 1, 2016•3 citations

Quantum Gates and Circuits

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•3 citations

Quantum gates and quantum circuits

Anirban Pathak

CRC Press eBooks•Jun 20, 2013•0 citations

Quantum Threshold Is Powerful

Daniel Grier, Jackson Morris

In 2005, Høyer and Špalek showed that constant-depth quantum circuits augmented with multi-qubit Fanout gates are quite powerful, able to compute a wide variety of Boolean functions as well as the quantum Fourier transform. They also asked what other multi-qubit gates could rival Fanout in terms of computational power, and suggested that the quantum Threshold gate might be one such candidate. Threshold is the gate that indicates if the Hamming weight of a classical basis state input is greater than some target value. We prove that Threshold is indeed powerful - there are polynomial-size constant-depth quantum circuits with Threshold gates that compute Fanout to high fidelity. Our proof is a generalization of a proof by Rosenthal that exponential-size constant-depth circuits with generalized Toffoli gates can compute Fanout. Our construction reveals that other quantum gates able to "weakly approximate" Parity can also be used as substitutes for Fanout.

arXiv:2411.04953•Leibniz international proceedings in informatics•Nov 7, 2024•9 citations

Fault-tolerant threshold of quantum circuit under correlated noise

Zhan-Yun Wang

Abstract We investigate the impact of the correlation between error gates on the fault-tolerant threshold in quantum circuits under three typical noise models. In the fault-tolerant encoding schemes for two fundamental quantum logical operations, we extend the conventional error injection method by simultaneously applying error gates to both control and target qubits after two-qubit gate operations, with a quantitative characterization of the correlation strength between these error gates. The results show that the fault-tolerant error threshold can be noticeably enhanced by the presence of correlations between error gates, resulting in more robust quantum circuit implementations. We further apply fault-tolerant encoding to the single-qubit teleportation circuit and investigate the effect of correlated noise on its error threshold. The results show that the threshold varies non-monotonically with the correlation strength and that the system’s fault-tolerance differs significantly across noise models.

Communications in Theoretical Physics•Feb 27, 2026•0 citations

Quantum Circuits

Colin P. Williams

Texts in computer science•Dec 6, 2010•1 citation
In 2005, Høyer and Špalek showed that constant-depth quantum circuits augmented with multi-qubit Fanout gates are quite powerful, able to compute a wide variety of Boolean functions as well as the quantum Fourier transform. They also asked what other multi-qubit gates could rival Fanout in terms of computational power, and suggested that the quantum Threshold gate might be one such candidate. Threshold is the gate that indicates if the Hamming weight of a classical basis state input is greater than some target value. We prove that Threshold is indeed powerful - there are polynomial-size constant-depth quantum circuits with Threshold gates that compute Fanout to high fidelity. Our proof is a generalization of a proof by Rosenthal that exponential-size constant-depth circuits with generalized Toffoli gates can compute Fanout. Our construction reveals that other quantum gates able to "weakly approximate" Parity can also be used as substitutes for Fanout.
Abstract We investigate the impact of the correlation between error gates on the fault-tolerant threshold in quantum circuits under three typical noise models. In the fault-tolerant encoding schemes for two fundamental quantum logical operations, we extend the conventional error injection method by simultaneously applying error gates to both control and target qubits after two-qubit gate operations, with a quantitative characterization of the correlation strength between these error gates. The results show that the fault-tolerant error threshold can be noticeably enhanced by the presence of correlations between error gates, resulting in more robust quantum circuit implementations. We further apply fault-tolerant encoding to the single-qubit teleportation circuit and investigate the effect of correlated noise on its error threshold. The results show that the threshold varies non-monotonically with the correlation strength and that the system’s fault-tolerance differs significantly across noise models.