Related papers: No invariant perfect qubit codes
Invariant tensors play an important role in gauge theories, for example, in dualities of N=1 gauge theories. However, for theories with fields in representations larger than the fundamental, the full set of invariant tensors is often…
Quantum entanglement and its paradoxical properties hold the key to an information processing revolution. Much attention has focused recently on the challenging problem of characterizing entanglement. Entanglement for a two qubit system is…
We consider a universal set of quantum gates encoded within a perturbed decoherence-free subspace of four physical qubits. Using second-order perturbation theory and a measuring device modeled by an infinite set of harmonic oscillators,…
4x4x3 absolutely nonsingular tensors are characterized by their determinant polynomial. Non-quivalence among absolutely nonsingular tensors with respect to a class of linear transformations, which do not chage the tensor rank,is studied. It…
The invariant theory of Killing tensors (ITKT) is extended by introducing the new concepts of covariants and joint invariants of (product) vector spaces of Killing tensors defined in pseudo-Riemannian spaces of constant curvature. The…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…
Identifying stabilizer codes that admit fault-tolerant implementations of the full logical Clifford group would significantly advance fault-tolerant quantum computation. Motivated by this goal, we study several classes of fault-tolerant…
Coherence, treated as a resource in quantum information theory, is a basis-dependent quantity. Looking for states that have constant coherence under canonical changes of basis yields highly symmetric structures in state space. For the case…
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…
Packaged quantum states are gauge-invariant states in which all internal quantum numbers (IQNs) form an inseparable block. This feature gives rise to novel packaged entanglements that encompass all IQNs, which is important both for…
In this work, we are interested in characterizing typical (generic) dimensional properties of invariant measures associated with the full-shift system, $T$, in a product space whose alphabet is a perfect and separable metric space (thus,…
We study the semiclassical limit of a class of invariant tensors for infinite-dimensional unitary representations of $\mathrm{SL}(2,\mathbb{C})$ of the principal series, corresponding to generalized Clebsch-Gordan coefficients with $n\geq3$…
It is widely believed that consistent theories of quantum gravity satisfy two basic kinematic constraints: they are free from any global symmetry, and they contain a complete spectrum of gauge charges. For compact, abelian gauge groups,…
We propose a new approach to the geometry of the four-qubit entanglement classes depending on parameters. More precisely, we use invariant theory and algebraic geometry to describe various stratifications of the Hilbert space by SLOCC…
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
It has been suggested that non-invertible symmetry protected topological phases (SPT), due to the lack of a stacking structure, do not have symmetric entanglers (globally symmetric finite-depth quantum circuits) connecting them. Using…
A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems. When each subsystem is a complex…
How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…
Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties.For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear…