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

Malaysian Journal of Mathematical Sciences

Algebraic representation of Three Qubit Quantum Circuit Problems

Chew K. Y., Nurisya Mohd Shah, Chan K. T.

Published Sep 26, 2022• 0 citations
Publisher

Abstract

The evolution of quantum states serves as good fundamental studies in understanding the quantum information systems which finally lead to the research on quantum computation. To carry out such a study, mathematical tools such as the Lie group and their associated Lie algebra is of great importance. In this study, the Lie algebra of su(8) is represented in a tensor product operation between three Pauli matrices. This can be realized by constructing the generalized Gell-Mann matrices and comparing them to the Pauli bases. It is shown that there is a one-to-one correlation of the Gell-Mann matrices with the Pauli basis which resembled the change of coordinates. Together with the commutator relations and the frequency analysis of the structure constant via the algebra, the Lie bracket operation will be highlighted providing insight into relating quantum circuit model with Lie Algebra. These are particularly useful when dealing with three-qubit quantum circuit problems which involve quantum gates that is derived from the SU(8) Lie group.

DOI
10.47836/mjms.16.3.10

Related papers

Representation of $\mathfrak{su}(8)$ in Pauli Basis

Chew, K. Y., Nurisya Mohd Shah, Chan, K. T.

Quantum computation started to become significant field of studies as it hold great promising towards the upgrade of our current computational power. Studying the evolution of quantum states serves as a good fundamental in understanding quantum information which lead to quantum computation. This was assisted with the respective mathematical tools such as Lie group and Lie algebra. In this study, the Lie algebra of $\mathfrak{su}(8)$ is represented in tensor product between three Pauli matrices. This is done by constructing the generalized Gell-Mann matrices and compared to the Pauli basis. This study will explicitly shows the one-to-one correlation of Gell-Mann matrices with the Pauli basis resembled change of coordinates. This is particularly useful when dealing with quantum circuit problems.

arXiv:2003.09192•Mar 20, 2020•0 citations

Enabling Lie-Algebraic Classical Simulation beyond Free Fermions

Adelina Bärligea, Matthew L. Sims-Goh, Jakob S. Kottmann

Efficient classical simulation has matured to a critical component of the quantum computing stack, driving hardware validation, algorithm design, benchmarking, and the study of structured quantum dynamics. Lie-algebraic simulation ($\mathfrak{g}$-sim) offers a compelling approach: it represents Heisenberg-picture dynamics in the adjoint space whose dimension is set by the dynamical Lie algebra (DLA) governing the circuit, enabling efficient simulation of expectation values whenever the DLA grows only polynomially with system size. Despite this promise, existing applications of $\mathfrak{g}$-sim have been confined to free-fermionic settings. It has therefore remained unclear if the method can be applied to other structured circuit families, especially when their generators have large Pauli expansions, and hence whether Lie-algebraic simulability presents a genuinely broader paradigm than free fermions. In this work, we resolve this question by identifying additional non-trivial families of polynomial-dimensional DLAs and introducing symmetry-adapted bases that make the required adjoint-space preprocessing tractable. In particular, we develop an explicit Pauli orbit representation for permutation-equivariant dynamics, enabling efficient processing of cubic-dimensional algebras despite exponential Pauli support, and a modified generalized Gell--Mann representation for bounded Hamming-weight ($U(1)$-equivariant) dynamics, yielding polynomial simulation costs on fixed excitation sectors. Together with streamlined routines for free-fermionic algebras, these constructions significantly broaden the practical scope of $\mathfrak{g}$-sim as a unifying simulation tool for structured quantum circuits. Numerical benchmarks confirm favorable preprocessing scaling and validate large-scale proof-of-concept simulations beyond the reach of state-vector simulation.

quant-pharXiv:2604.16701•Apr 21, 2026•0 citations

Quantum circuits and Spin(3n) groups

Alexander Yu. Vlasov

All quantum gates with one and two qubits may be described by elements of Spin groups due to isomorphisms Spin(3)\isomSU(2) and Spin(6)\isomSU(4). However, the group of n-qubit gates SU(2^n) for n>2 has bigger dimension than Spin(3n). A quantum circuit with one- and two-qubit gates may be used for construction of arbitrary unitary transformation SU(2^n). Analogously, the `$Spin(3n)$ circuits' are introduced in this work as products of elements associated with one- and two-qubit gates with respect to the above-mentioned isomorphisms. The matrix tensor product implementation of the Spin(3n) group together with relevant models by usual quantum circuits with 2n qubits are investigated in such a framework. A certain resemblance with well-known sets of non-universal quantum gates (e.g., matchgates, noninteracting-fermion quantum circuits) related with Spin(2n) may be found in presented approach. Finally, a possibility of the classical simulation of such circuits in polynomial time is discussed.

arXiv:1311.1666•Quantum Information and Computation•Mar 1, 2015•3 citations

Full classification of Pauli Lie algebras

Aguilar, Gerard, Simon Cichy, Jens Eisert +1 more

Lie groups, and therefore Lie algebras, are fundamental structures in quantum physics that determine the space of possible trajectories of evolving systems. However, classification and characterization methods for these structures are often impractical for larger systems. In this work, we provide a comprehensive classification of Lie algebras generated by an arbitrary set of Pauli operators, from which an efficient method to characterize them follows. By mapping the problem to a graph setting, we identify a reduced set of equivalence classes: the free-fermionic Lie algebra, the set of all anti-symmetric Paulis on n qubits, the Lie algebra of symplectic Paulis on n qubits, and the space of all Pauli operators on n qubits, as well as controlled versions thereof. Moreover, out of these, we distinguish 6 Clifford inequivalent cases and find a simple set of canonical operators for each, which allow us to give a physical interpretation of the dynamics of each class. Our findings reveal a no-go result for the existence of small Lie algebras beyond the free-fermionic case in the Pauli setting and offer efficiently computable criteria for universality and extendibility of gate sets. These results bear significant impact in ideas in a number of fields like quantum control, quantum machine learning, or classical simulation of quantum circuits.

arXiv:2408.00081•Jul 31, 2024•1 citation

From Pauli Strings to Quantum Dynamics: A Unified Characterization

Roberto Gargiulo, Paul Herringer, Robert Zeier

Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.

quant-pharXiv:2606.09773•Jun 9, 2026•0 citations

APPLICATION OF LINEAR OPERATORS AND TENSOR PRODUCTS IN QUANTUM ENTANGLEMENT AND QUANTUM COMPUTING

Sevinchova Charosxon Maxmudjonovna, Worldly Knowledge Publishing Centre

Quantum computing is fundamentally based on the mathematical structure of complex Hilbert spaces, linear operators, tensor products, and unitary transformations. Among these concepts, tensor products provide the formal mechanism for constructing the state space of composite quantum systems, whereas linear and unitary operators describe quantum transformations, measurements, and computational gates. This article examines the mathematical relationship between linear operators and tensor products and analyzes their role in the formation, manipulation, and characterization of quantum entanglement. Particular attention is given to two-qubit systems, separable and entangled states, Schmidt decomposition, controlled operations, and the role of non-factorizable operators in quantum circuits. The analysis demonstrates that tensor products perform a dual function: they provide the mathematical representation of composite systems and enable the construction of local operations acting on individual subsystems. At the same time, genuinely entangling transformations, such as the controlled-NOT operation, cannot in general be represented as a single tensor product of independent local operators. Recent research further demonstrates that tensor-product and operator-Schmidt decompositions can be used to characterize operator entanglement, reduce circuit complexity, and construct efficient representations of quantum processes. The results establish that linear algebra and tensor-product structures are not merely formal tools but constitute the mathematical foundation connecting quantum entanglement with quantum computation.

HSR (London)•Oct 8, 2026•0 citations
The evolution of quantum states serves as good fundamental studies in understanding the quantum information systems which finally lead to the research on quantum computation. To carry out such a study, mathematical tools such as the Lie group and their associated Lie algebra is of great importance. In this study, the Lie algebra of su(8) is represented in a tensor product operation between three Pauli matrices. This can be realized by constructing the generalized Gell-Mann matrices and comparing them to the Pauli bases. It is shown that there is a one-to-one correlation of the Gell-Mann matrices with the Pauli basis which resembled the change of coordinates. Together with the commutator relations and the frequency analysis of the structure constant via the algebra, the Lie bracket operation will be highlighted providing insight into relating quantum circuit model with Lie Algebra. These are particularly useful when dealing with three-qubit quantum circuit problems which involve quantum gates that is derived from the SU(8) Lie group.
Representation of su(8)\mathfrak{su}(8)su(8) in Pauli Basis
Quantum computation started to become significant field of studies as it hold great promising towards the upgrade of our current computational power. Studying the evolution of quantum states serves as a good fundamental in understanding quantum information which lead to quantum computation. This was assisted with the respective mathematical tools such as Lie group and Lie algebra. In this study, the Lie algebra of su(8)\mathfrak{su}(8)su(8) is represented in tensor product between three Pauli matrices. This is done by constructing the generalized Gell-Mann matrices and compared to the Pauli basis. This study will explicitly shows the one-to-one correlation of Gell-Mann matrices with the Pauli basis resembled change of coordinates. This is particularly useful when dealing with quantum circuit problems.
Efficient classical simulation has matured to a critical component of the quantum computing stack, driving hardware validation, algorithm design, benchmarking, and the study of structured quantum dynamics. Lie-algebraic simulation (g\mathfrak{g}g-sim) offers a compelling approach: it represents Heisenberg-picture dynamics in the adjoint space whose dimension is set by the dynamical Lie algebra (DLA) governing the circuit, enabling efficient simulation of expectation values whenever the DLA grows only polynomially with system size. Despite this promise, existing applications of g\mathfrak{g}g-sim have been confined to free-fermionic settings. It has therefore remained unclear if the method can be applied to other structured circuit families, especially when their generators have large Pauli expansions, and hence whether Lie-algebraic simulability presents a genuinely broader paradigm than free fermions. In this work, we resolve this question by identifying additional non-trivial families of polynomial-dimensional DLAs and introducing symmetry-adapted bases that make the required adjoint-space preprocessing tractable. In particular, we develop an explicit Pauli orbit representation for permutation-equivariant dynamics, enabling efficient processing of cubic-dimensional algebras despite exponential Pauli support, and a modified generalized Gell--Mann representation for bounded Hamming-weight (U(1)U(1)U(1)-equivariant) dynamics, yielding polynomial simulation costs on fixed excitation sectors. Together with streamlined routines for free-fermionic algebras, these constructions significantly broaden the practical scope of g\mathfrak{g}g-sim as a unifying simulation tool for structured quantum circuits. Numerical benchmarks confirm favorable preprocessing scaling and validate large-scale proof-of-concept simulations beyond the reach of state-vector simulation.
All quantum gates with one and two qubits may be described by elements of Spin groups due to isomorphisms Spin(3)\isomSU(2) and Spin(6)\isomSU(4). However, the group of n-qubit gates SU(2^n) for n>2 has bigger dimension than Spin(3n). A quantum circuit with one- and two-qubit gates may be used for construction of arbitrary unitary transformation SU(2^n). Analogously, the `Spin(3n)Spin(3n)Spin(3n) circuits' are introduced in this work as products of elements associated with one- and two-qubit gates with respect to the above-mentioned isomorphisms. The matrix tensor product implementation of the Spin(3n) group together with relevant models by usual quantum circuits with 2n qubits are investigated in such a framework. A certain resemblance with well-known sets of non-universal quantum gates (e.g., matchgates, noninteracting-fermion quantum circuits) related with Spin(2n) may be found in presented approach. Finally, a possibility of the classical simulation of such circuits in polynomial time is discussed.
Lie groups, and therefore Lie algebras, are fundamental structures in quantum physics that determine the space of possible trajectories of evolving systems. However, classification and characterization methods for these structures are often impractical for larger systems. In this work, we provide a comprehensive classification of Lie algebras generated by an arbitrary set of Pauli operators, from which an efficient method to characterize them follows. By mapping the problem to a graph setting, we identify a reduced set of equivalence classes: the free-fermionic Lie algebra, the set of all anti-symmetric Paulis on n qubits, the Lie algebra of symplectic Paulis on n qubits, and the space of all Pauli operators on n qubits, as well as controlled versions thereof. Moreover, out of these, we distinguish 6 Clifford inequivalent cases and find a simple set of canonical operators for each, which allow us to give a physical interpretation of the dynamics of each class. Our findings reveal a no-go result for the existence of small Lie algebras beyond the free-fermionic case in the Pauli setting and offer efficiently computable criteria for universality and extendibility of gate sets. These results bear significant impact in ideas in a number of fields like quantum control, quantum machine learning, or classical simulation of quantum circuits.
Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.
Quantum computing is fundamentally based on the mathematical structure of complex Hilbert spaces, linear operators, tensor products, and unitary transformations. Among these concepts, tensor products provide the formal mechanism for constructing the state space of composite quantum systems, whereas linear and unitary operators describe quantum transformations, measurements, and computational gates. This article examines the mathematical relationship between linear operators and tensor products and analyzes their role in the formation, manipulation, and characterization of quantum entanglement. Particular attention is given to two-qubit systems, separable and entangled states, Schmidt decomposition, controlled operations, and the role of non-factorizable operators in quantum circuits. The analysis demonstrates that tensor products perform a dual function: they provide the mathematical representation of composite systems and enable the construction of local operations acting on individual subsystems. At the same time, genuinely entangling transformations, such as the controlled-NOT operation, cannot in general be represented as a single tensor product of independent local operators. Recent research further demonstrates that tensor-product and operator-Schmidt decompositions can be used to characterize operator entanglement, reduce circuit complexity, and construct efficient representations of quantum processes. The results establish that linear algebra and tensor-product structures are not merely formal tools but constitute the mathematical foundation connecting quantum entanglement with quantum computation.