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/0309132

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

Kazuyuki Fujii

Published Sep 18, 2003• 23 citations
arXivHTMLPDF

Abstract

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.
DOI
10.48550/arxiv.quant-ph/0309132

Related papers

Constructing a Set of Kronecker-Pauli Matrices

Christian Rakotonirina

In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via Kronecker product, called Kronecker-Pauli matrices, is typically restricted to for \(2^n\) dimensional systems. This paper explores extending this generalization to \(N\)-dimensional systems, where \(N\) is a prime integer, in order to construct \(N\times N\)-Kronecker-Pauli matrices. We begin by examining the specific cases of \(3\times 3\) and \(5\times 5\) Kronecker-Pauli matrices, with the goal of the purpose constructing a set of \(N\times N\)-Kronecker-Pauli matrices for any prime integer \(N\).

Qeios•Oct 18, 2024•2 citations

Constructing a Set of Kronecker-Pauli Matrices

Christian Rakotonirina

In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via the Kronecker product, known as Pauli strings, is typically restricted to \(2^{n}\) dimensional systems. This paper explores extending this generalization to \(N\)-dimensional systems, where \(N\) is a prime integer, to construct \(N \times N\)-Kronecker-Pauli matrices. We begin by examining the specific cases of \(3 \times 3\) and \(5 \times 5\) Kronecker-Pauli matrices, with the goal of the purpose constructing a set of \(N \times N\)-Kronecker-Pauli matrices for any prime integer \(N\). Another possible method for constructing a set of Kronecker-Pauli matrices is discussed.

Qeios•Aug 9, 2025•0 citations

Constructing a Set of Kronecker-Pauli Matrices

Christian Rakotonirina

In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via Kronecker product, called Kronecker-Pauli matrices, is typically restricted to for \(2^n\) dimensional systems. This paper explores extending this generalization to \(N\)-dimensional systems, where \(N\) is a prime integer, in order to construct \(N\times N\)-Kronecker-Pauli matrices. We begin by examining the specific cases of \(3\times 3\) and \(5\times 5\) Kronecker-Pauli matrices, with the goal of the purpose constructing a set of \(N\times N\)-Kronecker-Pauli matrices for any prime integer \(N\).

Qeios•Sep 20, 2024•2 citations

Constructing a Set of Kronecker–Pauli Matrices

Christian Rakotonirina

In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via the Kronecker product, known as Pauli strings, is typically restricted to 2 n ‐dimensional systems. This paper explores extending this generalization to n ‐dimensional systems, where n is an integer, n > 2, to construct n × n ‐Kronecker–Pauli matrices. We establish a method for constructing a set of Kronecker–Pauli matrices for any dimension by examining the method for constructing the specific cases of 3 × 3 and 5 × 5 Kronecker–Pauli matrices. Another possible method for constructing a set of Kronecker–Pauli matrices, by using the Weyl operators, is discussed.

International Journal of Mathematics and Mathematical Sciences•Jan 1, 2026•0 citations

Constructing a Set of Kronecker-Pauli Matrices

Christian Rakotonirina

In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via the Kronecker product, known as Pauli strings, is typically restricted to \(2^{n}\) dimensional systems. This paper explores extending this generalization to \(N\)-dimensional systems, where \(N\) is a prime integer, to construct \(N \times N\)-Kronecker-Pauli matrices. We begin by examining the specific cases of \(3 \times 3\) and \(5 \times 5\) Kronecker-Pauli matrices, with the goal of the purpose constructing a set of \(N \times N\)-Kronecker-Pauli matrices for any prime integer \(N\).

Qeios•Mar 14, 2025•0 citations

Pauli decomposition via the fast Walsh-Hadamard transform

Timothy N. Georges, Bjorn K. Berntson, Christoph Sünderhauf +1 more

Abstract The decomposition of a square matrix into a sum of Pauli strings is a classical pre-processing step required to realize many quantum algorithms. Such a decomposition requires significant computational resources for large matrices. We present an exact and explicit formula for the Pauli string coefficients which inspires an efficient algorithm to compute them. More specifically, we show that up to a permutation of the matrix elements, the decomposition coefficients are related to the original matrix by a multiplication of a generalised Hadamard matrix. This allows one to use the Fast Walsh-Hadamard transform and calculate all Pauli decomposition coefficients in O ( N 2 log ⁡ N ) time and using O ( 1 ) additional memory, for an N × N matrix. A numerical implementation of our equation outperforms currently available solutions.

arXiv:2408.06206•New Journal of Physics•Feb 10, 2025•19 citations
In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via Kronecker product, called Kronecker-Pauli matrices, is typically restricted to for 2n2^n2n dimensional systems. This paper explores extending this generalization to NNN-dimensional systems, where NNN is a prime integer, in order to construct N×NN\times NN×N-Kronecker-Pauli matrices. We begin by examining the specific cases of 3×33\times 33×3 and 5×55\times 55×5 Kronecker-Pauli matrices, with the goal of the purpose constructing a set of N×NN\times NN×N-Kronecker-Pauli matrices for any prime integer NNN.
In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via the Kronecker product, known as Pauli strings, is typically restricted to 2n2^{n}2n dimensional systems. This paper explores extending this generalization to NNN-dimensional systems, where NNN is a prime integer, to construct N×NN \times NN×N-Kronecker-Pauli matrices. We begin by examining the specific cases of 3×33 \times 33×3 and 5×55 \times 55×5 Kronecker-Pauli matrices, with the goal of the purpose constructing a set of N×NN \times NN×N-Kronecker-Pauli matrices for any prime integer NNN. Another possible method for constructing a set of Kronecker-Pauli matrices is discussed.
In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via Kronecker product, called Kronecker-Pauli matrices, is typically restricted to for 2n2^n2n dimensional systems. This paper explores extending this generalization to NNN-dimensional systems, where NNN is a prime integer, in order to construct N×NN\times NN×N-Kronecker-Pauli matrices. We begin by examining the specific cases of 3×33\times 33×3 and 5×55\times 55×5 Kronecker-Pauli matrices, with the goal of the purpose constructing a set of N×NN\times NN×N-Kronecker-Pauli matrices for any prime integer NNN.
In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via the Kronecker product, known as Pauli strings, is typically restricted to 2 n ‐dimensional systems. This paper explores extending this generalization to n ‐dimensional systems, where n is an integer, n > 2, to construct n × n ‐Kronecker–Pauli matrices. We establish a method for constructing a set of Kronecker–Pauli matrices for any dimension by examining the method for constructing the specific cases of 3 × 3 and 5 × 5 Kronecker–Pauli matrices. Another possible method for constructing a set of Kronecker–Pauli matrices, by using the Weyl operators, is discussed.
In quantum physics, the choice of basis is crucial for formulation. The generalization of the Pauli matrices via the Kronecker product, known as Pauli strings, is typically restricted to 2n2^{n}2n dimensional systems. This paper explores extending this generalization to NNN-dimensional systems, where NNN is a prime integer, to construct N×NN \times NN×N-Kronecker-Pauli matrices. We begin by examining the specific cases of 3×33 \times 33×3 and 5×55 \times 55×5 Kronecker-Pauli matrices, with the goal of the purpose constructing a set of N×NN \times NN×N-Kronecker-Pauli matrices for any prime integer NNN.
Abstract The decomposition of a square matrix into a sum of Pauli strings is a classical pre-processing step required to realize many quantum algorithms. Such a decomposition requires significant computational resources for large matrices. We present an exact and explicit formula for the Pauli string coefficients which inspires an efficient algorithm to compute them. More specifically, we show that up to a permutation of the matrix elements, the decomposition coefficients are related to the original matrix by a multiplication of a generalised Hadamard matrix. This allows one to use the Fast Walsh-Hadamard transform and calculate all Pauli decomposition coefficients in O ( N 2 log ⁡ N ) time and using O ( 1 ) additional memory, for an N × N matrix. A numerical implementation of our equation outperforms currently available solutions.