Related papers: Qutrit codes within representations of SU(3)
We consider irreducible representations of finite quandles over $\mathbb{C}$. For $Q$ a finite quandle whose inner automorphism group $Inn(Q)$ have trivial Schur multipliers, we prove that the irreducible representations of $Q$ can be…
In this article we give examples which show that the TQFT representations of the mapping class groups derived from quantum SU(N) for N>2 are generically decomposable. One general decomposition of the representations is induced by the…
In this paper we investigate the encoding of operator quantum error correcting codes i.e. subsystem codes. We show that encoding of subsystem codes can be reduced to encoding of a related stabilizer code making it possible to use all the…
A permutationally invariant n-bit code for quantum error correction can be realized as a subspace stabilized by the non-Abelian group S_n. The code corresponds to bases for the trivial representation, and all other irreducible…
We show that the Lorentz and the SU(3) groups can be derived from the covariance principle conserving a $Z_3$-graded three-form on a $Z_3$-graded cubic algebra representing quarks endowed with non-standard commutation laws.
We give the complete set of irreducible representations of U(SU(2))_q when q is a m-th root of unity. In particular we show that their dimensions are less or equal to m. Some of them are not highest weight representations.
We study the performance of quantum error correction codes (QECCs) under the detection-induced coherent error due to the imperfectness of practical implementations of stabilizer measurements, after running a quantum circuit. Considering the…
The physical symmetries of a system play a central role in quantum error correction. In this work we encode a qubit in a collection of systems with angular-momentum symmetry (spins), extending the tools developed in Phys. Rev. Lett. 127,…
We develop simple computational techniques for constructing all possible SU(3) representations in terms of irreducible SU(3) Schwinger bosons. We show that these irreducible Schwinger oscillators make SU(3) representation theory as simple…
We present a general framework of quantum error-correcting codes (QECCs) as a subspace of a complex Hilbert space and the corresponding error models. Then we illustrate how QECCs can be constructed using techniques from algebraic coding…
Quantum information processing in the presence of continuous symmetry is of wide importance and exhibits many novel physical and mathematical phenomena. SU(d) is a continuous group of particular interest since it represents a fundamental…
Dynamical decoupling is a long-established and effective way to suppress unwanted interactions in qubit systems, enabling advances in fields ranging from quantum metrology to quantum computing. For general qudit systems, however, comparable…
Spin ensembles are promising quantum technological platforms, but their utility relies on the ability to perform quantum error correction (QEC) for the specific decoherence in these systems. Typical QEC for ensembles requires addressing…
This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…
We study scattering of particles which obey an $SU(N)$ global symmetry through the lens of quantum computation and quantum algorithms. We show that for scattering between particles which transform in the fundamental or anti-fundamental…
We obtain an explicit characterization of linear maps, in particular, quantum channels, which are covariant with respect to an irreducible representation ($U$) of a finite group ($G$), whenever $U \otimes U^c$ is simply reducible (with…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
The AND gate is not reversible$\unicode{x2014}$on qubits. However, it is reversible on qutrits, making it a building block for efficient simulation of qubit computation using qutrits. We first observe that there are multiple two-qutrit…
How can we use a quantum computer to detect the entanglement structure of a quantum state? Bouland et al. (2024) recently provided an algorithm that, given multiple input copies of the state, finds the "hidden cuts"-partitions into fully…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…