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

Quantum

Shorter quantum circuits via single-qubit gate approximation

Vadym Kliuchnikov, Romy Minko, Adam Paetznick, Christophe Petit

Published Jun 18, 2025• 0 citations
Publisher

Abstract

Dataset for Shorter quantum circuits via single-qubit gate approximation
DOI
10.5281/zenodo.15691839

Related papers

Efficient decomposition of single-qubit gates into V basis circuits

Alex Bocharov, Yuri G. Gurevich, Krysta M. Svore

We develop efficient algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis. The $V$ basis is an alternative universal basis to the more commonly studied basis consisting of Hadamard and $\ensuremath{\pi}/8$ gates. We propose two classical algorithms for quantum circuit compilation: the first algorithm has expected polynomial time [in precision $\mathrm{log}(1/\ensuremath{\epsilon})$] and produces an $\ensuremath{\epsilon}$ approximation to a single-qubit unitary with a circuit depth $\ensuremath{\le}12\phantom{\rule{0.16em}{0ex}}{\mathrm{log}}_{5}(2/\ensuremath{\epsilon})$. The second algorithm performs optimized direct search and yields circuits a factor of 3 to 4 times shorter than our first algorithm, but requires time exponential in $\mathrm{log}(1/\ensuremath{\epsilon})$; however, we show that in practice the runtime is reasonable for an important range of target precisions. Decomposing into the $V$ basis may offer advantages when considering the fault-tolerant implementation of quantum circuits.

arXiv:1303.1411•Physical Review A•Jul 12, 2013•77 citations

Optimal quantum circuits for general two-qubit gates (5 pages)

Colin P. Williams, Farrokh Vatan

Physical Review A•Jan 1, 2004•19 citations

QUANTUM CIRCUIT OPTIMIZATION (FOR 3 QUBITS)

International Journal of Advance Engineering and Research Development•Jun 30, 2015•0 citations

Quantum Circuit Synthesis of an Approximate Hybrid Kolmogorov-Arnold Network

Shion Samadder Chaudhury, Sudhindu Bikash Mandal, Turbasu Chatterjee +2 more

In this work, we construct a quantum circuit that instantiates an approximate version of a hybrid quantum-classical Kolmogorov-Arnold (AHQC-KAN) network. Our AHQC-KAN uses Chebyshev polynomials and a recursive operator encoding scheme. We demonstrate that our circuit requires $\mathcal{O}(\log n)$ qubits and $\mathcal{O}\left(2^{n}\right)$-2-qubit gates for n features. Simulation results show that our single-layer AHQC-KAN circuit achieves high accuracy on the highly nonlinear dataset, namely the spiral dataset with different noise levels. This work opens up several research directions for future consideration.

IEEE Computer Society Annual Symposium on VLSI•Jul 6, 2025•0 citations

Shorter quantum circuits via single-qubit gate approximation

Vadym Kliuchnikov, Kristin Lauter, Romy Minko +2 more

We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achieving an immediate improvement in sequence length by a factor of 7/9. Extending the works \cite{Hastings2017} and \cite{Campbell2017}, we show that taking probabilistic mixtures of channels to solve fallback \cite{BRS2015} and magnitude approximation problems saves factor of two in approximation costs. In particular, over the Clifford+ T gate set we achieve an average non-Clifford gate count of 0.23 log 2 ⁡ ( 1 / ε ) + 2.13 and T-count 0.56 log 2 ⁡ ( 1 / ε ) + 5.3 with mixed fallback approximations for diamond norm accuracy ε .This paper provides a holistic overview of gate approximation, in addition to these new insights. We give an end-to-end procedure for gate approximation for general gate sets related to some quaternion algebras, providing pedagogical examples using common fault-tolerant gate sets (V, Clifford+T and Clifford+ T ). We also provide detailed numerical results for Clifford+T and Clifford+ T gate sets. In an effort to keep the paper self-contained, we include an overview of the relevant algorithms for integer point enumeration and relative norm equation solving. We provide a number of further applications of the magnitude approximation problems, as well as improved algorithms for exact synthesis, in the Appendices.

arXiv:2203.10064•Quantum•Dec 18, 2023•61 citations

Quantum Circuit Designs for Gate Model Quantum Computers

László Gyöngyösi, Sándor Imre

Bulletin of the American Physical Society•Mar 5, 2018•0 citations
We develop efficient algorithms for compiling single-qubit unitary gates into circuits over the universal VVV basis. The VVV basis is an alternative universal basis to the more commonly studied basis consisting of Hadamard and $\ensuremath{\pi}/8$ gates. We propose two classical algorithms for quantum circuit compilation: the first algorithm has expected polynomial time [in precision $\mathrm{log}(1/\ensuremath{\epsilon})$] and produces an $\ensuremath{\epsilon}$ approximation to a single-qubit unitary with a circuit depth $\ensuremath{\le}12\phantom{\rule{0.16em}{0ex}}{\mathrm{log}}_{5}(2/\ensuremath{\epsilon})$. The second algorithm performs optimized direct search and yields circuits a factor of 3 to 4 times shorter than our first algorithm, but requires time exponential in $\mathrm{log}(1/\ensuremath{\epsilon})$; however, we show that in practice the runtime is reasonable for an important range of target precisions. Decomposing into the VVV basis may offer advantages when considering the fault-tolerant implementation of quantum circuits.
In this work, we construct a quantum circuit that instantiates an approximate version of a hybrid quantum-classical Kolmogorov-Arnold (AHQC-KAN) network. Our AHQC-KAN uses Chebyshev polynomials and a recursive operator encoding scheme. We demonstrate that our circuit requires O(log⁡n)\mathcal{O}(\log n)O(logn) qubits and O(2n)\mathcal{O}\left(2^{n}\right)O(2n)-2-qubit gates for n features. Simulation results show that our single-layer AHQC-KAN circuit achieves high accuracy on the highly nonlinear dataset, namely the spiral dataset with different noise levels. This work opens up several research directions for future consideration.
We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achieving an immediate improvement in sequence length by a factor of 7/9. Extending the works \cite{Hastings2017} and \cite{Campbell2017}, we show that taking probabilistic mixtures of channels to solve fallback \cite{BRS2015} and magnitude approximation problems saves factor of two in approximation costs. In particular, over the Clifford+ T gate set we achieve an average non-Clifford gate count of 0.23 log 2 ⁡ ( 1 / ε ) + 2.13 and T-count 0.56 log 2 ⁡ ( 1 / ε ) + 5.3 with mixed fallback approximations for diamond norm accuracy ε .This paper provides a holistic overview of gate approximation, in addition to these new insights. We give an end-to-end procedure for gate approximation for general gate sets related to some quaternion algebras, providing pedagogical examples using common fault-tolerant gate sets (V, Clifford+T and Clifford+ T ). We also provide detailed numerical results for Clifford+T and Clifford+ T gate sets. In an effort to keep the paper self-contained, we include an overview of the relevant algorithms for integer point enumeration and relative norm equation solving. We provide a number of further applications of the magnitude approximation problems, as well as improved algorithms for exact synthesis, in the Appendices.