Efficient Quantum Circuit Decompositions via Intermediate Qudits

2020/02/24 by Baker, Jonathan M., Duckering, Casey, Chong, Frederic T. · 2 citations
#Emerging Technologies (cs.ET) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.2002.10592

Abstract

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 ancilla out of idle qubits by placing some in higher-value states, called qudits. 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.

Cited by

• Sdim: A Qudit Stabilizer Simulator
• Encoder Circuit Optimization for Non-Binary Quantum Error Correction Codes in Prime Dimensions: An Algorithmic Framework

Related

• Optimal Synthesis of Multi-Controlled Qudit Gates
• Efficient quantum circuit synthesis for SAT-oracle with limited ancillary qubit
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• Ancilla-free Quantum Adder with Sublinear Depth
• Reducing the number of ancilla qubits and the gate count required for\n creating large controlled operations