Windowed quantum arithmetic
arXiv:1905.07682
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.
11 pages, 7 figures
References in corpus (11)
- Surface codes: Towards practical large-scale quantum computation
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Quantum Networks for Elementary Arithmetic Operations
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Halving the cost of quantum addition
- Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
- Fast versions of Shor's quantum factoring algorithm
- Trading T gates for dirty qubits in state preparation and unitary synthesis
- Shor's algorithm with fewer (pure) qubits
- Factoring with n+2 clean qubits and n-1 dirty qubits
- Asymptotically Efficient Quantum Karatsuba Multiplication