We describe a computationally efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding a minimal surface given its boundary (curve) in any hypercubic lattice of dimension D > 2. We use this algorithm to correct errors occurring in a four-dimensional variant of the toric code, having open as opposed to periodic boundaries. For a phenomenological error model which includes measurement errors we use a five-dimensional version of our algorithm, achieving a threshold of 4.35?0.1%. For this error model, this is the highest known threshold of any topological code. Without measurement errors, a four-dimensional version of our algorithm can be used and we find a threshold of 7.3?0.1%. For the gate-based depolarizing error model we find a threshold of 0.31?0.01% which is below the threshold found for the twodimensional toric code.@en

We explore a distance-3 homological CSS quantum code, namely the small stellated dodecahedron code, for dense storage of quantum information and we compare its performance with the distance-3 surface code. The data and ancilla qubits of the small stellated dodecahedron code can be located on the edges respectively vertices of a small stellated dodecahedron, making this code suitable for threedimensional connectivity. This code encodes eight logical qubits into 30 physical qubits (plus 22 ancilla qubits for parity checkmeasurements) in contrast with one logical qubit into nine physical qubits (plus eight ancilla qubits) for the surface code. We develop faulttolerant parity check circuits and a decoder for this code, allowing us to numerically assess the circuitbased pseudo-threshold. This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'.@en

The circuit-to-Hamiltonian construction translates dynamics (a quantum circuit and its output) into statics (the groundstate of a circuit Hamiltonian) by explicitly defining a quantum register for a clock. The standard Feynman-Kitaev construction uses one global clock for all qubits while we consider a different construction in which a clock is assigned to each interacting qubit. This makes it possible to capture the spatio-temporal structure of the original quantum circuit into features of the circuit Hamiltonian. The construction is inspired by the original two-dimensional interacting fermion model in Mizel etal (2001 Phys. Rev. A 63 040302). We prove that for one-dimensional quantum circuits the gap of the circuit Hamiltonian is appropriately lowerbounded so that the applications of this construction for quantum Merlin-Arthur (and partially for quantum adiabatic computation) go through. For one-dimensional quantum circuits, the dynamics generated by the circuit Hamiltonian corresponds to the diffusion of a string around the torus.@en

The circuit-to-Hamiltonian construction translates dynamics (a quantum circuit and its output) into statics (the groundstate of a circuit Hamiltonian) by explicitly defining a quantum register for a clock. The standard Feynman-Kitaev construction uses one global clock for all qubits while we consider a different construction in which a clock is assigned to each interacting qubit. This makes it possible to capture the spatio-temporal structure of the original quantum circuit into features of the circuit Hamiltonian. The construction is inspired by the original two-dimensional interacting fermion model in Mizel etal (2001 Phys. Rev. A 63 040302). We prove that for one-dimensional quantum circuits the gap of the circuit Hamiltonian is appropriately lowerbounded so that the applications of this construction for quantum Merlin-Arthur (and partially for quantum adiabatic computation) go through. For one-dimensional quantum circuits, the dynamics generated by the circuit Hamiltonian corresponds to the diffusion of a string around the torus.@en

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.@en

We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3%for the {4, 5}-hyperbolic surface code in a phenomenological noise model (as compared with 2.9% for the toric code). In this code family, parity checks are of weight 4 and 5, while each qubit participates in four different parity checks. We introduce a family of semi-hyperbolic codes that interpolate between the toric code and the {4, 5}-hyperbolic surface code in terms of encoding rate and threshold. We show how these hyperbolic codes outperform the toric code in terms of qubit overhead for a target logical error probability. We show how Dehn twists and lattice code surgery can be used to read and write individual qubits to this quantum storage medium.@en

We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3%for the {4, 5}-hyperbolic surface code in a phenomenological noise model (as compared with 2.9% for the toric code). In this code family, parity checks are of weight 4 and 5, while each qubit participates in four different parity checks. We introduce a family of semi-hyperbolic codes that interpolate between the toric code and the {4, 5}-hyperbolic surface code in terms of encoding rate and threshold. We show how these hyperbolic codes outperform the toric code in terms of qubit overhead for a target logical error probability. We show how Dehn twists and lattice code surgery can be used to read and write individual qubits to this quantum storage medium.@en

We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3%for the {4, 5}-hyperbolic surface code in a phenomenological noise model (as compared with 2.9% for the toric code). In this code family, parity checks are of weight 4 and 5, while each qubit participates in four different parity checks. We introduce a family of semi-hyperbolic codes that interpolate between the toric code and the {4, 5}-hyperbolic surface code in terms of encoding rate and threshold. We show how these hyperbolic codes outperform the toric code in terms of qubit overhead for a target logical error probability. We show how Dehn twists and lattice code surgery can be used to read and write individual qubits to this quantum storage medium.@en

We analyze the performance of decoders for the 2D and 4D toric code which are local by construction. The 2D decoder is a cellular automaton decoder formulated by Harrington [1] which explicitly has a finite speed of communication and computation. For a model of independent X and Z errors and faulty syndrome measurements with identical probability, we report a threshold of 0:133% for this Harrington decoder. We implement a decoder for the 4D toric code which is based on a decoder by Hastings [2]. Incorporating a method for handling faulty syndromes we estimate a threshold of 1:59% for the same noise model as in the 2D case. We compare the performance of this decoder with a decoder based on a 4D version of Toom’s cellular automaton rule as well as the decoding method suggested by Dennis et al. [3].@en