Windowed quantum arithmetic
Craig Gidney

TL;DR
This paper introduces a windowing technique for quantum circuits that reduces gate counts by grouping control qubits, improving efficiency in quantum arithmetic operations like modular exponentiation.
Contribution
It presents a novel windowed quantum arithmetic method that optimizes circuit complexity, outperforming previous approaches in Toffoli gate counts for large register sizes.
Findings
Lower Toffoli counts in windowed modular exponentiation
Efficient control qubit iteration via small table lookups
Applicable to quantum registers from tens to thousands of qubits
Abstract
We demonstrate a technique for optimizing quantum circuits that is analogous to classical windowing. Specifically, we show that small table lookups can allow control qubits to be iterated in groups instead of individually. We present various windowed quantum arithmetic circuits, including a windowed modular exponentiation with nested windowed modular multiplications, which have lower Toffoli counts than previous work at register sizes ranging from tens of qubits to thousands of qubits.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
