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/0207002 · Journal of Optics B Quantum and Semiclassical Optics

Exchange gate on the qudit space and Fock space

Kazuyuki Fujii

Published Oct 16, 2003• 31 citations
arXivHTMLPDF

Abstract

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'.

DOI
10.1088/1464-4266/5/6/011

Related papers

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

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

The Controlled-U and Unitary Transformation in Two-Qudit

Funahashi, Kunio

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.

arXiv:quant-ph/0304078•Apr 11, 2003•5 citations

Three-qubit entangling gates with simultaneous exchange controls in spin qubit systems

Miguel G. Rodriguez, Yun-Pil Shim

Pairwise exchange couplings have long been the standard mechanism for entangling spin qubits in semiconductor systems. However, implementing quantum circuits based on pairwise exchange gates often requires a lengthy sequence of elementary gate operations. In this work, we present an alternative approach: multi-qubit entangling gate operations that simultaneously drive the exchange couplings between multiple pairs of spin qubits. We explore three spin qubit systems in linear or triangular configurations. We derive analytical expressions for these multi-exchange entangling operations and demonstrate how to use the resulting three-qubit gates to construct quantum circuits capable of generating standard entangled states such as GHZ and W states, and the Toffoli gate, by optimizing control parameters. Our results show that this multi-qubit strategy significantly reduces the number of required operations, offering a pathway to more efficient, shallower, and more coherent circuits for spin-qubit processors.

quant-pharXiv:2512.13558•Dec 16, 2025•0 citations

JARLSKOG'S PARAMETRIZATION OF UNITARY MATRICES AND QUDIT THEORY

Kazuyuki Fujii, KUNIO FUNAHASHI, TAKAYUKI KOBAYASHI

In the paper (math–ph/0504049) Jarlskog gave an interesting simple parametrization to unitary matrices, which was essentially the canonical coordinate of the second kind in the Lie group theory (math–ph/0505047). In this paper we apply the method to a quantum computation based on multilevel system (qudit theory). Namely, by considering that the parametrization gives a complete set of modules in qudit theory, we construct the generalized Pauli matrices, which play a central role in the theory and also make a comment on the exchange gate of two–qudit systems. Moreover, we give an explicit construction to the generalized Walsh–Hadamard matrix in the case of n = 3, 4, and 5. For the case of n = 5, its calculation is relatively complicated. In general, a calculation to construct it tends to become more and more complicated as n becomes large. To perform a quantum computation the generalized Walsh–Hadamard matrix must be constructed in a quick and clean manner. From our construction it may be possible to say that a qudit theory with n ≥ 5 is not realistic. This paper is an introduction toward Quantum Engineering.

arXiv:quant-ph/0508006•International Journal of Geometric Methods in Modern Physics•Mar 1, 2006•21 citations

An arbitrary two-qubit computation in 23 elementary gates or less

Stephen S. Bullock, Igor L. Markov

Quantum circuits currently constitute a dominant model for quantum computation according to M. Nielsen and I. Chuang (2000). Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and a small number of elementary quantum gates by A. Barenco et al. (1995) and G. Song and A. Klappenecker (2003) as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound to 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previous known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm according to G. Cybenko (2001) has a worst case of 61 gates of which 18 may be CNOTs. Our technique rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of two-qubit gate with respect to the "magic basis" of phase-shifted Bell states by N. Khaneja et al. (2001) and M. Lewenstein et al. (2001). We extend this decomposition in terms of elementary gates for quantum computation.

ACM/IEEE Design Automation Conference (DAC)•Mar 1, 2004•5 citations
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'.
Pairwise exchange couplings have long been the standard mechanism for entangling spin qubits in semiconductor systems. However, implementing quantum circuits based on pairwise exchange gates often requires a lengthy sequence of elementary gate operations. In this work, we present an alternative approach: multi-qubit entangling gate operations that simultaneously drive the exchange couplings between multiple pairs of spin qubits. We explore three spin qubit systems in linear or triangular configurations. We derive analytical expressions for these multi-exchange entangling operations and demonstrate how to use the resulting three-qubit gates to construct quantum circuits capable of generating standard entangled states such as GHZ and W states, and the Toffoli gate, by optimizing control parameters. Our results show that this multi-qubit strategy significantly reduces the number of required operations, offering a pathway to more efficient, shallower, and more coherent circuits for spin-qubit processors.
In the paper (math–ph/0504049) Jarlskog gave an interesting simple parametrization to unitary matrices, which was essentially the canonical coordinate of the second kind in the Lie group theory (math–ph/0505047). In this paper we apply the method to a quantum computation based on multilevel system (qudit theory). Namely, by considering that the parametrization gives a complete set of modules in qudit theory, we construct the generalized Pauli matrices, which play a central role in the theory and also make a comment on the exchange gate of two–qudit systems. Moreover, we give an explicit construction to the generalized Walsh–Hadamard matrix in the case of n = 3, 4, and 5. For the case of n = 5, its calculation is relatively complicated. In general, a calculation to construct it tends to become more and more complicated as n becomes large. To perform a quantum computation the generalized Walsh–Hadamard matrix must be constructed in a quick and clean manner. From our construction it may be possible to say that a qudit theory with n ≥ 5 is not realistic. This paper is an introduction toward Quantum Engineering.
Quantum circuits currently constitute a dominant model for quantum computation according to M. Nielsen and I. Chuang (2000). Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and a small number of elementary quantum gates by A. Barenco et al. (1995) and G. Song and A. Klappenecker (2003) as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound to 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previous known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm according to G. Cybenko (2001) has a worst case of 61 gates of which 18 may be CNOTs. Our technique rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of two-qubit gate with respect to the "magic basis" of phase-shifted Bell states by N. Khaneja et al. (2001) and M. Lewenstein et al. (2001). We extend this decomposition in terms of elementary gates for quantum computation.