Towards optimization of quantum circuits
arXiv:quant-ph/0607123 · doi:10.2478/s11534-008-0039-8
Abstract
Any unitary operation in quantum information processing can be implemented via a sequence of simpler steps - quantum gates. However, actual implementation of a quantum gate is always imperfect and takes a finite time. Therefore, seeking for a short sequence of gates - efficient quantum circuit for a given operation, is an important task. We contribute to this issue by proposing optimization of the well-known universal procedure proposed by Barenco et.al [1]. We also created a computer program which realizes both Barenco's decomposition and the proposed optimization. Furthermore, our optimization can be applied to any quantum circuit containing generalized Toffoli gates, including basic quantum gate circuits.
10 pages, 11 figures, minor changes+typos
References in corpus (9)
- Elementary gates for quantum computation
- Synthesis of Quantum Logic Circuits
- Optimal Quantum Circuits for General Two-Qubit Gates
- Quantum Circuits for General Multiqubit Gates
- Minimal Universal Two-qubit Quantum Circuits
- A universal quantum circuit for two-qubit transformations with three CNOT gates
- Quantum Circuit Simplification and Level Compaction
- Quantum circuits with uniformly controlled one-qubit gates
- Recognizing Small-Circuit Structure in Two-Qubit Operators and Timing Hamiltonians to Compute Controlled-Not Gates