TY - GEN
T1 - Uncomputing Ancilla Qubits in Quantum Circuits
AU - Tiwari, Ashutosh
AU - Sundaram, Ranjani G.
AU - Gupta, Himanshu
AU - Ramakrishnan, C. R.
AU - Yu, Nengkun
N1 - Publisher Copyright: © 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Uncomputation of ancilla qubits is essential in quantum computing to reset auxiliary qubits to a zero state, ensuring their safe discarding and reducing resource overhead. Current methods for uncomputation either rely on manual procedures or use additional ancilla qubits to store intermediate computation results, which increases qubit storage requirements. Additionally, most in-place uncomputation techniques employ an all-or-nothing strategy, wherein they perform uncomputation only when all ancilla qubits in the given circuit can be uncomputed.In this work, we tackle the problem of uncomputing a maximum number of ancilla qubits in a quantum circuit with minimal qubit storage overhead. We propose a novel approach where partial uncomputation - reverting the last 'm' gates - enables the uncomputation of more qubits. We present three algorithms designed to uncompute the largest possible set of ancilla qubits and demonstrate their effectiveness through experiments on various randomly generated quantum circuits.
AB - Uncomputation of ancilla qubits is essential in quantum computing to reset auxiliary qubits to a zero state, ensuring their safe discarding and reducing resource overhead. Current methods for uncomputation either rely on manual procedures or use additional ancilla qubits to store intermediate computation results, which increases qubit storage requirements. Additionally, most in-place uncomputation techniques employ an all-or-nothing strategy, wherein they perform uncomputation only when all ancilla qubits in the given circuit can be uncomputed.In this work, we tackle the problem of uncomputing a maximum number of ancilla qubits in a quantum circuit with minimal qubit storage overhead. We propose a novel approach where partial uncomputation - reverting the last 'm' gates - enables the uncomputation of more qubits. We present three algorithms designed to uncompute the largest possible set of ancilla qubits and demonstrate their effectiveness through experiments on various randomly generated quantum circuits.
KW - automatic uncomputation
KW - circuit compilation
KW - partial uncomputation
KW - quantum circuits
KW - uncomputation
UR - https://www.scopus.com/pages/publications/105007871203
U2 - 10.1109/QCNC64685.2025.00065
DO - 10.1109/QCNC64685.2025.00065
M3 - Conference contribution
T3 - Proceedings - 2025 International Conference on Quantum Communications, Networking, and Computing, QCNC 2025
SP - 379
EP - 387
BT - Proceedings - 2025 International Conference on Quantum Communications, Networking, and Computing, QCNC 2025
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2nd International Conference on Quantum Communications, Networking, and Computing, QCNC 2025
Y2 - 31 March 2025 through 2 April 2025
ER -