Quantum computation and quantum information
Quantum computation and quantum information
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Reversible circuit synthesis using a cycle-based approach
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Synthesis of quantum circuits for linear nearest neighbor architectures
Quantum Information Processing
On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
An efficient conversion of quantum circuits to a linear nearest neighbor architecture
Quantum Information & Computation
Block-based quantum-logic synthesis
Quantum Information & Computation
The quantum fourier transform on a linear nearest neighbor architecture
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
Threshold error penalty for fault-tolerant quantum computation with nearest neighbor communication
IEEE Transactions on Nanotechnology
Constant-optimized quantum circuits for modular multiplication and exponentiation
Quantum Information & Computation
A Θ( √ n)-depth quantum adder on the 2D NTC quantum computer architecture
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Synthesis of quantum-logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Depth-optimized reversible circuit synthesis
Quantum Information Processing
Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures
Proceedings of the 50th Annual Design Automation Conference
| Hi-index | 0.00 |
Quantum arithmetic circuits have practical applications in various quantum algorithms. In this paper, we address quantum addition on 2-dimensional nearest-neighbor architectures based on the work presented by Choi and Van Meter (JETC 2012). To this end, we propose new circuit structures for some basic blocks in the adder, and reduce communication overhead by adding concurrency to consecutive blocks and also by parallel execution of expensive Toffoli gates. The proposed optimizations reduce total depth from $140\sqrt n+k_1$ to $92\sqrt n+k_2$ for constants k1,k2 and affect the computation fidelity considerably.