Related papers: Codes as fractals and noncommutative spaces
We outline a quantum convolutional coding technique for protecting a stream of classical bits and qubits. Our goal is to provide a framework for designing codes that approach the ``grandfather'' capacity of an entanglement-assisted quantum…
Noncommutative spacetimes are widely believed to model some properties of the quantum structure of spacetime at the Planck regime. In this contribution the construction of (anti-)de Sitter noncommutative spacetimes obtained through quantum…
We describe quantum and classical Hamiltonian dynamics in a common Hilbert space framework, that allows the treatment of mixed quantum-classical systems. The analysis of some examples illustrates the possibility of entanglement between…
Using concepts of geometric orthogonality and linear independence, we logically deduce the form of the Pauli spin matrices and the relationships between the three spatially orthogonal basis sets of the spin-1/2 system. Rather than a…
Associative division algebras are a rich source of fully diverse space-time block codes (STBCs). In this paper the systematic construction of fully diverse STBCs from nonassociative algebras is discussed. As examples, families of fully…
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…
Recent developments in quantum gravity have shown the Lorentzian treatment to be a fruitful approach towards the emergence of macroscopic spacetimes. In this paper, we discuss another related aspect of the Lorentzian treatment: we argue…
Long quantum codes using projective Reed-Muller codes are constructed. Projective Reed-Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum…
We introduce two new formulations for the notion of "quantum metric on noncommutative space". For a compact noncommutative space associated to a unital C*-algebra, our quantum metrics are elements of the spatial tensor product of the…
Viewing comodule algebras as the noncommutative analogues of affine varieties with affine group actions, we propose rudiments of a localization approach to nonaffine Hopf algebraic quotients of noncommutative affine varieties corresponding…
We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit…
In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring $\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangle$ where $p$ is an odd prime and $m \geq 1$. In order to…
We describe the theory of quantum convolutional error correcting codes. These codes are aimed at protecting a flow of quantum information over long distance communication. They are largely inspired by their classical analogs which are used…
Haah's cubic code is the prototypical type-II fracton topological order. It instantiates the no string-like operator property that underlies the favorable scaling of its code distance and logical energy barrier. Previously, the cubic code…
One particular approach to quantum groups (matrix pseudo groups) provides the Manin quantum plane. Assuming an appropriate set of non-commuting variables spanning linearly a representation space one is able to show that the endomorphisms on…
The rapid progress of computer technology has been accompanied by a corresponding evolution of software development, from hardwired components and binary machine code to high level programming languages, which allowed to master the…
Quantum integrable systems and their classical counterparts are considered. We show that the symplectic structure and invariant tori of the classical system can be deformed by a quantization parameter $\hbar$ to produce a new (classical)…
The challenge of quantum computing is to combine error resilience with universal computation. Diagonal gates such as the transversal $T$ gate play an important role in implementing a universal set of quantum operations. This paper…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
We introduce the notion of noncommutative complex spheres with partial commutation relations for the coordinates. We compute the corresponding quantum symmetry groups of these spheres, and this yields new quantum unitary groups with partial…