An algorithm for minimization of quantum cost
arXiv:0910.2129
Abstract
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.
09 pages
References in corpus (8)
- Synthesis of Quantum Logic Circuits
- Quantum Circuit Simplification and Level Compaction
- Implementation of Grover's Quantum Search Algorithm in a Scalable System
- Security of two quantum cryptography protocols using the same four qubit states
- Improved Quantum Cost for n-bit Toffoli Gates
- An analysis of reversible multiplier circuits
- Synthesis and Optimization of Reversible Circuits for Homogeneous Boolean Functions
- Non-destructive Orthonormal State Discrimination