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...
An economy of scale is found when storing many qubits in one highly entangled block of a topological...
We consider a notion of relative homology (and cohomology) for surfaces with two types of boundaries...
Quantum computation has shown advantages in several problems over the corresponding classical algor...
We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give ...
International audienceWe show how a hyperbolic surface code could be used for overhead-efficient qua...
We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give...
International audienceWe show how a hyperbolic surface code could be used for overhead-efficient qua...
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear enc...
A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum compu...
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear enc...
International audienceThe family of hyperbolic surface codes is one of the rare families of quantum ...
Computer architectures which exploit quantum mechanical effects can solve computing tasks that are o...
International audienceThe family of hyperbolic surface codes is one of the rare families of quantum ...
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear enc...
International audienceThe family of hyperbolic surface codes is one of the rare families of quantum ...
An economy of scale is found when storing many qubits in one highly entangled block of a topological...
We consider a notion of relative homology (and cohomology) for surfaces with two types of boundaries...
Quantum computation has shown advantages in several problems over the corresponding classical algor...
We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give ...
International audienceWe show how a hyperbolic surface code could be used for overhead-efficient qua...
We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give...
International audienceWe show how a hyperbolic surface code could be used for overhead-efficient qua...
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear enc...
A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum compu...
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear enc...
International audienceThe family of hyperbolic surface codes is one of the rare families of quantum ...
Computer architectures which exploit quantum mechanical effects can solve computing tasks that are o...
International audienceThe family of hyperbolic surface codes is one of the rare families of quantum ...
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear enc...
International audienceThe family of hyperbolic surface codes is one of the rare families of quantum ...
An economy of scale is found when storing many qubits in one highly entangled block of a topological...
We consider a notion of relative homology (and cohomology) for surfaces with two types of boundaries...
Quantum computation has shown advantages in several problems over the corresponding classical algor...