Quantum computation and quantum information
Quantum computation and quantum information
Simulating Quantum Computation by Contracting Tensor Networks
SIAM Journal on Computing
BDD-based synthesis of reversible logic for large functions
Proceedings of the 46th Annual Design Automation Conference
Quantum Circuit Simulation
Rule-based optimization of reversible circuits
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Modern Computer Arithmetic
Quantum addition circuits and unbounded fan-out
Quantum Information & Computation
On the CNOT-cost of TOFFOLI gates
Quantum Information & Computation
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Quantum Information & Computation
Reversible Circuit Optimization Via Leaving the Boolean Domain
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
Depth-optimized reversible circuit synthesis
Quantum Information Processing
Reversible logic synthesis of k-input, m-output lookup tables
Proceedings of the Conference on Design, Automation and Test in Europe
Constant-Factor optimization of quantum adders on 2d quantum architectures
RC'13 Proceedings of the 5th international conference on Reversible Computation
Reversible logic synthesis by quantum rotation gates
Quantum Information & Computation
| Hi-index | 0.00 |
Reversible circuits for modular multiplication Cx%M with x M arise as components of modular exponentiation in Shor's quantum number-factoring algorithm. However, existing generic constructions focus on asymptotic gate count and circuit depth rather than actual values, producing fairly large circuits not optimized for specific C and M values. In this work, we develop such optimizations in a bottom-up fashion, starting with most convenient C values. When zero-initialized ancilla registers are available, we reduce the search for compact circuits to a shortest-path problem. Some of our modular-multiplication circuits are asymptotically smaller than previous constructions, but worst-case bounds and average sizes remain Θ(n2). In the context of modular exponentiation, we offer several constant-factor improvements, as well as an improvement by a constant additive term that is significant for few-qubit circuits arising in ongoing laboratory experiments with Shor's algorithm.