Related papers: Quantum Codes from Toric Surfaces
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…
The construction of parametric curve and surface plays important role in computer aided geometric design (CAGD), computer aided design (CAD), and geometric modeling. In this paper, we define a new kind of blending functions associated with…
We compute quantum character varieties of arbitrary closed surfaces with boundaries and marked points. These are categorical invariants $\int_S\mathcal A$ of a surface $S$, determined by the choice of a braided tensor category $\mathcal A$,…
The ability to physically move qubits within a register allows the design of hardware-specific error-correction codes, which can achieve fault-tolerance while respecting other constraints. In particular, recent advancements have…
In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…
In this paper, we give an explicit form for the dual of the algebraic geometry code $C_e(a,b)$ defined on an Hirzebruch surface $\mathcal{H}_e$ and parametrized by the divisor $aS_e + bF_e$, where $a,b\in\mathbb{N}$ and $S_e$ and $F_e$…
In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat…
Quantum error correction is a cornerstone of reliable quantum computing, with surface codes emerging as a prominent method for protecting quantum information. Surface codes are efficient for Clifford gates but require magic state…
I present a fault-tolerant quantum computing method for 2D architectures that is particularly appealing for photonic qubits. It relies on a crossover of techniques from topological stabilizer codes and measurement based quantum computation.…
We study the fidelity of the surface code in the presence of correlated errors induced by the coupling of physical qubits to a bosonic environment. By mapping the time evolution of the system after one quantum error correction cycle onto a…
We introduce and explicit Calderbank-Shor-Steane (CSS) code construction that generalizes the Layer codes to $D=4,5$ dimensions. Much like its predecessor, the present construction is based on embedding quantum low-density parity check…
Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. Using ZX calculus, we represent QECC's in a form called a ZX diagram, consisting of a tensor network. In this paper, we present…
We describe a computationally-efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding minimal surface given its boundary (curve) in any hypercubic lattice of dimension $D>2$. We…
In a recent work, Bombin, Duclos-Cianci, and Poulin showed that every local translationally invariant 2D topological stabilizer code is locally equivalent to a finite number of copies of Kitaev's toric code. For 2D color codes, Delfosse…
We consider geometric methods of ``rotating" the toric code in higher dimensions to reduce the qubit count. These geometric methods can be used to prepare higher dimensional toric code states using single shot techniques, and in turn these…
In a previous paper, the author introduced a Z-structure in quantum cohomology defined by the K-theory and the Gamma class and showed that it is compatible with mirror symmetry for toric orbifolds. Applying the quantum Lefschetz principle…
To build a fault-tolerant quantum computer, it is necessary to implement a quantum error correcting code. Such codes rely on the ability to extract information about the quantum error syndrome while not destroying the quantum information…
In this paper, we propose a novel message-passing decoding approach that leverages the degeneracy of quantum low-density parity-check codes to enhance decoding performance, eliminating the need for serial scheduling or post-processing. Our…
Quantum error correction is a key ingredient for large scale quantum computation, protecting logical information from physical noise by encoding it into many physical qubits. Topological stabilizer codes are particularly appealing due to…
A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is $2^\nu$ for a positive integer $\nu$, then one can construct a Calderbank-Shor-Steane (CSS) code, where…