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

Quantum Information Processing

Mapping qubit algebras to combinatorial designs

J. P. Marceaux, A. R. P. Rau

Published Dec 14, 2019• 4 citations
Publisher
DOI
10.1007/s11128-019-2541-x

Related papers

Quantum codes from finite geometry and combinatorial designs (Finite groups, vertex operator algebras and combinatorics)

Vladimir D. Tonchev

数理解析研究所講究録•Jul 1, 2009•1 citation

Symmetries and Geometries of Qubits, and Their Uses

A. R. P. Rau

The symmetry SU(2) and its geometric Bloch Sphere rendering have been successfully applied to the study of a single qubit (spin-1/2); however, the extension of such symmetries and geometries to multiple qubits—even just two—has been investigated far less, despite the centrality of such systems for quantum information processes. In the last two decades, two different approaches, with independent starting points and motivations, have been combined for this purpose. One approach has been to develop the unitary time evolution of two or more qubits in order to study quantum correlations; by exploiting the relevant Lie algebras and, especially, sub-algebras of the Hamiltonians involved, researchers have arrived at connections to finite projective geometries and combinatorial designs. Independently, geometers, by studying projective ring lines and associated finite geometries, have come to parallel conclusions. This review brings together the Lie-algebraic/group-representation perspective of quantum physics and the geometric–algebraic one, as well as their connections to complex quaternions. Altogether, this may be seen as further development of Felix Klein’s Erlangen Program for symmetries and geometries. In particular, the fifteen generators of the continuous SU(4) Lie group for two qubits can be placed in one-to-one correspondence with finite projective geometries, combinatorial Steiner designs, and finite quaternionic groups. The very different perspectives that we consider may provide further insight into quantum information problems. Extensions are considered for multiple qubits, as well as higher-spin or higher-dimensional qudits.

arXiv:2103.14105•Symmetry•Sep 18, 2021•10 citations

Combinatorial Optimization and Quantum Computers

Alexandre Gondran, Michel Gondran

•Feb 7, 2020•0 citations

Construction and Local Equivalence of Dual-Unitary Operators: From Dynamical Maps to Quantum Combinatorial Designs

Suhail Ahmad Rather, S. Aravinda, Arul Lakshminarayan

While quantum circuits built from two-particle dual-unitary (maximally entangled) operators serve as minimal models of typically nonintegrable many-body systems, the construction and characterization of dual-unitary operators themselves are only partially understood.A nonlinear map on the space of unitary operators has been proposed in Phys.Rev. Lett.125, 070501 (2020) that results in operators being arbitrarily close to dual unitaries.Here, we study the map analytically for the two-qubit case describing the basins of attraction, fixed points, and rates of approach to dual unitaries.A subset of dual-unitary operators having maximum entangling power are 2-unitary operators or perfect tensors and these are equivalent to four-party absolutely maximally entangled states.It is known that they only exist if the local dimension is larger than d = 2.We use the nonlinear map, and introduce stochastic variants of it, to construct explicit examples of new dual and 2-unitary operators.A necessary criterion for their local unitary equivalence to distinguish classes is also introduced and used to display various concrete results and a conjecture in d = 3.It is known that orthogonal Latin squares provide a "classical combinatorial design" for constructing permutations that are 2-unitary.We extend the underlying design from classical to genuine quantum ones for general dual-unitary operators and give an example of what might be the smallest-sized genuinely quantum design of a 2-unitary in d = 4.

arXiv:2205.08842•PRX Quantum•Dec 20, 2022•28 citations

Combinatorial Block Designs for Quantum Computing Problems.

Rūsiņš Freivalds, Elīna Kalniņa, Rihards Opmanis +1 more

FCS•Jan 1, 2005•0 citations

Some Combinatorial Problems in Quantum Computation

Xu Xu

河南广播电视大学学报•Jan 1, 2005•0 citations
The symmetry SU(2) and its geometric Bloch Sphere rendering have been successfully applied to the study of a single qubit (spin-1/2); however, the extension of such symmetries and geometries to multiple qubits—even just two—has been investigated far less, despite the centrality of such systems for quantum information processes. In the last two decades, two different approaches, with independent starting points and motivations, have been combined for this purpose. One approach has been to develop the unitary time evolution of two or more qubits in order to study quantum correlations; by exploiting the relevant Lie algebras and, especially, sub-algebras of the Hamiltonians involved, researchers have arrived at connections to finite projective geometries and combinatorial designs. Independently, geometers, by studying projective ring lines and associated finite geometries, have come to parallel conclusions. This review brings together the Lie-algebraic/group-representation perspective of quantum physics and the geometric–algebraic one, as well as their connections to complex quaternions. Altogether, this may be seen as further development of Felix Klein’s Erlangen Program for symmetries and geometries. In particular, the fifteen generators of the continuous SU(4) Lie group for two qubits can be placed in one-to-one correspondence with finite projective geometries, combinatorial Steiner designs, and finite quaternionic groups. The very different perspectives that we consider may provide further insight into quantum information problems. Extensions are considered for multiple qubits, as well as higher-spin or higher-dimensional qudits.
While quantum circuits built from two-particle dual-unitary (maximally entangled) operators serve as minimal models of typically nonintegrable many-body systems, the construction and characterization of dual-unitary operators themselves are only partially understood.A nonlinear map on the space of unitary operators has been proposed in Phys.Rev. Lett.125, 070501 (2020) that results in operators being arbitrarily close to dual unitaries.Here, we study the map analytically for the two-qubit case describing the basins of attraction, fixed points, and rates of approach to dual unitaries.A subset of dual-unitary operators having maximum entangling power are 2-unitary operators or perfect tensors and these are equivalent to four-party absolutely maximally entangled states.It is known that they only exist if the local dimension is larger than d = 2.We use the nonlinear map, and introduce stochastic variants of it, to construct explicit examples of new dual and 2-unitary operators.A necessary criterion for their local unitary equivalence to distinguish classes is also introduced and used to display various concrete results and a conjecture in d = 3.It is known that orthogonal Latin squares provide a "classical combinatorial design" for constructing permutations that are 2-unitary.We extend the underlying design from classical to genuine quantum ones for general dual-unitary operators and give an example of what might be the smallest-sized genuinely quantum design of a 2-unitary in d = 4.