Inspired by Lanyon (B. P. Lanyon et al. 2008 Nature Physics. 5 134) successfully simplifying the three-qubit Toffoli gate, we present a novel scheme that optimizes universal quantum logic circuits using assisted higher-dimensional Hilbert space. We construct a more efficient two-qubit circuit and a more effective three-qubit universal quantum circuit by using assisted dimension, Cosine-Sine Decomposition (CSD) and Quantum Shannon Decomposition (QSD). Meanwhile, we present the formula for the complexity of arbitrary n-qubit universal quantum gate. We propose the physical implementation of this scheme by linear optical circuits and cavity-QED. The results show that the two-qubit and three-qubit universal quantum circuits are respectively close and superior to the current optimal scheme in complexity. And with the increase of the number of qubits, the advantage of our scheme will become increasingly prominent.
Inspired by Lanyon (B. P. Lanyon et al. 2008 Nature Physics. 5 134) successfully simplifying the three-qubit Toffoli gate, we present a novel scheme that optimizes universal quantum logic circuits using assisted higher-dimensional Hilbert space. We construct a more efficient two-qubit circuit and a more effective three-qubit universal quantum circuit by using assisted dimension, Cosine-Sine Decomposition (CSD) and Quantum Shannon Decomposition (QSD). Meanwhile, we present the formula for the complexity of arbitrary n-qubit universal quantum gate. We propose the physical implementation of this scheme by linear optical circuits and cavity-QED. The results show that the two-qubit and three-qubit universal quantum circuits are respectively close and superior to the current optimal scheme in complexity. And with the increase of the number of qubits, the advantage of our scheme will become increasingly prominent.
We propose a scheme to construct the efficient universal quantum circuit for qubit systems with the assistance of possibly available auxiliary Hilbert spaces. An elementary two-ququart gate, termed the controlled-double-not gate, is proposed first in ququart (four-level) systems, and its physical implementation is illustrated in the four-dimensional Hilbert spaces built by the path and polarization states of photons. Then an efficient universal quantum circuit for ququart systems is constructed using the gate and the quantum Shannon decomposition method. By introducing auxiliary two-dimensional Hilbert spaces, the universal quantum circuit for qubit systems is finally achieved using the result obtained in ququart systems with the lowest complexity.
In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains l qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon 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 in the proposed method. In comparison to the previous synthesis methods, the value of l is examined consequently to improve either the number of CNOT gates or the total number of gates. The proposed approach is further analyzed by considering the nearest neighbor limitation. According to our evaluation, the number of CNOT gates is increased by at most a factor of 35 if the nearest neighbor interaction is applied.
In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains l qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon 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 in the proposed method. In comparison to the previous synthesis methods, the value of l is examined consequently to improve either the number of CNOT gates or the total number of gates. The proposed approach is further analyzed by considering the nearest neighbor limitation. According to our evaluation, the number of CNOT gates is increased by at most a factor of 35 if the nearest neighbor interaction is applied.
Every quantum algorithm is represented by set of quantum circuits. Any optimization scheme for a quantum algorithm and quantum computation is very important especially in the arena of quantum computation with limited number of qubit resources. Major obstacle to this goal is the large number of elemental quantum gates to build even small quantum circuits. Here, we propose and demonstrate a general technique that significantly reduces the number of elemental gates to build quantum circuits. This is impactful for the design of quantum circuits, and we show below this could reduce the number of gates by 60% and 46% for the four- and five-qubit Toffoli gates, two key quantum circuits, respectively, as compared with simplest known decomposition. Reduced circuit complexity often goes hand-in-hand with higher efficiency and bandwidth. The quantum circuit optimization technique proposed in this work would provide a significant step forward in the optimization of quantum circuits and quantum algorithms, and has the potential for wider application in quantum computation.
This paper proposes a new optimized quantum block-ZXZ decomposition method [7,8,10] that results in more optimal quantum circuits than the quantum Shannon decomposition (QSD)[27], which was introduced in 2006 by Shende et al. The decomposition is applied recursively to generic quantum gates, and can take advantage of existing and future small-circuit optimizations. Because our method uses only one-qubit gates and uniformly controlled rotation-Z gates, it can easily be adapted to use other types of multi-qubit gates. With the proposed decomposition, a general 3-qubit gate can be decomposed using 19 CNOT gates (rather than 20). For general n-qubit gates, the proposed decomposition generates circuits that have 48224n−232n+35 CNOT gates, which is less that the best known exact decomposition algorithm by (4n−2−1)/3 CNOT gates.
Although much work has been devoted to multivalued quantum logic synthesis, the question of whether multivalued quantum circuits are more efficient than conventional binary quantum circuits is still open. This article is devoted to the optimization of generic multivalued quantum circuits. Multivalued quantum Shannon decompositions are improved so that the circuits obtained are asymptotically optimal for all dimensionality d. The syntheses of uniformly multifold controlled Ry rotations are also optimized to make the circuits further simplified. Moreover, the theoretical lower bound of complexity for multivalued quantum circuits is investigated, and a quantity known as the efficiency index is proposed to evaluate the efficiency of the synthesis of various quantum circuits. The algorithm for qudit circuits given here is an efficient synthesis routine which produces improved results for all dimensionality d, whether the number of qudits n is small or large. The two facts, the leading factor of the lower bound of complexity for qudit circuits is small by a factor of $d\ensuremath{-}1$ in comparison to that for qubit circuits and the asymptotic efficiency index is increased with an increase of dimensionality d, reveal the potential advantage of qudit circuits over generic qubit circuits. Generic n-qudit circuits with $d\ensuremath{\ge}5$ and generic two-ququart circuits synthesized by the algorithm given here are practical circuits which are more efficient than the most efficient qubit circuits.