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
Quantum computation and quantum information
Quantum computation and quantum information
Reducing Quantum Computations to Elementary Unitary Operations
Computing in Science and Engineering
Smaller Two-Qubit Circuits for Quantum Communication and Computation
Proceedings of the conference on Design, automation and test in Europe - Volume 2
IEEE Security and Privacy
Synthesis of quantum logic circuits
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Communications of the ACM - Web science
Optimal realizations of controlled unitary gates
Quantum Information & Computation
Asymptotically optimal circuits for arbitrary n-qubit diagonal comutations
Quantum Information & Computation
Transformation of quantum states using uniformly controlled rotations
Quantum Information & Computation
A new algorithm for producing quantum circuits using KAK decompositions
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
Synthesis of quantum-logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Synthesis and optimization of reversible circuits—a survey
ACM Computing Surveys (CSUR)
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
Reversible logic synthesis by quantum rotation gates
Quantum Information & Computation
RMDDS: Reed-muller decision diagram synthesis of reversible logic circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
| Hi-index | 0.00 |
In this paper, the problem of constructing an efficient quantum circuit for the imple-mentation of an arbitrary quantum computation is addressed. To this end, a basic blockbased on the cosine-sine decomposition method is suggested which contains l qubits.In addition, a previously proposed quantum-logic synthesis method based on quantumShannon decomposition is recursively applied to reach unitary gates over l qubits. Then,the basic block is used and some optimizations are applied to remove redundant gates.It is shown that the exact value of l affects the number of one-qubit and CNOT gates inthe proposed method. In comparison to the previous synthesis methods, the value of l isexamined consequently to improve either the number of CNOT gates or the total numberof gates. The proposed approach is further analyzed by considering the nearest neighborlimitation. According to our evaluation, the number of CNOT gates is increased by atmost a factor of 5/3 if the nearest neighbor interaction is applied.