Asymptotic Improvements to Quantum Circuits via Qutrits

Understand

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.