We analyze recently proposed formalisms which use nilpotent variables to describe and/or generalize qubits and notion of entanglement. There are two types of them distinguished by the commutativity and or anti-commutativity of basics variables. While nilpotent commuting variables suit the new description of the qubits and entanglement, the anticommuting do not, but they can be used to describe generalized objects - superqubits. A squbit, in the present context, is a version of superqubit introduced to cure some of problematic properties of the superqubit.
Certain families of quantum mechanical models can be described and solved efficiently on a classical computer, including qubit or qudit Clifford circuits and stabilizer codes, free-boson or free-fermion models, and certain rotor and GKP codes. We show that all of these families can be described as instances of the same algebraic structure, namely quadratic functions over abelian groups, or more generally over (super) Hopf algebras. Different kinds of degrees of freedom correspond to different "elementary" abelian groups or Hopf algebras:
Z2 for qubits,
Zd for qudits,
R for continuous variables, both
Z and
R/Z for rotors, and a super Hopf algebra
F for fermionic modes. Objects such as states, operators, superoperators, or projection-operator valued measures, etc, are tensors. For the solvable models above, these tensors are quadratic tensors based on quadratic functions. Quadratic tensors with
n degrees of freedom are fully specified by only
O(n2) coefficients. Tensor networks of quadratic tensors can be contracted efficiently on the level of these coefficients, using an operation reminiscent of the Schur complement. Our formalism naturally includes models with mixed degrees of freedom, such as qudits of different dimensions. We also use quadratic functions to define generalized stabilizer codes and Clifford gates for arbitrary abelian groups. Finally, we give a generalization from quadratic (or 2nd order) to
ith order tensors, which are specified by
O(ni) coefficients but cannot be contracted efficiently in general.
In this chapter, we first reconsider the mathematical background of superqubit theory and describe important peculiarities of superspaces and supermatrices which are usually out of attention. Then we study states in super Hilbert spaces using super-bra/super-ket formalism in details. The qubit (qudit) and superqubit (superqudit) are defined as linear spans in the corresponding Hilbert subspaces. A new kind of superqubit carring the odd parity is introduced. The multi-superqubit states are studied, and the superconcurrence which distinguishes separable states is proposed. The connection of concurrence and cross product of qutrits is outlined.
Conventional computing based on classical technologies is approaching its limits. Therefore scientists are starting to consider the applications of quantum mechanics as a means for constructing more powerful computers. After proposing theoretical methods, many experimental setups have been designed to achieve quantum computing in reality. This thesis gives some background information on the subject of quantum computing. We first review the concept of quantum entanglement, which plays a key role in quantum computing, and then we discuss the physics of the SQUIDs-cavity method proposed by Yang et al., and give the definitions of quantum gates which are the elements that are needed to construct quantum circuits. Finally we give an overview of recent developments of SQUIDs-cavity systems and quantum circuits after Yang et al.'s proposal in 2003. These new developments help to take a step towards the constructions of higher levels of quantum technologies, e.g. quantum algorithms and quantum circuits.
We construct a two-parameter family of single-error-correcting seven-ququart codes with transversal
A7~ symmetry, realizing the finite component of a two-qubit super-golden gate set. These
((7,4,3))4 codes encode two logical qubits and support non-Clifford operations by applying the same gate to each physical ququart.
Our method constructs invariant parent states rather than searching directly for a codespace. For
n systems of local dimension
q, suppose the local symmetry is a unitary
t-group and the permutation symmetry is
t-transitive. Maximal mixing of all marginals on at most
t sites is then equivalent to linear equations in Schur--Weyl sector weights. Every feasible solution yields parents of pure distance at least
t+1; puncturing one site produces a
q-dimensional code of distance at least
t with the prescribed local symmetry acting transversally.
Steane and the nonstabilizer Fake Steane code reveal why the construction leaves continuous freedom. They share the same prescribed transversal Clifford and permutation symmetries, and their eight-qubit purifications lie on a circle: error correction fixes two invariant-sector norms but leaves the relative phase free. Keeping the same permutation group and replacing Clifford symmetry by
A7~ ≤SU(4) gives three fixed sector norms and two free relative phases, producing the new ququart family.