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

Quantum Information Processing

Improving ancilla states for quantum computation

Yaakov S. Weinstein, Daniel Chai, Newton Xie

Published Jan 9, 2016• 4 citations
Publisher
DOI
10.1007/s11128-015-1225-4

Related papers

Ancilla-driven quantum computation with twisted graph states

Janet Anders, Erika Andersson, Dan E. Browne +2 more

Theoretical Computer Science•Feb 14, 2012•12 citations

Parallelization of quantum circuits with ancillae

Hideaki Abe, Shao Chin Sung

IEICE Transactions on Information and Systems•Feb 1, 2003•0 citations

Extending the Frontier of Quantum Computers With Qutrits

Pranav Gokhale, Jonathan M. Baker, Casey Duckering +3 more

We advocate for a fundamentally different way to perform quantum computation by using three-level qutrits instead of qubits. In particular, we substantially reduce the resource requirements of quantum computations by exploiting a third state for temporary variables (ancilla) in quantum circuits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log2(3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic runtime decomposition of the Generalized Toffoli gate using no ancilla---an exponential improvement over the best qubit-only equivalent. Our approach features a 70x improvement in total two-qudit gate count over the qubit-only decomposition. This results in improvements for important algorithms for arithmetic and QRAM. Simulation results under realistic noise models indicate over 90% mean reliability (fidelity) for our circuit, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path toward extending the frontier of quantum computers.

IEEE Micro•Apr 16, 2020•34 citations

Improved ancilla preparation scheme increases fault-tolerant threshold

Ben W. Reichardt

We demonstrate an improved concatenated encoded ancilla preparation procedure. Simulations show that this procedure significantly increases the error threshold beneath which arbitrarily long quantum computations are possible.

arXiv:quant-ph/0406025•Jun 4, 2004•58 citations

Improved Quantum Circuits with Qudits and Dirty Ancillae

Pranav Gokhale, Jonathan M. Baker, Frederic T. Chong

IEEE/ACM International Symposium on Microarchitecture (MICRO)•Oct 20, 2018•0 citations

Enhanced Quantum State Detection Efficiency through Quantum Information Processing

Tobias Schaetz, M. D. Barrett, D. Leibfried +7 more

We investigate theoretically and experimentally how quantum state-detection efficiency is improved by the use of quantum information processing (QIP). Experimentally, we encode the state of one 9Be(+) ion qubit with one additional ancilla qubit. By measuring both qubits, we reduce the state-detection error in the presence of noise. The deviation from the theoretically allowed reduction is due to infidelities of the QIP operations. Applying this general scheme to more ancilla qubits suggests that error in the individual qubit measurements need not be a limit to scalable quantum computation.

Physical Review Letters•Jan 7, 2005•34 citations
We advocate for a fundamentally different way to perform quantum computation by using three-level qutrits instead of qubits. In particular, we substantially reduce the resource requirements of quantum computations by exploiting a third state for temporary variables (ancilla) in quantum circuits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log2(3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic runtime decomposition of the Generalized Toffoli gate using no ancilla---an exponential improvement over the best qubit-only equivalent. Our approach features a 70x improvement in total two-qudit gate count over the qubit-only decomposition. This results in improvements for important algorithms for arithmetic and QRAM. Simulation results under realistic noise models indicate over 90% mean reliability (fidelity) for our circuit, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path toward extending the frontier of quantum computers.
We investigate theoretically and experimentally how quantum state-detection efficiency is improved by the use of quantum information processing (QIP). Experimentally, we encode the state of one 9Be(+) ion qubit with one additional ancilla qubit. By measuring both qubits, we reduce the state-detection error in the presence of noise. The deviation from the theoretically allowed reduction is due to infidelities of the QIP operations. Applying this general scheme to more ancilla qubits suggests that error in the individual qubit measurements need not be a limit to scalable quantum computation.