Asymptotic Improvements to Quantum Circuits via Qutrits

Abstract

Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the ${\log }_2(3)$ binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic depth (runtime) decomposition of the Generalized Toffoli gate using no ancilla--a significant improvement over linear depth for the best qubit-only equivalent. Our circuit construction also features a 70x improvement in two-qudit gate count over the qubit-only equivalent decomposition. This results in circuit cost reductions for important algorithms like quantum neurons and Grover search. We develop an open-source circuit simulator for qutrits, along with realistic near-term noise models which account for the cost of operating qutrits. Simulation results for these noise models indicate over 90% mean reliability (fidelity) for our circuit construction, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path towards scaling quantum computation.

In ISCA '19: 46th International Symposium on Computer Architecture, 13 pages, 11 figures

References in corpus (8)

• QuTiP 2: A Python framework for the dynamics of open quantum systems
• Experimental Comparison of Two Quantum Computing Architectures
• Efficient Toffoli Gates Using Qudits
• Efficient preparation and detection of microwave dressed-state qubits and qutrits with trapped ions
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Time-efficient implementation of quantum search with qudits
• Factoring with n+2 clean qubits and n-1 dirty qubits
• Characterization of qutrit channels in terms of their covariance and symmetry properties