Extending the Frontier of Quantum Computers with Qutrits
- Univ. of Chicago, IL (United States)
- Georgia Inst. of Technology, Atlanta, GA (United States)
- Duke Univ., Durham, NC (United States)
Here, 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 70× 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.
- Research Organization:
- Univ. of Chicago, IL (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Engineering & Technology; National Science Foundation (NSF)
- Grant/Contract Number:
- SC0020289; SC0020331; CCF-1730449/1832377; PHY-1818914
- OSTI ID:
- 1674937
- Alternate ID(s):
- OSTI ID: 1865687
- Journal Information:
- IEEE Micro, Vol. 40, Issue 3; ISSN 0272-1732
- Publisher:
- IEEECopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
NISQ+: Boosting quantum computing power by approximating quantum error correction