A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Ultimate zero and one: computing at the quantum frontier
Ultimate zero and one: computing at the quantum frontier
Quantum computation and quantum information
Quantum computation and quantum information
Feynman Lectures on Computation
Feynman Lectures on Computation
IEEE Computer Graphics and Applications
The effect of communication costs in solid-state quantum computing architectures
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Architectural implications of quantum computing technologies
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Quantum Computing for Computer Architects (Synthesis Lectures on Computer Architecture)
Quantum Computing for Computer Architects (Synthesis Lectures on Computer Architecture)
ICQNM '09 Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies
Recent progress in quantum algorithms
Communications of the ACM
Fault-Tolerant Quantum Computation with Constant Error Rate
SIAM Journal on Computing
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)
A linear-size quantum circuit for addition with no ancillary qubits
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
A logarithmic-depth quantum carry-lookahead adder
Quantum Information & Computation
Threshold error penalty for fault-tolerant quantum computation with nearest neighbor communication
IEEE Transactions on Nanotechnology
Synthesis of quantum-logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Constant-Factor optimization of quantum adders on 2d quantum architectures
RC'13 Proceedings of the 5th international conference on Reversible Computation
Quantum circuit physical design methodology with emphasis on physical synthesis
Quantum Information Processing
| Hi-index | 0.00 |
In this work, we propose an adder for the 2-Dimensional Nearest-Neighbor, Two-Qubit gate, Concurrent (2D NTC) architecture, designed to match the architectural constraints of many quantum computing technologies. The chosen architecture allows the layout of logical qubits in two dimensions with &sqrt;n columns where each column has &sqrt;n qubits and the concurrent execution of one- and two-qubit gates with nearest-neighbor interaction only. The proposed adder works in three phases. In the first phase, the first column generates the summation output and the other columns do the carry-lookahead operations. In the second phase, these intermediate values are propagated from column to column, preparing for computation of the final carry for each register position. In the last phase, each column, except the first one, generates the summation output using this column-level carry. The depth and the number of qubits of the proposed adder are Θ(&sqrt;n) and O(n), respectively. The proposed adder executes faster than the adders designed for the 1D NTC architecture when the length of the input registers n is larger than 51.