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

UNITARY GENERALIZATION OF PAULI MATRICES.

Alladi Ramakrishnan

Published Jan 1, 1970• 0 citations
OpenAlex

Related papers

NEW GENERALISATIONS OF PAULI MATRICES.

Alladi Ramakrishnan

•Jan 1, 1970•0 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

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

The ubiquitous Pauli matrices

Steven B. Berger

American Journal of Physics•Jan 1, 1985•3 citations

Pauli matrices

Giuseppe Mussardo

Springer eBooks•Jan 1, 2025•0 citations

DECOMPOSITION OF UNITARY MATRICES AND QUANTUM GATES

Chi-Kwong Li, Rebecca Roberts, Xiaoyan Yin

A general scheme is presented to decompose a d-by-d unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in d - 1 classes, where each class is isomorphic to the group of 2 × 2 unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on n-qubit registers can be expressed as no more than 2n-1(2n-1) fully controlled single-qubit gates chosen from 2n-1 classes, where the quantum gates in each class share the same n - 1 control qubits. Moreover, it is shown that one can easily adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.

arXiv:1210.7366•International Journal of Quantum Information•Feb 1, 2013•56 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.
A general scheme is presented to decompose a d-by-d unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in d - 1 classes, where each class is isomorphic to the group of 2 × 2 unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on n-qubit registers can be expressed as no more than 2n-1(2n-1) fully controlled single-qubit gates chosen from 2n-1 classes, where the quantum gates in each class share the same n - 1 control qubits. Moreover, it is shown that one can easily adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.