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

Lecture notes in computer science

Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits

Guowu Yang, Fei Xie, Xiaoyu Song, Marek A. Perkowski

Published Jan 1, 2006• 0 citations
Publisher
DOI
10.1007/11812128_28

Related papers

Synthesis of fast qudit gates by a train of coincident pulses

M. Amniat-Talab, M. Saadati-Niari

The European Physical Journal D•Sep 1, 2015•10 citations

Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by decomposition

Faisal Shah Khan, Marek A. Perkowski

arXiv:quant-ph/0511019•Theoretical Computer Science•Sep 21, 2006•50 citations

Deciding universality of quantum gates

Gábor Ivanyos

arXiv:quant-ph/0603009•Journal of Algebra•Oct 24, 2006•1 citation

Synthesizing hybrid quantum circuits without ancilla qudits

Guowu Yang, William N. N. Hung, Xiaoyu Song +1 more

This paper investigates the synthesis of quantum networks built to realize hybrid switching circuits in the absence of ancilla qudits. We prove that all hybrid reversible circuits can be constructed by hybrid Not and Multiple-Controlled-Not gates. We also prove that any hybrid reversible circuit with only 1 or 2 binary qudits and arbitrary number of other qudits, can be constructed by hybrid Not and Controlled-Not gates. We present two construction-based algorithms to synthesize hybrid reversible circuits without ancilla qudits. The algorithms use hybrid Not and Multiple-Controlled-Not gates or hybrid Not and `1'-Controlled-Not gates, which are exponentially lower than breadth-first search based synthesis algorithms with respect to the input number.

IEEE Congress on Evolutionary Computation (CEC)•Jul 1, 2010•0 citations

Quantum Gates with a Selective Interaction

E. Solano, França M. Santos, P. Milman

Lecture notes in physics•Jan 1, 2001•2 citations

Efficient circuits for exact-universal computation with qudits

Gavin K. Brennen, Stephen S. Bullock, Dianne Prost O’Leary

This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, $\CINC$, is exact-universal. A recent paper [S.Bullock, D.O'Leary, and G.K. Brennen, Phys. Rev. Lett. 94, 230502 (2005)] describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state-synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal.

arXiv:quant-ph/0509161•Quantum Information and Computation•Jul 1, 2006•39 citations
This paper investigates the synthesis of quantum networks built to realize hybrid switching circuits in the absence of ancilla qudits. We prove that all hybrid reversible circuits can be constructed by hybrid Not and Multiple-Controlled-Not gates. We also prove that any hybrid reversible circuit with only 1 or 2 binary qudits and arbitrary number of other qudits, can be constructed by hybrid Not and Controlled-Not gates. We present two construction-based algorithms to synthesize hybrid reversible circuits without ancilla qudits. The algorithms use hybrid Not and Multiple-Controlled-Not gates or hybrid Not and `1'-Controlled-Not gates, which are exponentially lower than breadth-first search based synthesis algorithms with respect to the input number.
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, $\CINC$, is exact-universal. A recent paper [S.Bullock, D.O'Leary, and G.K. Brennen, Phys. Rev. Lett. 94, 230502 (2005)] describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state-synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal.