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

American Journal of Physics

Spin Without Commutation Rules

Saul T. Epstein

Published Sep 1, 1966• 1 citation
Publisher

Abstract

The Pauli spin matrices are derived in a way which makes no appeal to the usual apparatus of abstract operators, commutation rules, etc.
DOI
10.1119/1.1973472

Related papers

Explicit derivation of the Pauli spin matrices from the Jones vector

Jairo Alonso Mendoza Suárez, Hernando González Sierra, Francis Segovia-Chaves

Using dyadic representations elaborated from vectors of Jones, and calculating relations of anti-commutation of these tensorial forms, we obtain in shape explicit the Pauli spin matrices.

arXiv:1905.00090•Apr 27, 2019•1 citation

Commutation Rules for Generalized Pauli Spin Matrices

EA Jeffery

The algebra is developed for matrices involved in 2(2j+ I)-component arbitrary spin equations. These matrices can act as generators for the unitary group, and are shown to deserve the name 'generalized Pauli spin matrices'. Their commutation and anticommutation rules are derived from those for the ordinary Pauli spin matrices by a method termed mixed induced multiplication.

Australian Journal of Physics•Oct 1, 1978•0 citations

Pauli spin matrices and spinors

Pertti Lounesto

Cambridge University Press eBooks•May 3, 2001•3 citations

Spin Operators and Pauli Matrices

Z. Ficek

•Apr 27, 2016•0 citations

Fast generation of Pauli transfer matrices utilizing tensor product structure

Lukas Hantzko, Lennart Binkowski, Sabhyata Gupta

Abstract Analysis of quantum processes, especially in the context of noise, errors, and decoherence is essential for the improvement of quantum devices. An intuitive representation of those processes modeled by quantum channels are Pauli transfer matrices. They display the action of a linear map in the n-qubit Pauli basis in a way, that is more intuitive, since Pauli strings are more tangible objects than the standard basis matrices. We set out to investigate classical algorithms that convert the various representations into Pauli transfer matrices. We propose new algorithms that make explicit use of the tensor product structure of the Pauli basis. They convert a quantum channel in a given representation (Chi or process matrix, Choi matrix, superoperator, or Kraus operators) to the corresponding Pauli transfer matrix. Moreover, the underlying principle can also be used to calculate the Pauli transfer matrix of other linear operations over n-qubit matrices such as left-, right-, and sandwich multiplication as well as forming the (anti-)commutator with a given operator. Finally, we investigate the runtime of these algorithms, derive their asymptotic scaling and demonstrate improved performance using instances with up to seven qubits.

arXiv:2411.00526•Physica Scripta•Jun 26, 2025•9 citations

Pauli Spin Matrices

Roderich Tumulka

Springer eBooks•Jan 1, 2009•1 citation
Abstract Analysis of quantum processes, especially in the context of noise, errors, and decoherence is essential for the improvement of quantum devices. An intuitive representation of those processes modeled by quantum channels are Pauli transfer matrices. They display the action of a linear map in the n-qubit Pauli basis in a way, that is more intuitive, since Pauli strings are more tangible objects than the standard basis matrices. We set out to investigate classical algorithms that convert the various representations into Pauli transfer matrices. We propose new algorithms that make explicit use of the tensor product structure of the Pauli basis. They convert a quantum channel in a given representation (Chi or process matrix, Choi matrix, superoperator, or Kraus operators) to the corresponding Pauli transfer matrix. Moreover, the underlying principle can also be used to calculate the Pauli transfer matrix of other linear operations over n-qubit matrices such as left-, right-, and sandwich multiplication as well as forming the (anti-)commutator with a given operator. Finally, we investigate the runtime of these algorithms, derive their asymptotic scaling and demonstrate improved performance using instances with up to seven qubits.