Quantum computation and quantum information
Quantum computation and quantum information
Parallel Quantum Computation and Quantum Codes
SIAM Journal on Computing
An improved quantum Fourier transform algorithm and applications
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fast parallel circuits for the quantum Fourier transform
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Circuit for Shor's algorithm using 2n+3 qubits
Quantum Information & Computation
A quantum circuit for shor's factoring algorithm using 2n + 2 qubits
Quantum Information & Computation
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Quantum Information & Computation
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
Changing the gate order for optimal LNN conversion
RC'11 Proceedings of the Third international conference on Reversible Computation
A Θ( √ n)-depth quantum adder on the 2D NTC quantum computer architecture
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Using non-ideal gates to implement universal quantum computing between uncoupled qubits
Quantum Information Processing
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
Efficient quantum computing between remote qubits in linear nearest neighbor architectures
Quantum Information Processing
Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures
Proceedings of the 50th Annual Design Automation Conference
Constant-Factor optimization of quantum adders on 2d quantum architectures
RC'13 Proceedings of the 5th international conference on Reversible Computation
Line ordering of reversible circuits for linear nearest neighbor realization
Quantum Information Processing
| Hi-index | 0.00 |
We show how to construct an efficient quantum circuit for computing a good approximation of the quantum Fourier transform on a linear nearest neighbor architecture. The constructed circuit uses no ancillary qubits and its depth and size are O(n) and O(n log n), respectively, where n is the length of the input. The circuit is useful for decreasing the size of Fowler et al.'s quantum circuit for Shor's factoring algorithm on a linear nearest neighbor architecture.