We construct a double-toric surface code by exploiting the planar tessellation using a rhombus-shaped tile. With n data qubits, we are able to encode at least n/3 logical qubits or quantum memories. By a suitable arrangement of the tiles, the code achieves larger distances, leading to significant error-correcting capability. We demonstrate the robustness of the logical qubits thus obtained in the presence of external noise. We believe that the optimality of the code presented here will pave the way for design of efficient scalable architectures.
We construct a double-toric surface code by exploiting the planar tessellation using a rhombus-shaped tile. With n data qubits, we are able to encode at least n/3 logical qubits or quantum memories. By a suitable arrangement of the tiles, the code achieves larger distances, leading to significant error-correcting capability. We demonstrate the robustness of the logical qubits thus obtained in the presence of external noise. We believe that the optimality of the code presented here will pave the way for design of efficient scalable architectures.
The surface code is a leading candidate quantum error correcting code, owing to its high threshold, and compatibility with existing experimental architectures. Bravyi et al. (2006) showed that encoding a state in the surface code using local unitary operations requires time at least linear in the lattice size L , however the most efficient known method for encoding an unknown state, introduced by Dennis et al. (2002), has O(L2) time complexity. Here, we present an optimal local unitary encoding circuit for the planar surface code that uses exactly 2L time steps to encode an unknown state in a distance L planar code. We further show how an O(L) complexity local unitary encoder for the toric code can be found by enforcing locality in the O(logL) -depth non-local renormalisation encoder. We relate these techniques by providing an O(L) local unitary circuit to convert between a toric code and a planar code, and also provide optimal encoders for the rectangular, rotated and 3D surface codes. Furthermore, we show how our encoding circuit for the planar code can be used to prepare fermionic states in the compact mapping, a recently introduced fermion to qubit mapping that has a stabiliser structure similar to that of the surface code and is particularly efficient for simulating the Fermi-Hubbard model.
Ever since the birth of the first quantum error correcting code, many error correcting techniques and formalism has been constructed so far. Among those, generating a quantum code on a locally planar geometry have lead to some interesting classes of codes. Main idea of this thesis stems from Kitaev's Toric code, which was the first surface code, yet it suffered from having a asymptotically vanishing encoding rate. In this paper, we propose a quantum surface code on a more complicated closed surface which has large genus, namely the Hurwitz surface. This code admits a constant encoding rate in the asymptotic limit that the number of genus goes to infinity. However, we give evidence that t/n, where n is the number of qubits and t is the number of correctible errors, converges to 0 asymptotically. This is based on numerically generating many Hurwitz surfaces and observing the corresponding quantum code in the limit that genus number goes to infinity.
Abstract In recent years, surface codes have become a leading method for quantum error correction in theoretical large-scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural two-dimensional nearest-neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect-based codes. Planar codes require fewer qubits to implement (for the same strength of error correction), but are restricted to encoding a single qubit of information. Interactions between encoded qubits are achieved via transversal operations, thus destroying the inherent 2DNN nature of the code. In this paper we introduce a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer. Our lattice surgery technique comprises splitting and merging planar code surfaces, and enables us to perform universal quantum computation (including magic state injection) while removing the need for braided logic in a strictly 2DNN design, and hence reduces the overall qubit resources for logic operations. Those resources are further reduced by the use of a rotated lattice for the planar encoding. We show how lattice surgery allows us to distribute encoded GHZ states in a more direct (and overhead friendly) manner, and how a demonstration of an encoded CNOT between two distance-3 logical states is possible with 53 physical qubits, half of that required in any other known construction in 2D.
Realizing practical quantum computers requires quantum error correction, but the most widely implemented approach, the planar surface code, demands a substantial physical qubit overhead. Here, we demonstrate that partitioning quantum processors into manageable, flat modules with non-local inter-module connections provides a natural solution. By wiring sparse, static boundary connections between Euclidean planar modules, we construct modular hyperbolic surface and color codes, based on new families of semi-hyperbolic codes. Using modular syndrome extraction circuits and efficient neural network and matching decoders, our circuit-level simulations show that this modular memory design can reduce the physical qubit overhead by tenfold or more compared to the surface code, even under elevated inter-module seam error rates. Projecting to larger system sizes, we find modular codes with encoding rate k/n=1/16 and distance d≥22, exceeding both the rate and distance of the [[288,12,18]] two-gross bivariate bicycle code while using mostly nearest-neighbor gates within planar modules, and implying an over 30× overhead reduction relative to surface codes. We develop fault-tolerant walking circuits for implementing logic via code automorphisms, which we co-design with low-weight, highly symmetrical logical bases and a modular extractor system that is ≈4.5× smaller than the code itself. Combining these methods, our modular memory can be used as dense storage in a universal fault-tolerant architecture, unlocking the efficiency of high-rate codes without sacrificing the fabrication advantages of planar modules.
While planar toric codes provide fault tolerant quantum memory on flat two dimensional surfaces, mycelial networks naturally grow in hyperbolic three dimensional architectures with negative curvature. We extend bio topological quantum memory theory to hyperbolic surface codes, demonstrating four critical advantages. First, exponentially increased stabiliser to qubit ratios emerge from hyperbolic growth geometry. Second, code distances scale as exponential functions of radius rather than linear functions seen in planar codes. Third, error thresholds exceed two per cent compared to approximately one per cent for toric codes. Fourth, natural fault tolerance arises through geometric redundancy inherent to hyperbolic tessellations. Mycelial networks in Basidiomycota exhibit hyperbolic branching patterns that map directly to hyperbolic tessellations such as seven triangle and eight triangle tilings. Physical qubits encoded at junction points form logical qubits protected by genus g surface codes, where network topology determines code parameters. We calculate threshold improvements for code distances three, five, and seven in hyperbolic geometries and demonstrate thermodynamic syndrome extraction remains viable despite increased connectivity. This framework suggests room temperature quantum computing may achieve superior error correction by exploiting biological hyperbolic geometries rather than engineered planar architectures. Combined with recent experimental validation of mycelial bioelectronics at ambient temperatures, hyperbolic codes may provide the geometric advantage necessary to cross error correction thresholds that remain inaccessible to planar implementations.
We show how to obtain concrete constructions of homological quantum codes based on tilings of 2-D surfaces with constant negative curvature (hyperbolic surfaces). This construction results in 2-D quantum codes whose tradeoff of encoding rate versus protection is more favorable than for the surface code. These surface codes would require variable length connections between qubits, as determined by the hyperbolic geometry. We provide numerical estimates of the value of the noise threshold and logical error probability of these codes against independent X or Z noise, assuming noise-free error correction.