A Classical-Quantum Adder with Constant Workspace and Linear Gates
Craig Gidney

TL;DR
This paper introduces new classical-quantum adders that operate with constant workspace and linear gate complexity, advancing the efficiency of quantum arithmetic circuits for modular operations.
Contribution
It constructs classical-quantum adders with minimal ancillae and linear Toffoli gate complexity, addressing open questions about asymptotic efficiency.
Findings
Adders with 3 clean ancillae and $4n \\pm O(1)$ Toffoli gates for classical offset addition.
Adders with $3n \\pm O(1)$ Toffoli gates using 2 clean and some dirty ancillae.
Conditioned adders require no extra workspace or Toffoli gates.
Abstract
In 2004, Cuccaro et al found a quantum-quantum adder with gate cost and ancilla qubits. Since then, it's been an open question whether classical-quantum adders can achieve the same asymptotic complexity. These costs are particularly relevant to modular arithmetic circuits, which often offset by the classically known modulus. In this paper, I construct an adder that uses 3 clean ancillae and Toffoli gates to add a classical offset into a quantum register. I also present an adder with a Toffoli cost of that uses 2 clean ancillae and dirty ancillae. I further show that applying the presented adders conditioned on a control qubit requires no additional workspace or Toffolis.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
