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

arXiv:quant-ph/0304078

The Controlled-U and Unitary Transformation in Two-Qudit

Funahashi, Kunio

Published Apr 11, 2003• 5 citations
arXivHTMLPDF

Abstract

We concretely construct an extension of the controlled-U gate in qudit from some elementary gates. We also construct unitary transformation in two-qudit by means of the extended controlled-U gate and show the universality of it.
DOI
10.48550/arxiv.quant-ph/0304078

Related papers

EXPLICIT CONSTRUCTION OF CONTROLLED- ＄U＄ GATES AND UNITARY OPERATORS IN TWO-QUDIT

Kunio Funahashi

We concretely construct extensions of controlled-Ugates in multivalued algebra from some elementary gates. We also construct unitary operators in two-qudit by means of the extended controlled-Ugates and show its universality.

The Yokohama mathematical journal = 横濱市立大學紀要. D部門, 数学•Jan 1, 2005•0 citations

Note on Exchange Gate on the Qudit Space

Kazuyuki Fujii

We construct the exchange gate with small elementary gates on the space of qudits, which consist of three controlled shift gates and three "reverse" gates. This is a natural extension of the qubit case. We also consider a similar subject on the Fock space, but in this case it is not clear what elementary gates are. We present some related problems.

•Jun 29, 2002•1 citation

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.

Quantum Information and Computation•Jul 1, 2006•33 citations

Exchange gate on the qudit space and Fock space

Kazuyuki Fujii

We construct an exchange gate with small elementary gates on the space of qudits, which consist of three controlled shift gates and three 'reverse' gates. This is a natural extension of the qubit case. We also consider a similar situation in Fock space, but in this case we find some differences. However, we can construct the exchange gate by making use of a generalized coherent operator based on the Lie algebra su (2), which is a well-known method in quantum optics. We also make a brief comment on 'imperfect clones'.

arXiv:quant-ph/0207002•Journal of Optics B Quantum and Semiclassical Optics•Oct 16, 2003•31 citations

Efficient Circuits for Exact-Universal Computations 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 (PRL 94 230502) 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•Sep 22, 2005•5 citations

Universal quantum circuit for two-qubit transformations with three controlled-NOT gates

Guifré Vidal, Christopher M. Dawson

We consider quantum circuits made of controlled-NOT (CNOT) gates and single-qubit unitary gates and look for constructions that minimize the use of CNOT gates. We show, by means of an explicit quantum circuit, that three CNOT gates are necessary and sufficient in order to implement an arbitrary unitary transformation of two qubits. We also identify the subset of two-qubit gates that can be performed with only two CNOT gates and provide a simple characterization for them.

arXiv:quant-ph/0307177•Physical Review A•Jan 8, 2004•276 citations
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.
We construct an exchange gate with small elementary gates on the space of qudits, which consist of three controlled shift gates and three 'reverse' gates. This is a natural extension of the qubit case. We also consider a similar situation in Fock space, but in this case we find some differences. However, we can construct the exchange gate by making use of a generalized coherent operator based on the Lie algebra su (2), which is a well-known method in quantum optics. We also make a brief comment on 'imperfect clones'.
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 (PRL 94 230502) 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.