Related papers: Qudit surface codes and hypermap codes
We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the $p$-faces of the $n$-cube (for $n>p$) and stabilizer constraints with faces of dimension $(p\pm1)$. The quantum code obtained by identifying…
Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…
Recent attention has turned to exploring quantum information within larger Hilbert spaces by utilizing qudits, which offer increased information capacity and potential for robust quantum communications. While the efficient generation of…
Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…
Given a Calderbank-Shor-Steane (CSS) code, it is sometimes necessary to modify the code by adding an arbitrary number of physical qubits and parity checks. Motivations may include concatenating codes, embedding low-density parity check…
Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this…
Quantum computation architecture based on $d$-level systems, or qudits, has attracted considerable attention recently due to their enlarged Hilbert space. Extensive theoretical and experimental studies have addressed aspects of algorithms…
A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of…
We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding…
In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define…
Putman and Wieland conjectured that if $\tilde{\Sigma} \rightarrow \Sigma$ is a finite branched cover between closed oriented surfaces of sufficiently high genus, then the orbits of all nonzero elements of $H_1(\tilde{\Sigma};\mathbb{Q})$…
Practical applications of quantum computing depend on fault-tolerant devices with error correction. Today, the most promising approach is a class of error-correcting codes called surface codes. We study the problem of compiling quantum…
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…
The use of color in QR codes brings extra data capacity, but also inflicts tremendous challenges on the decoding process due to chromatic distortion, cross-channel color interference and illumination variation. Particularly, we further…
The codification in higher dimensional Hilbert Spaces (whose logical basis states are dubbed qudits in analogy with bidimensional qubits) presents various advantages both for Quantum Information applications and for studies on Foundations…
Quantum Max Cut (QMC) problem for systems of qubits is an example of a 2-local Hamiltonian problem, and a prominent paradigm in computational complexity theory. This paper investigates the algebraic structure of a higher-dimensional analog…
A family of quantum Hamiltonians is said to be universal if any other finite-dimensional Hamiltonian can be approximately encoded within the low-energy space of a Hamiltonian from that family. If the encoding is efficient, universal…
We introduce \emph{stratified colimit codes}: stabiliser codes obtained by taking the degree-wise colimit $\mathcal C_\bullet(X):=\operatorname*{colim}_{\sigma\in X}F(\sigma)$ of a functor $F\colon X\to\mathbf{Ch}(R)$ from a finite poset…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired…
We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…