Efficient Quantum Circuit Decompositions via Intermediate Qudits

Journal Article · Sun Nov 01 04:00:00 EST 2020 · Proceedings of the International Symposium on Multiple-Valued Logic (ISMVL) (Online)

DOI:https://doi.org/10.1109/ismvl49045.2020.9345604· OSTI ID:1865588

Baker, Jonathan M. ^[1]; Duckering, Casey ^[2]; Chong, Frederic T. ^[2]

---

1. Univ. of Chicago, IL (United States); The University of Chicago
2. Univ. of Chicago, IL (United States)

Many quantum algorithms make use of ancilla, additional qubits used to store temporary information during computation, to reduce the total execution time. Quantum computers will be resource-constrained for years to come so reducing ancilla requirements is crucial. In this work, we give a method to generate ancilia out of idle qubits by placing some in higher-value states, called qudits. Here, we show how to take a circuit with many O(n) ancilla and design an ancilla-free circuit with the same asymptotic depth. Using this, we give a circuit construction for an in-place adder and a constant adder both with O(log n) depth using temporary qudits and no ancilla.

• Research Organization: Univ. of Chicago, IL (United States)
• Sponsoring Organization: USDOE Office of Science (SC), Engineering & Technology; National Science Foundation
• Grant/Contract Number: SC0020289; SC0020331
• OSTI ID: 1865588
• Journal Information: Proceedings of the International Symposium on Multiple-Valued Logic (ISMVL) (Online), Journal Name: Proceedings of the International Symposium on Multiple-Valued Logic (ISMVL) (Online) Vol. 2020; ISSN 2378-2226
• Publisher: IEEE
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
adder circuit
multi-valued logic
quantum computing
qudit
qutrit