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

Applications of decompositions for synthesis of quantum gates

Juha J. Vartiainen, Ville Bergholm, O.-P. Saira, Mikko Möttönen

Published Jan 1, 2005• 0 citations
OpenAlex

Related papers

Synthesis of quantum circuits by multiplex rotation gates

Jiang Hu, Wang Pengjun, Zhang Qiaowen

As a model for quantum computation, quantum circuits have found their wide applications in communications, cryptography and information processing. In order to synthesize arbitrary quantum circuits, we present a new type of gate called quantum multiplex rotation gate, which is implemented by simply elementary gates. A method based on QR decomposition and two optimization rules are proposed to decompose general quantum circuit acting on n-qubits into quantum multiplex rotation gates. In comparison with other synthesis algorithms by QR decomposition, our methods achieve better performance in terms of elementary gate counts, 1.2 × 4n approximately.

IEICE Electronics Express•Jan 1, 2016•1 citation

Synthesis of Quantum Circuits

Philipp Niemann, Robert Wille

SpringerBriefs in physics•Jan 1, 2017•0 citations

Optimal Control and Circuit Synthesis of Quantum Gates

Hyeong-Jin Kim

•Jan 1, 2021•0 citations

Optimal synthesis of linear reversible circuits

K.N. Patel, Igor L. Markov, J.P. Hayes

In this paper we consider circuit synthesis for $n$-wire linear reversible circuits using the C-NOT gate library. These circuits are an important class of reversible circuits with applications to quantum computation. Previous algorithms, based on Gaussian elimination and LU-decomposition, yield circuits with $O\left(n^2\right)$ gates in the worst-case. However, an information theoretic bound suggests that it may be possible to reduce this to as few as $O\left(n^2/\log\, n\right)$ gates.

arXiv:quant-ph/0302002•Quantum Information and Computation•Mar 1, 2008•166 citations

Synthesis of reversible logic circuits

Vivek Shende, Aditya K. Prasad, Igor L. Markov +1 more

Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics, and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels). We prove constructively that every even permutation can be implemented without temporary storage using NOT, CNOT, and TOFFOLI gates. We describe an algorithm for the synthesis of optimal circuits and study the reversible functions on three wires, reporting the distribution of circuit sizes. We also study canonical circuit decompositions where gates of the same kind are grouped together. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover's search algorithm, and show a significant improvement over a previously proposed synthesis algorithm.

arXiv:quant-ph/0207001•IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems•May 29, 2003•581 citations

The Use of Hilbert-Schmidt Decomposition for Implementing Quantum Gates

Y. Ben-Aryeh

Lecture notes in computer science•Jan 1, 2008•0 citations
As a model for quantum computation, quantum circuits have found their wide applications in communications, cryptography and information processing. In order to synthesize arbitrary quantum circuits, we present a new type of gate called quantum multiplex rotation gate, which is implemented by simply elementary gates. A method based on QR decomposition and two optimization rules are proposed to decompose general quantum circuit acting on n-qubits into quantum multiplex rotation gates. In comparison with other synthesis algorithms by QR decomposition, our methods achieve better performance in terms of elementary gate counts, 1.2 × 4n approximately.
In this paper we consider circuit synthesis for nnn-wire linear reversible circuits using the C-NOT gate library. These circuits are an important class of reversible circuits with applications to quantum computation. Previous algorithms, based on Gaussian elimination and LU-decomposition, yield circuits with O(n2)O\left(n^2\right)O(n2) gates in the worst-case. However, an information theoretic bound suggests that it may be possible to reduce this to as few as O(n2/log⁡ n)O\left(n^2/\log\, n\right)O(n2/logn) gates.
Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics, and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels). We prove constructively that every even permutation can be implemented without temporary storage using NOT, CNOT, and TOFFOLI gates. We describe an algorithm for the synthesis of optimal circuits and study the reversible functions on three wires, reporting the distribution of circuit sizes. We also study canonical circuit decompositions where gates of the same kind are grouped together. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover's search algorithm, and show a significant improvement over a previously proposed synthesis algorithm.