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

Exact Synthesis of Elementary Quantum Gate Circuits.

Daniel J. Grosse, Robert Wille, Gerhard W. Dueck, Rolf Drechsler

Published Jan 1, 2009• 14 citations
OpenAlex

Related papers

Synthesis of unitaries with Clifford+T circuits

Vadym Kliuchnikov

We describe a new method for approximating an arbitrary $n$ qubit unitary with precision $\varepsilon$ using a Clifford and T circuit with $O(4^{n}n(\log(1/\varepsilon)+n))$ gates. The method is based on rounding off a unitary to a unitary over the ring $\mathbb{Z}[i,1/\sqrt{2}]$ and employing exact synthesis. We also show that any $n$ qubit unitary over the ring $\mathbb{Z}[i,1/\sqrt{2}]$ with entries of the form $(a+b\sqrt{2}+ic+id\sqrt{2})/2^{k}$ can be exactly synthesized using $O(4^{n}nk)$ Clifford and T gates using two ancillary qubits. This new exact synthesis algorithm is an improvement over the best known exact synthesis method by B. Giles and P. Selinger requiring $O(3^{2^{n}}nk)$ elementary gates.

arXiv:1306.3200•Jun 13, 2013•60 citations

Synthesis of Quantum Circuits

Philipp Niemann, Robert Wille

SpringerBriefs in physics•Jan 1, 2017•0 citations

Synthesis of Semi-Classical Quantum Circuits.

Shigeru Yamashita, Shin-ichi Minato, D. Michael Miller

•Jan 1, 2012•7 citations

Synthesis of multivalued quantum logic circuits by elementary gates

Yao-Min Di, Hai‐Rui Wei

We propose the generalized controlled $X$ (gcx) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and show that it is feasible with current technology. With these elementary gates many important qudit quantum gates can be synthesized conveniently. We provide efficient methods for the synthesis of various kinds of controlled qudit gates and greatly simplify the synthesis of existing generic multi-valued quantum circuits. Moreover, we generalize the quantum Shannon decomposition (QSD), the most powerful technique for the synthesis of generic qubit circuits, to the qudit case. A comparison of ququart ($d=4$) circuits and qubit circuits reveals that using ququart circuits may have an advantage over the qubit circuits in the synthesis of quantum circuits.

arXiv:1302.0056•Physical Review A•Jan 22, 2013•78 citations

Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares

Daniel J. Grosse, Robert Wille, Gerhard W. Dueck +1 more

Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean satisfiability (SAT), that finds the minimal elementary quantum gate realization for a given reversible function. Since these gates work in terms of qubits, a multi-valued encoding is proposed. Don't care conditions appear naturally in many reversible functions. Constant inputs are often required when a function is embedded into a reversible one. The proposed algorithm takes full advantage of don't care conditions and automatically sets the constant inputs to their optimal values. The effectiveness of the algorithm is shown on a set of benchmark functions.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2008•46 citations

Quantum circuit synthesis with quantum increment gate

X.Y. Li, G.W. Yang, C.M. Torres +2 more

WIT transactions on information and communication technologies•Oct 7, 2014•0 citations
We describe a new method for approximating an arbitrary nnn qubit unitary with precision ε\varepsilonε using a Clifford and T circuit with O(4nn(log⁡(1/ε)+n))O(4^{n}n(\log(1/\varepsilon)+n))O(4nn(log(1/ε)+n)) gates. The method is based on rounding off a unitary to a unitary over the ring Z[i,1/2]\mathbb{Z}[i,1/\sqrt{2}]Z[i,1/2​] and employing exact synthesis. We also show that any nnn qubit unitary over the ring Z[i,1/2]\mathbb{Z}[i,1/\sqrt{2}]Z[i,1/2​] with entries of the form (a+b2+ic+id2)/2k(a+b\sqrt{2}+ic+id\sqrt{2})/2^{k}(a+b2​+ic+id2​)/2k can be exactly synthesized using O(4nnk)O(4^{n}nk)O(4nnk) Clifford and T gates using two ancillary qubits. This new exact synthesis algorithm is an improvement over the best known exact synthesis method by B. Giles and P. Selinger requiring O(32nnk)O(3^{2^{n}}nk)O(32nnk) elementary gates.
We propose the generalized controlled XXX (gcx) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and show that it is feasible with current technology. With these elementary gates many important qudit quantum gates can be synthesized conveniently. We provide efficient methods for the synthesis of various kinds of controlled qudit gates and greatly simplify the synthesis of existing generic multi-valued quantum circuits. Moreover, we generalize the quantum Shannon decomposition (QSD), the most powerful technique for the synthesis of generic qubit circuits, to the qudit case. A comparison of ququart (d=4d=4d=4) circuits and qubit circuits reveals that using ququart circuits may have an advantage over the qubit circuits in the synthesis of quantum circuits.
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean satisfiability (SAT), that finds the minimal elementary quantum gate realization for a given reversible function. Since these gates work in terms of qubits, a multi-valued encoding is proposed. Don't care conditions appear naturally in many reversible functions. Constant inputs are often required when a function is embedded into a reversible one. The proposed algorithm takes full advantage of don't care conditions and automatically sets the constant inputs to their optimal values. The effectiveness of the algorithm is shown on a set of benchmark functions.