Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Acta Physica Sinica

Optimizing quantum circuits using higher-dimensional Hilbert spaces

Liu Kai, Wendong Li, Wen-Zhao Zhang, Shi Peng, Chun-Nian Ren, Gu Yong-Jian

Published Jan 1, 2012• 5 citations
Publisher

Abstract

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.

DOI
10.7498/aps.61.120301

Related papers

Efficient universal quantum computation with auxiliary Hilbert space

Wendong Li, Yongjian Gu, Kai Liu +2 more

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.

Physical Review A•Sep 23, 2013•17 citations

Block-based quantum-logic synthesis

Mehdi Saeedi, Mona Arabzadeh, Morteza Saheb Zamani +1 more

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 $\frac{5}{3}$ if the nearest neighbor interaction is applied.

arXiv:1011.2159•Quantum Information and Computation•Mar 1, 2011•53 citations

Optimal synthesis of multivalued quantum circuits

Yao-Min Di, Hai‐Rui Wei

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 ${R}_{y}$ 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.

arXiv:1506.04394•Physical Review A•Dec 9, 2015•25 citations

Quantum circuit optimization using quantum Karnaugh map

J.-H. Bae, Paul M. Alsing, Doyeol Ahn +1 more

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.

Scientific Reports•Sep 24, 2020•38 citations

Block-based quantum-logic synthesis

Mehdi Saeedi, Mona Arabzadeh, Morteza Saheb Zamani +1 more

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.

•Mar 1, 2011•21 citations

Implementation of CNOT and Toffoli gates with higher-dimensional spaces

Wen‐Qiang Liu, Hai‐Rui Wei, L. C. Kwek

Minimizing the number of necessary two-qubit gates is an important task in quantum information processing. By introducing non-computational quantum states in auxiliary spaces, we construct effective circuits for the controlled-NOT (CNOT) gate and the n-control-qubit Toffoli gate with (2n-1) qubit-qudit gates and (2n-2) single-qudit gates. We propose the polarization CNOT and Toffoli gates based on the designed quantum circuits in linear optics by operating on the spatial-mode degree of freedom of photons. Our optical schemes can be achieved with a higher success probability and no extra auxiliary photons are needed.

•Jul 20, 2021•1 citation
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 lll qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon decomposition is recursively applied to reach unitary gates over lll qubits. Then, the basic block is used and some optimizations are applied to remove redundant gates. It is shown that the exact value of lll affects the number of one-qubit and CNOT gates in the proposed method. In comparison to the previous synthesis methods, the value of lll 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 53\frac{5}{3}35​ if the nearest neighbor interaction is applied.
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 ddd. The syntheses of uniformly multifold controlled Ry{R}_{y}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 ddd, whether the number of qudits nnn 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 ddd, reveal the potential advantage of qudit circuits over generic qubit circuits. Generic nnn-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.
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.
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.
Minimizing the number of necessary two-qubit gates is an important task in quantum information processing. By introducing non-computational quantum states in auxiliary spaces, we construct effective circuits for the controlled-NOT (CNOT) gate and the n-control-qubit Toffoli gate with (2n-1) qubit-qudit gates and (2n-2) single-qudit gates. We propose the polarization CNOT and Toffoli gates based on the designed quantum circuits in linear optics by operating on the spatial-mode degree of freedom of photons. Our optical schemes can be achieved with a higher success probability and no extra auxiliary photons are needed.