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/0508006 · International Journal of Geometric Methods in Modern Physics

JARLSKOG'S PARAMETRIZATION OF UNITARY MATRICES AND QUDIT THEORY

Kazuyuki Fujii, KUNIO FUNAHASHI, TAKAYUKI KOBAYASHI

Published Mar 1, 2006• 21 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1142/s0219887806001144

Related papers

Comment on "A Recursive Parametrisation of Unitary Matrices"

Kazuyuki Fujii

In this note we make a comment on the paper by Jarlskog (math-ph/0504049) in which she gave a parametrisation to unitary matrices. Namely, we show that her recursive method is essentially obtained by the canonical coordinate of the second kind in the Lie group theory, and propose a problem on constructing unitary gates in quantum computation by making use of the parametrisation.

arXiv:math-ph/0505047•May 19, 2005•6 citations

Quantum Optical Construction of Generalized Pauli and Walsh-Hadamard Matrices in Three Level Systems

Kazuyuki Fujii

A set of generators of generalized Pauli matrices play a crucial role in quantum computation based on n level systems of an atom. In this paper we show how to construct them by making use of Rabi oscillations. We also construct the generalized Walsh-Hadamard matrix in the case of three level systems and present some related problems.

arXiv:quant-ph/0309132•Sep 18, 2003•23 citations

The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems

Rahul Sarkar, Theodore J. Yoder

Qudits with local dimension d>2 can have unique structure and uses that qubits ( d=2 ) cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and operators. We study the structure of the qudit Pauli group for any, including composite, d in several ways. To cover composite values of d , we work with modules over commutative rings, which generalize the notion of vector spaces over fields. For any specified set of commutation relations, we construct a set of qudit Paulis satisfying those relations. We also study the maximum size of sets of Paulis that mutually non-commute and sets that non-commute in pairs. Finally, we give methods to find near minimal generating sets of Pauli subgroups, calculate the sizes of Pauli subgroups, and find bases of logical operators for qudit stabilizer codes. Useful tools in this study are normal forms from linear algebra over commutative rings, including the Smith normal form, alternating Smith normal form, and Howell normal form of matrices. Possible applications of this work include the construction and analysis of qudit stabilizer codes, entanglement assisted codes, parafermion codes, and fermionic Hamiltonian simulation.

arXiv:2302.07966•Quantum•Apr 4, 2024•16 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•36 citations

UNITARY MATRICES AND COMMUTATORS

Yorick Hardy, W.‐H. Steeb

Unitary matrices are the quantum gates in quantum computing. We study the question under which conditions is the commutator of two unitary matrices again a unitary matrix. We consider the general case and a complete solution for the 2 × 2 unitary matrices. We also consider Kronecker products and direct sums of unitary matrices.

International Journal of Geometric Methods in Modern Physics•Nov 1, 2011•0 citations

Universality of Single-Qudit Gates

Adam Sawicki, Katarzyna Karnas

We consider the problem of deciding if a set of quantum one-qudit gates $$\mathcal {S}=\{g_1,\ldots ,g_n\}\subset G$$ is universal, i.e. if $${<}\mathcal {S}{>}$$ is dense in G, where G is either the special unitary or the special orthogonal group. To every gate g in $$\mathcal {S}$$ we assign the orthogonal matrix $$\mathrm {Ad}_g$$ that is image of g under the adjoint representation $$\mathrm {Ad}:G\rightarrow SO(\mathfrak {g})$$ and $$\mathfrak {g}$$ is the Lie algebra of G. The necessary condition for the universality of $$\mathcal {S}$$ is that the only matrices that commute with all $$\mathrm {Ad}_{g_i}$$ ’s are proportional to the identity. If in addition there is an element in $${<}\mathcal {S}{>}$$ whose Hilbert–Schmidt distance from the centre of G belongs to $$]0,\frac{1}{\sqrt{2}}[$$ , then $$\mathcal {S}$$ is universal. Using these we provide a simple algorithm that allows deciding the universality of any set of d-dimensional gates in a finite number of steps and formulate a general classification theorem.

arXiv:1609.05780•Annales Henri Poincaré•Aug 10, 2017•36 citations
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.
Qudits with local dimension d>2 can have unique structure and uses that qubits ( d=2 ) cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and operators. We study the structure of the qudit Pauli group for any, including composite, d in several ways. To cover composite values of d , we work with modules over commutative rings, which generalize the notion of vector spaces over fields. For any specified set of commutation relations, we construct a set of qudit Paulis satisfying those relations. We also study the maximum size of sets of Paulis that mutually non-commute and sets that non-commute in pairs. Finally, we give methods to find near minimal generating sets of Pauli subgroups, calculate the sizes of Pauli subgroups, and find bases of logical operators for qudit stabilizer codes. Useful tools in this study are normal forms from linear algebra over commutative rings, including the Smith normal form, alternating Smith normal form, and Howell normal form of matrices. Possible applications of this work include the construction and analysis of qudit stabilizer codes, entanglement assisted codes, parafermion codes, and fermionic Hamiltonian simulation.
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'.
We consider the problem of deciding if a set of quantum one-qudit gates S={g1,…,gn}⊂G\mathcal {S}=\{g_1,\ldots ,g_n\}\subset GS={g1​,…,gn​}⊂G is universal, i.e. if <S>{<}\mathcal {S}{>}<S> is dense in G, where G is either the special unitary or the special orthogonal group. To every gate g in S\mathcal {S}S we assign the orthogonal matrix Adg\mathrm {Ad}_gAdg​ that is image of g under the adjoint representation Ad:G→SO(g)\mathrm {Ad}:G\rightarrow SO(\mathfrak {g})Ad:G→SO(g) and g\mathfrak {g}g is the Lie algebra of G. The necessary condition for the universality of S\mathcal {S}S is that the only matrices that commute with all Adgi\mathrm {Ad}_{g_i}Adgi​​ ’s are proportional to the identity. If in addition there is an element in <S>{<}\mathcal {S}{>}<S> whose Hilbert–Schmidt distance from the centre of G belongs to ]0,12[]0,\frac{1}{\sqrt{2}}[]0,2​1​[ , then S\mathcal {S}S is universal. Using these we provide a simple algorithm that allows deciding the universality of any set of d-dimensional gates in a finite number of steps and formulate a general classification theorem.