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:1411.7311

The structure of superqubit states

L. Borsten, Kamil Brádler, M. J. Duff

Published Nov 26, 2014• 5 citations
arXivHTMLPDF

Abstract

Superqubits provide a supersymmetric generalisation of the conventional qubit in quantum information theory. After a review of their current status, we address the problem of generating entangled states. We introduce the global unitary supergroup $\text{UOSp}((3^n+1)/2 | (3^n-1)/2)$ for an $n$-superqubit system, which contains as a subgroup the local unitary supergroup $[\text{UOSp}(2|1)]^n$. While for $4>n>1$ the bosonic subgroup in $\text{UOSp}((3^n+1)/2 | (3^n-1)/2)$ does not contain the standard global unitary group $\text{SU}(2^n)$, it does have an $\text{USp}(2^n)\subset\text{SU}(2^n)$ subgroup which acts transitively on the $n$-qubit subspace, as required for consistency with the conventional multi-qubit framework. For two superqubits the $\text{UOSp}(5|4)$ action is used to generate entangled states from the "bosonic" separable state $|00\rangle$.

DOI
10.48550/arxiv.1411.7311

Related papers

Generating entangled superqubit states

L. Borsten, Kamil Brádler, M. J. Duff

We introduce the global unitary supergroup $\text{UOSp}((3^n+1)/2 | (3^n-1)/2)$ for an $n$-superqubit system, which contains as a subgroup the local unitary supergroup $[\text{UOSp}(2|1)]^n$. While for $4>n>1$ the subgroup in $\text{UOSp}((3^n+1)/2 | (3^n-1)/2)$ does not contain the standard global unitary group $\text{SU}(2^n)$, it does have an $\text{USp}(2^n)\subset\text{SU}(2^n)$ subgroup which acts transitively on the $n$-qubit subspace, as required for consistency with the conventional multi-qubit framework. For two superqubits the $\text{UOSp}(5|4)$ action is used to generate entangled states from the bosonic separable state $|00>$.

arXiv:1411.7311?context=math.RT•Nov 26, 2014•0 citations

Superqubits

L. Borsten, D. Dahanayake, M. J. Duff +1 more

We provide a supersymmetric generalization of $n$ quantum bits by extending the local operations and classical communication entanglement equivalence group $[SU(2){]}^{n}$ to the supergroup $[uOSp(1|2){]}^{n}$ and the stochastic local operations and classical communication equivalence group $[SL(2,\mathbb{C}){]}^{n}$ to the supergroup $[OSp(1|2){]}^{n}$. We introduce the appropriate supersymmetric generalizations of the conventional entanglement measures for the cases of $n=2$ and $n=3$. In particular, super-Greenberger-Horne-Zeilinger states are characterized by a nonvanishing superhyperdeterminant.

arXiv:0908.0706•Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields•May 24, 2010•35 citations

On the super quantum information

Abdeslem Khemakhmia, N. Mebarki

Abstract A superqubit is a three dimensional super vector belonging to uOSP(1/2) super group. And considered as a super symmetric generalized qubit. To see how superqubits properties can be exploited in the field of the quantum computing, we propose some algorithms in order to perform the super teleportation. implementation and technologies. Using superqubit circuits will be an open field of research.

Journal of Physics Conference Series•Jan 1, 2021•2 citations

Unitary Operators Over Quantum Systems with Several Levels

Guillermo B. Morales-Luna

Abstract High-dimensional quantum states generalise multi-valued logics. The analogous of Pauli transformations acting on these quantum states determine a subgroup structure in U(n), which acts over the maximally entangled Bell states. These properties are suitable to produce superdense coding communication protocols.

Journal of Physics Conference Series•Apr 1, 2020•0 citations

Entanglement groups

Xiaole Jiang, Daniel Kabat, Gilad Lifschytz +1 more

We propose to define entanglement in terms of local unitary transformations acting on some parts of a system that can be undone by local unitary transformations acting on other parts. This leads to a characterization of entanglement in terms of groups. We refer to these as entanglement groups, and we refer to this notion as g -entanglement. We discuss the physical meaning of entanglement groups and contrast g -entanglement with other, more conventional definitions of entanglement. For pure states, entanglement groups are constructed as certain quotients of the stabilizer group and its subgroups. For mixed states, entanglement groups can be constructed from stabilizers of the purification. We analyze the structure of entanglement groups, show that they have properties which correspond to monogamy of entanglement, and explore the restrictions placed by separability. We show that g -entanglement underlies several well-known quantum tasks.

arXiv:2307.06437•Annals of Physics•Jul 17, 2026•1 citation

Generalized Clifford groups and simulation of associated quantum circuits

Stephen R. L. Clark, Richard Jozsa, Noah Linden

Quantum computations starting with computational basis states and involving only Clifford operations, are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the theorem and provide generalisations of some of them with the aim of identifying new classes of simulable quantum computations. In the usual construction, Clifford operations arise as projective normalisers of the first and second tensor powers of the Pauli group. We consider replacing the Pauli group by an arbitrary finite subgroup $G$ of $U(d)$. In particular we seek $G$ such that $G\otimes G$ has an entangling normaliser. Via a generalisation of the Gottesman-Knill theorem the resulting normalisers lead to classes of quantum circuits that can be classically efficiently simulated. For the qubit case $d = 2$ we exhaustively treat all finite irreducible subgroups of $U(2)$ and find that the only ones (up to unitary equivalence and trivial phase extensions) with entangling normalisers are the groups generated by X and the $n^{\rm th}$ root of $Z$ for $n \in \N$.

arXiv:quant-ph/0701103•Quantum Information and Computation•Jan 1, 2008•29 citations
Superqubits provide a supersymmetric generalisation of the conventional qubit in quantum information theory. After a review of their current status, we address the problem of generating entangled states. We introduce the global unitary supergroup UOSp((3n+1)/2∣(3n−1)/2)\text{UOSp}((3^n+1)/2 | (3^n-1)/2)UOSp((3n+1)/2∣(3n−1)/2) for an nnn-superqubit system, which contains as a subgroup the local unitary supergroup [UOSp(2∣1)]n[\text{UOSp}(2|1)]^n[UOSp(2∣1)]n. While for 4>n>14>n>14>n>1 the bosonic subgroup in UOSp((3n+1)/2∣(3n−1)/2)\text{UOSp}((3^n+1)/2 | (3^n-1)/2)UOSp((3n+1)/2∣(3n−1)/2) does not contain the standard global unitary group SU(2n)\text{SU}(2^n)SU(2n), it does have an USp(2n)⊂SU(2n)\text{USp}(2^n)\subset\text{SU}(2^n)USp(2n)⊂SU(2n) subgroup which acts transitively on the nnn-qubit subspace, as required for consistency with the conventional multi-qubit framework. For two superqubits the UOSp(5∣4)\text{UOSp}(5|4)UOSp(5∣4) action is used to generate entangled states from the "bosonic" separable state ∣00⟩|00\rangle∣00⟩.
We introduce the global unitary supergroup UOSp((3n+1)/2∣(3n−1)/2)\text{UOSp}((3^n+1)/2 | (3^n-1)/2)UOSp((3n+1)/2∣(3n−1)/2) for an nnn-superqubit system, which contains as a subgroup the local unitary supergroup [UOSp(2∣1)]n[\text{UOSp}(2|1)]^n[UOSp(2∣1)]n. While for 4>n>14>n>14>n>1 the subgroup in UOSp((3n+1)/2∣(3n−1)/2)\text{UOSp}((3^n+1)/2 | (3^n-1)/2)UOSp((3n+1)/2∣(3n−1)/2) does not contain the standard global unitary group SU(2n)\text{SU}(2^n)SU(2n), it does have an USp(2n)⊂SU(2n)\text{USp}(2^n)\subset\text{SU}(2^n)USp(2n)⊂SU(2n) subgroup which acts transitively on the nnn-qubit subspace, as required for consistency with the conventional multi-qubit framework. For two superqubits the UOSp(5∣4)\text{UOSp}(5|4)UOSp(5∣4) action is used to generate entangled states from the bosonic separable state ∣00>|00>∣00>.
We provide a supersymmetric generalization of nnn quantum bits by extending the local operations and classical communication entanglement equivalence group [SU(2)]n[SU(2){]}^{n}[SU(2)]n to the supergroup [uOSp(1∣2)]n[uOSp(1|2){]}^{n}[uOSp(1∣2)]n and the stochastic local operations and classical communication equivalence group [SL(2,C)]n[SL(2,\mathbb{C}){]}^{n}[SL(2,C)]n to the supergroup [OSp(1∣2)]n[OSp(1|2){]}^{n}[OSp(1∣2)]n. We introduce the appropriate supersymmetric generalizations of the conventional entanglement measures for the cases of n=2n=2n=2 and n=3n=3n=3. In particular, super-Greenberger-Horne-Zeilinger states are characterized by a nonvanishing superhyperdeterminant.
We propose to define entanglement in terms of local unitary transformations acting on some parts of a system that can be undone by local unitary transformations acting on other parts. This leads to a characterization of entanglement in terms of groups. We refer to these as entanglement groups, and we refer to this notion as g -entanglement. We discuss the physical meaning of entanglement groups and contrast g -entanglement with other, more conventional definitions of entanglement. For pure states, entanglement groups are constructed as certain quotients of the stabilizer group and its subgroups. For mixed states, entanglement groups can be constructed from stabilizers of the purification. We analyze the structure of entanglement groups, show that they have properties which correspond to monogamy of entanglement, and explore the restrictions placed by separability. We show that g -entanglement underlies several well-known quantum tasks.
Quantum computations starting with computational basis states and involving only Clifford operations, are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the theorem and provide generalisations of some of them with the aim of identifying new classes of simulable quantum computations. In the usual construction, Clifford operations arise as projective normalisers of the first and second tensor powers of the Pauli group. We consider replacing the Pauli group by an arbitrary finite subgroup GGG of U(d)U(d)U(d). In particular we seek GGG such that G⊗GG\otimes GG⊗G has an entangling normaliser. Via a generalisation of the Gottesman-Knill theorem the resulting normalisers lead to classes of quantum circuits that can be classically efficiently simulated. For the qubit case d=2d = 2d=2 we exhaustively treat all finite irreducible subgroups of U(2)U(2)U(2) and find that the only ones (up to unitary equivalence and trivial phase extensions) with entangling normalisers are the groups generated by X and the nthn^{\rm th}nth root of ZZZ for n∈Nn \in \Nn∈N.