Quantum computation and quantum information
Quantum computation and quantum information
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
The quantum fourier transform on a linear nearest neighbor architecture
Quantum Information & Computation
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Quantum Information & Computation
Changing the gate order for optimal LNN conversion
RC'11 Proceedings of the Third international conference on Reversible Computation
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
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
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 |
Several promising implementations of quantum computation rely on a Linear NearestNeighbor (LNN) architecture, which arranges quantum bits on a line, and allows neighborinteractions only. Therefore, several specific circuits have been designed on an LNNarchitecture. However, a general and efficient conversion method for an arbitrary circuithas not been established. Therefore, this paper gives an efficient conversion technique toconvert quantum circuits to an LNN architecture. When a quantum circuit is convertedto an LNN architecture, the objective is to reduce the size of the additional circuit addedby the conversion and the time complexity of the conversion. The proposed methodrequires less additional circuitry and time complexity compared with naive techniques.To develop the method, we introduce two key theorems that may be interesting on theirown. In addition, the proposed method also achieves less overhead than some knowncircuits designed from scratch on an LNN architecture.