Related papers: The XYZ$^2$ hexagonal stabilizer code
Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabiliser code, synthesises a novel Floquet code that only uses…
Logical qubits can be protected against environmental noise by encoding them into a highly entangled state of many physical qubits and actively intervening in the dynamics with stabilizer measurements. In this work, we numerically optimize…
We present a fault-tolerant mapping of rotated surface codes onto a $2\times N$ silicon spin-qubit railway architecture, utilizing electron shuttling to resolve the wiring fan-out bottleneck. Employing circuit-level noise modeling, we…
Local decoders provide a promising approach to real-time quantum error-correction by replacing centralized classical decoding, with significant hardware constraints, by a fully distributed architecture based on a simple, local update rule.…
When storing encoded qubits, if single faults can be corrected and double faults postselected against, logical errors only occur due to at least three faults. At current noise rates, having to restart when two errors are detected prevents…
We formally define homological quantum rotor codes which use multiple quantum rotors to encode logical information. These codes generalize homological or CSS quantum codes for qubits or qudits, as well as linear oscillator codes which…
Using first-principles plane wave calculations, we investigate two dimensional honeycomb structure of Group IV elements and their binary compounds, as well as the compounds of Group III-V elements. Based on structure optimization and phonon…
We report on band structure calculations and a microscopic model of the low-dimensional magnet beta-Cu2V2O7. Magnetic properties of this compound can be described by a spin-1/2 anisotropic honeycomb lattice model with the averaged coupling…
Many $q$-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal $q^2$-ary linear codes. This result can be generalized to $q^{2 m}$-ary linear codes, $m > 1$. We give a result for easily obtaining quantum codes from…
We have explored the hidden symmetries of a generic four-parameter nearest-neighbor spin model, allowed in honeycomb lattice compounds under trigonal compression. Our method utilizes a systematic algorithm to identify all dual…
Kitaev's toric code is an exactly solvable model with $\mathbb{Z}_2$-topological order, which has potential applications in quantum computation and error correction. However, a direct experimental realization remains an open challenge.…
A high-frequency asymptotic scheme is generated that captures the motion of waves within discrete hexagonal and honeycomb lattices by creating continuum homogenised equations. The accuracy of these effective medium equations in describing…
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be represented by graphical models which possess a structure…
We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of qubits, a threshold error rate approaching 1%,…
Three-dimensional (3D) quantum XYZ product can construct a class of non-CSS quantum codes by using three classical codes. However, there has been limited study on their error-correcting performance so far and whether this code construction…
In this paper, I present a way to compile the surface code into two-body parity measurements ("pair measurements"), where the pair measurements run along the edges of a Cairo pentagonal tiling. The resulting circuit improves on prior work…
Function-correcting codes are a coding framework designed to minimize redundancy while ensuring that specific functions or computations of encoded data can be reliably recovered, even in the presence of errors. The choice of metric is…
Fault-tolerant quantum computing is crucial for realizing large-scale quantum computation, and the interplay between hardware architecture and quantum error-correcting codes is a key consideration. We present a comparative study of two…
In quantum error-correcting code (QECC), many quantum operations and measurements are necessary to correct errors in logical qubits. In the stabilizer formalism, which is widely used in QECC, generators $G_i (i=1,2,..)$ consist of multiples…
We study the existence and stability of multisite discrete breathers in two prototypical non-square Klein-Gordon lattices, namely a honeycomb and a hexagonal one. In the honeycomb case we consider six-site configurations and find that for…