Vivien Londe
email: vivien.londe@gmail.com

Anthony Leverrier
email: anthony.leverrier@inria.fr

GOLDEN CODES: QUANTUM LDPC CODES BUILT FROM REGULAR TESSELLATIONS OF HYPERBOLIC 4-MANIFOLDS

Keywords: quantum information, quantum error correction, homological quantum codes, hyperbolic geometry, arithmetic manifolds

We adapt a construction of Guth and Lubotzky [1] to obtain a family of quantum LDPC codes with non-vanishing rate and minimum distance scaling like n 0.1 where n is the number of physical qubits. Similarly as in Ref.

[1], our homological code family stems from hyperbolic 4-manifolds equipped with tessellations. The main novelty of this work is that we consider a regular tessellation consisting of hypercubes. We exploit this strong local structure to design and analyze an efficient decoding algorithm.

Introduction

Building a large-scale quantum computer is certainly one of the main challenges faced by the physics community in the 21th century. This turns out to be a daunting task because of the extreme fragility of quantum information: any uncontrolled interaction between the qubits and the environment leads to decoherence and quickly causes any computation to fail. Fortunately, theoretical solutions exist under the form of quantum error correcting codes which allow one to encode logical qubits into a larger number of physical qubits, in such a way that logical information can be preserved and recovered despite potential errors occurring on the physical qubits [START_REF] Peter | Scheme for reducing decoherence in quantum computer memory[END_REF][START_REF] Calderbank | Good quantum error-correcting codes exist[END_REF].

Mathematically, a quantum code of dimension k and length n is a subspace of (C 2 ) ⊗n of dimension 2 k . A possible way to specify such a subspace is via a stabilizer group: an Abelian subgroup of the n-qubit Pauli group. In that case, the quantum code is defined as the common eigenspace of the stabilizers with eigenvalue +1. Such a code is called a stabilizer code [START_REF] Gottesman | Stabilizer codes and quantum error correction[END_REF]. Among these, CSS codes, due to Calderbank, Shor and Steane, are those for which the stabilizer group admits a list of n -k generators which are either products of X-type Pauli operators, or of Z-type Pauli operators. A convenient way to find CSS codes, initiated by Kitaev [START_REF] Yu | Fault-tolerant quantum computation by anyons[END_REF], is to consider tessellations of manifolds. In that case, the physical qubits are associated with i-dimensional faces of the tessellation, the X-type stabilizers are associated with (i -1)-faces and the Z-type stabilizers with (i + 1)-faces. Such codes are called homological. The stabilizer group of a homological code is commutative as required because (i + 1)-faces, i-faces and (i -1)-faces form a chain complex. In other words, given an (i + 1)-face P, and an (i -1)-face Q, there is an even number of i-faces incident to both P and Q [START_REF] Bombin | Homological error correction: Classical and quantum codes[END_REF][START_REF] Zémor | On cayley graphs, surface codes, and the limits of homological coding for quantum error correction[END_REF][START_REF] Nikolas | Constructions and noise threshold of hyperbolic surface codes[END_REF].

A major advantage of homological codes with a fixed and compact local structure is that they are naturally of the low-density parity-check (LDPC) type, meaning that generators of the stabilizer group act nontrivially on a constant number of qubits and that each qubit is acted upon by a constant number of generators. This is of course especially interesting for potential implementations, but also at a more mathematical level since classical LDPC codes play a central role in classical coding theory. A second advantage of homological codes is that they can lead to simple and efficient decoding algorithms which directly exploit the local structure of the code on the manifold [START_REF] Dennis | Topological quantum memory[END_REF][START_REF] William | Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes[END_REF][START_REF] Delfosse | Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel[END_REF][START_REF] Delfosse | Almost-linear time decoding algorithm for topological codes[END_REF].

The parameters [[n, k, d]] of homological codes can be derived from the properties of the underlying manifold: the length n of the code is given by the number of i-faces in the tessellation, the dimension k is given by the rank of the i th homology group, and the minimum distance, that is the minimum weight of a nontrivial Pauli error, is related to the i th homological systole of the manifold, that is the minimal number of i-faces forming a homologically nontrivial i-cycle. Exploiting this connection with manifolds exhibiting systolic freedom, Freedman, Meyer and Luo [START_REF] Michael H Freedman | Z2-systolic freedom and quantum codes[END_REF] were able to construct the quantum LDPC codes with the best minimum distance presently known, achieving d = Θ(n 1/2 log 1/4 n) a .

An important question is to understand what parameters [[n, k, d]] can be achieved with quantum LDPC codes. The toric code and the code of Ref. [START_REF] Michael H Freedman | Z2-systolic freedom and quantum codes[END_REF] display a large minimum distance but only encode a constant number of qubits, k = O [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF]. If the manifold is Euclidean, strong constraints apply on the code parameters: namely the parameters have to satisfy kd 2 ≤ cn for some constant c [START_REF] Bravyi | Tradeoffs for reliable quantum information storage in 2d systems[END_REF]. For tessellations of 2-dimensional manifolds, Delfosse showed that kd 2 ≤ c(log k) 2 n [START_REF] Delfosse | Tradeoffs for reliable quantum information storage in surface codes and color codes[END_REF]. In particular, these results show that one cannot get a good minimum distance for codes with constant rate built from 2-dimensional manifolds.

In many cases, it is natural to consider constant-rate codes where k = Θ(n): such codes for instance allow one to obtain quantum fault-tolerant computation with constant space overhead [START_REF] Gottesman | Fault-tolerant quantum computation with constant overhead[END_REF][START_REF] Fawzi | Constant overhead quantum faulttolerance with quantum expander codes[END_REF]. For a long time, it was believed that constant-rate homological codes could not have a large minimum distance, that is growing polynomially with their length [START_REF] Zémor | On cayley graphs, surface codes, and the limits of homological coding for quantum error correction[END_REF]. A recent breakthrough was the work of Guth and Lubotzky [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] who gave a construction of homological codes in hyperbolic 4-space that combine a constant rate with a minimum distance d = n α , for some constant α > 0. It was later shown by Murillo that the construction could be adapted to yield α ∈ [0.2, 0.3]. Quickly after this result, Hastings proposed a decoding algorithm for such codes [START_REF] Hastings | Quantum codes from high-dimensional manifolds[END_REF]. Unfortunately, the analysis of Hastings' decoding algorithm is only valid when local brute-force decoding is performed at a scale that may not be computationally practical.

In fact, it is difficult to precisely analyze the performance of Hastings' decoder because the local structure of the codes of [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] is not completely explicit.

In this work, we give a variant of the construction of Guth and Lubotzky which admits a simple explicit local structure: it is based on a regular tessellation of the 4-dimensional hyperbolic space by means of hypercubes. We then exploit this local structure to design an efficient decoding algorithm which tries to locally shorten cycles. In Section 2, we give an overview of our approach compared to that of Guth and Lubotzky. In Section 3, we explain how to obtain a regular tessellation of hyperbolic 4-space with hypercubes. In Section 4, we detail how to quotient the space to get a compact manifold, which then yields the quantum code. We finally describe our local decoder and analyze its performances in Section 5.

A variant of Guth and Lubotzky's construction based on a Regular Tessellation of Hyperbolic Space

The family of manifolds considered in [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] is a family of 4-dimensional hyperbolic coverings.

The tessellations can be obtained by pulling back the natural tessellation of the base space. Each covering equipped with its natural tessellation gives rise to a quantum error correcting code. Unfortunately the fundamental polytope of this natural tessellation is not regular. In particular, it is nontrivial to obtain the local structure of the tessellation, and therefore an explicit description of the code generators. While this did not prevent Hastings from designing a decoding algorithm for these codes [START_REF] Hastings | Quantum codes from high-dimensional manifolds[END_REF], simulating its performance for the codes of [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] appears quite impractical. (Note, however, that Hastings' decoder was recently implemented for the 4-dimensional toric code, in Euclidean space [START_REF] Nikolas P Breuckmann | Local decoders for the 2d and 4d toric code[END_REF].)

It is useful to see the 4-dimensional homological quantum error correcting codes that Guth and Lubotzky and we construct as generalisations of the 2-dimensional toric code. Let us therefore give the arithmetic manifold viewpoint on the toric code. We consider the ordinary tessellation of the Euclidean plane by unit squares such that vertices have integer coordinates.

The translation group of Euclidean plane is R × R. We denote by Γ toric the subgroup Z × Z of this translation group. Elements of Γ toric stabilize the ordinary tessellation of Euclidean plane. Let I = pZ be an ideal of Z, with p a positive integer and define Γ(I) toric to be I × I.

The quotient M toric (I) of the Euclidean plane by Γ(I) toric is a torus, that naturally inherits the tessellation by unit squares from the Euclidean plane. The constructions of [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] and of the present work are generalisations of the 2-dimensional Euclidean toric code in a 4-dimensional hyperbolic setting. To help the reader draw analogies with the toric code, we introduced in this paragraph notations similar to the notations used in the sequel.

We now summarise the construction of Guth and Lubotzky and explain the advantages of our approach. In Ref. [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF], the construction is based on tessellations of the hyperbolic 4-space H 4 . To each code corresponds a manifold equipped with a tessellation. The base space M is constructed by considering the action of a cocompact discrete group of isometries Γ on hyperbolic 4-space: M = Γ\H 4 . To each finite index subgroup Γ(I) of Γ corresponds a covering M(I) of M given by M(I) = Γ(I)\H 4 . It is natural to tessellate M with a single 4-face and to tessellate M(I) with a number of 4-faces equal to the index of Γ(I) in Γ. Each 4-face is isometric to the first one. Unfortunately the 4-face is not regular in [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF], which makes the local description of the quantum code rather complicated. To obtain a similar construction with a regular 4-face, we reverse the process: we start with a convenient regular 4-face and then build a corresponding discrete group of isometries Γ.

For its symmetries and because it tessellates the hyperbolic 4-space, we choose the 4dimensional hypercube as our targeted regular 4-face. We embed it in hyperbolic 4-space and scale it according to the {4, 3, 3, 5} tessellation of hyperbolic 4-space (see Section 3.2.1 for a definition of Schäfli symbols). The group Γ is generated by the direct isometries of hyperbolic 4-space sending opposing faces of the hypercube to each other with no rotation. The tessellating 4-face we obtain is a hypercube by construction.

The tricky part of the construction is to define finite index subgroups of our discrete group of isometries Γ in a way similar to [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF]. Indeed, arithmeticity of subgroups Γ(I) plays a central role in lower bounding the minimum distance of the corresponding error correcting codes.

To achieve this goal, we rely on arithmetic structures defined over the number field Q(

√ 5).
Replacing Q by this number field, Z by Z[φ] -the ring of integers of Q( √ 5) -and ideals pZ by ideals of Z[φ] where φ is the golden ratio (giving its name to our construction), it is possible to define principal congruence subgroups Γ(I) such that the corresponding family of error correcting codes satisfies the same asymptotic estimates as in [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF]. We therefore obtain a family of codes with a regular local structure, a non-vanishing rate and a minimum distance lower bounded by n 0.1 , where n is the number of physical qubits.

We take advantage of the regular local structure to design an efficient decoding algorithm. This algorithm is highly local. For X errors, it decreases the syndrome at the scale of a single 4-face. In particular, our algorithm is more local and explicit than Hastings' decoder [START_REF] Hastings | Quantum codes from high-dimensional manifolds[END_REF]. We prove that syndromes associated with errors of weight below the injectivity radius of the manifold always contain a pattern that can be locally shortened so as to decrease the weight of the syndrome. In other words, the algorithm simply consists in examining the syndrome in the neighborhood of an error and acting on qubits to decrease the syndrome weight. We show that arbitrary errors of size O(log n) are corrected by this algorithm, which in turn implies that random errors will be corrected with high probability if the error rate is small enough. These results are similar to those of Hastings' decoder, but with the advantage of an entirely explicit algorithm with precise bounds on its performances.

Hyperbolic 4-space and its Regular Tessellation by Hypercubes

In this section, we first introduce the minimal background on hyperbolic 4-space and regular tessellations. We then focus on the tessellation of hyperbolic 4-space by 4-dimensional hypercubes on which our quantum code construction is based.

Hyperbolic space

We use the hyperboloid model to describe 4-dimensional hyperbolic space. As a set, 4dimensional hyperbolic space is identified with

H 4 = {(x 0 , x 1 , x 2 , x 3 , x 4 ) ∈ R 5 / -x 2 0 + x 2 1 + x 2 2 + x 2 3 + x 2 4 = -1, x 0 > 0}.
It is endowed with a Riemannian metric such as to make it a space of constant negative sectional curvature. Its orientation-preserving isometry group is SO o (1, 4), the identity component of the special indefinite orthogonal group. The four coordinates x 1 , x 2 ,x 3 and x 4 are sufficient to parametrise H 4 . Indeed x 0 can be retrieved from the condition

x 2 0 = 1 + x 2 1 + x 2 2 + x 2 3 + x 2 4
. Therefore in the sequel we will ignore the coordinate x 0 and refer to x 1 as the first coordinate and not as the second.

The reader is referred to [START_REF] Ratcliffe | Foundations of hyperbolic manifolds[END_REF] for a comprehensive introduction to hyperbolic geometry. To give some intuition about hyperbolic space we will merely compare the perimeter growth of a hyperbolic circle of radius r with its Euclidean counterpart. In hyperbolic space, such a circle has perimeter 2π sinh(r). The growth is exponentially faster than its Euclidean counterpart 2πr. In spherical space on the other hand, the perimeter of a circle of radius r is only 2π sin(r), for r < π. Informally speaking, there is more room in the angular direction in hyperbolic space than in Euclidean space just like there is less room in the angular direction in spherical space than in Euclidean space. One can make this statement more precise by considering regular tessellations and their combinatorial properties.

Regular polytopes and tessellations

The geometric point of view on tessellations is probably the most intuitive. By geometric, we mean that vertices, edges and higher dimensional faces of the tessellation are subsets of a geometric space such as for example the hyperbolic plane or the Euclidean 3-space. However a tessellation also entails purely combinatorial data, namely the incidences between its i-faces and its (i+1)-faces. We will refer to this combinatorial data as the abstract polytope attached to a tessellation. For a comprehensive exposition of this so-called abstract point of view we refer to the book of McMullen and Schulte [START_REF] Mcmullen | Abstract regular polytopes[END_REF] (Chapter 2 for the abstract point of view and Chapter 5 for its interplay with geometric realisations). The abstract point of view is especially relevant to quantum error correction since the combinatorial data is sufficient to define a quantum error correcting code. We will only mention here that an abstract polytope is called regular if its automorphism group is transitive on the set of its flags. Moreover the realisation of a abstract regular polytope as a tessellation of a geometric space is called regular if its automorphism group can be represented as an isometry group of the geometric space.

Interestingly the combinatorial data of a abstract regular polytope (its incidences) determines in which geometric space it can be embedded. We can thus talk about spherical, Euclidean and hyperbolic abstract regular polytopes: Definition 1 An abstract regular polytope is called spherical (respectively Euclidean, respectively hyperbolic) if it can be realised with regular faces in a spherical (respectively Euclidean, respectively hyperbolic) manifold.

Informally speaking, if a polytope is locally too small to fit in Euclidean space, it curves inwards and yields a spherical tessellation. If it is too big, it yields a hyperbolic tessellation. In the Euclidean case, the faces of the tessellation can be scaled by multiplying all lengths by a given positive real λ. In the spherical and hyperbolic cases, however, the volumes of faces are imposed by the combinatorics of the tessellation: tessellations far from being Euclidean lead to faces with a large volume.

Combinatorial point of view on tessellations: Schläfli symbols

Results of this section come from Ref. [START_REF] Stephen | Regular honeycombs in hyperbolic space[END_REF]. Since the realisation of an abstract regular polytope is essentially unique (up to a scaling factor if it is euclidean) we will often not distinguish a regular tessellation of a geometric space from its abstract regular polytope: the combinatorial data attached to it. Therefore we can describe regular tessellations via their Schläfli symbols, which are defined recursively for p, q, r, . . . positive integers:

• {p} refers to a regular p-sided polygon.

• {p,q} refers to a regular tessellation by regular p-sided polygons such that each vertex is incident to q regular p-sided polygons.

One obtains a tessellation of the Euclidean plane if (p-2)(q-2) = 4, or of the hyperbolic plane if (p -2)(q -2) > 4. Finally if (p -2)(q -2) < 4, then {p, q} can represent either a tessellation of the two-dimensional sphere or a 3-dimensional polyhedron.

There are five regular 3-dimensional polyhedrons called the Platonic solids: the regular icosahedron {3, 5}; the regular octahedron {3, 4}; the regular tetrahedron {3, 3}; the cube {4, 3} and the regular dodecahedron, {5, 3}.

• If {p,q} and {r,q} are 3-dimensional polyhedrons b , then {p,q,r} refers to a regular tessellation by {p,q}-polyhedrons such that each edge of the tessellation is incident to r {p,q}-polyhedrons. Note that the terminology honeycomb is sometimes used instead of tessellation to insist on 3-dimensionality. The terminology mosaic can be encountered as well. We will use tessellation in the sequel regardless of the dimension. Similarly as before, the nature of the tessellation depends on the relation between the integers p, q, r. If cos π q = sin π p sin π r , one obtains a tessellation of the Euclidean 3-dimensional space. If cos π q > sin π p sin π r , one gets a tessellation of the hyperbolic 3-dimensional space. Finally, if cos π q < sin π p sin π r , it can represent either a tessellation of the spherical 3-dimensional space or a 4-dimensional polytope. There are six regular 4-dimensional polytopes: {3,3,5} is the 600-cell, {3,3,4} is the 4-orthoplex, {3,4,3} is the 24-cell, {3,3,3} is the regular 4-simplex, {4,3,3} is the 4dimensional hypercube, and {5,3,3} is the 120-cell.

• If {p,q,r} and {s,r,q} are 4-dimensional polytopes, {p,q,r,s} refers to a regular tessellation by {p,q,r}-polytopes such that each 2-face of the tessellation is incident to s {p,q,r}-polytopes.

If cos 2 ( π q ) sin 2 ( π p ) + cos 2 ( π r ) sin 2 ( π s ) = 1, it is a tessellation of the 4-dimensional Euclidean space. If cos 2 ( π q ) sin 2 ( π p ) + cos 2 ( π r ) sin 2 ( π s ) > 1, it is a tessellation of hyperbolic 4-space.
There are five regular tessellations of hyperbolic 4-space: {3,3,3,5}, {4,3,3,5}, {5,3,3,5}, b The condition that {r, q} is also a 3-dimensional polyhedron is necessary, for instance, to ensure that the dual tessellation {r, q, p} is well-defined. {5,3,3,4} and {5,3,3,3}.

Given a tessellation or a polytope described by Schläfli symbol {p 1 ,...,p n }, the tessellation or polytope described by {p n ,...,p 1 } is called the dual tessellation or polytope. It is the tessellation obtained by mapping every i-face to an (n -i)-face. Note that duality doesn't change the hyperbolic, Euclidean or spherical type of a tessellation.

The {4,3,3,5} regular tessellation of hyperbolic 4-space

In this work we will focus on the {4,3,3,5} regular tessellation of hyperbolic 4-space. The 4faces {4,3,3} of this tessellation are 4-dimensional hypercubes, which are especially convenient. In particular, one can exploit the fact that the symmetries of the hypercube are compatible with its description in coordinates in the hyperboloid model to find a nice description of a discrete subgroup of SO o (1, 4) corresponding to the {4,3,3,5} regular tessellation. The other regular tessellations of hyperbolic 4-space could lead to similar constructions and would yield quantum codes with similar asymptotic properties. Since their symmetries are less compatible with coordinates in the hyperboloid model, they would require more work to make computations explicit and we will not consider them in this work.

Isometry group of the tessellation

We consider a regular hypercube centered at the origin of the hyperboloid model and such that each of its eight 3-faces is orthogonal to a coordinate axis. We denote this hypercube by T in the sequel (a 4-dimensional hypercube is also called a tesseract). Since the hypercube T is regular, there exist direct isometries of the hyperbolic 4-space H 4 sending any one of them onto the opposite one. These isometries can be thought of as the hyperbolic equivalent of Euclidean translations. Requiring that these direct isometries act trivially on three coordinates defines them uniquely. For example the direct isometries that send the 3-faces orthogonal to the first coordinate axis onto each other are given by the following matrices:

g 1 =       cosh t sinh t 0 0 0 sinh t cosh t 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1       , (g 1 ) -1 =       cosh t -sinh t 0 0 0 -sinh t cosh t 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1       .
The pair of direct isometries sending the 3-faces orthogonal to the second coordinate axis onto each other is given by these two matrices:

g 2 =       cosh t 0 sinh t 0 0 0 1 0 0 0 sinh t 0 cosh t 0 0 0 0 0 1 0 0 0 0 0 1       , (g 2 ) -1 =       cosh t 0 -sinh t 0 0 0 1 0 0 0 -sinh t 0 cosh t 0 0 0 0 0 1 0 0 0 0 0 1       .
The two remaining pairs of direct isometries g 3 , (g 3 ) -1 , g 4 and (g 4 ) -1 are obtained from the above matrices by permuting two coordinates. Recall that the coordinate x 0 is redundant with the four others. Therefore the zeroth coordinate should not be permuted.

The angle between two adjacent 3-faces of the hypercube T depends on the volume of T or equivalently on the parameter t: as we will show, the greater t, the greater the volume of T and the smaller the angle between two adjacent 3-faces. We will compute the value of t such that this angle is 2π/5. Indeed in the {4,3,3,5} regular tessellation of hyperbolic 4-space, five hypercubes meet along each 2-face, which means that the dihedral angle between two 3-faces of the same hypercube must be 2π/5. Note that the dihedral angle between 3-faces is sometimes called dichoral angle to insist on higher dimension. In the sequel we will use the terminology dihedral angle regardless of dimension. To compute dihedral angles in the hyperboloid model we need some definitions.

Definition 2 (Ratcliffe [START_REF] Ratcliffe | Foundations of hyperbolic manifolds[END_REF] §3.1) The Lorentzian inner product denoted • is the bilinear map defined on R 5 × R 5 by:

u • v = -u 0 v 0 + u 1 v 1 + u 2 v 2 + u 3 v 3 + u 4 v 4 . Two vectors u, v are Lorentz orthogonal if u • v = 0. Definition 3 (Ratcliffe [20] §3.1)
The Lorentzian norm of a vector u is the complex number denoted ||u|| satisfying u • u = ||u|| 2 and such that ||u|| is either positive imaginary, 0 or positive. Note that if ||u|| is positive imaginary, |||u||| denotes its modulus.

Definition 4 (Ratcliffe [START_REF] Ratcliffe | Foundations of hyperbolic manifolds[END_REF] §3.2) The space-like angle η between two space-like vectors u and v is defined by: u

• v = ||u|| • ||v|| cos(η) and 0 ≤ η ≤ π.
Definition 5 (Ratcliffe [20] §6.4) Let S and T be two adjacent sides of a convex polytope P . Let u, respectively v, be a vector that is Lorentz orthogonal to S, respectively T , and directed away from P . Let η the space-like angle between u and v. Then the dihedral angle θ(S, T ) between S and T is defined by:

θ(S, T ) = π -η(u, v).
With this definition the dihedral angle is invariant under global Lorentz transformations. Indeed Lorentz orthogonality and space-like angles are Lorentz invariant. This property is necessary since Lorentz transformations are the isometries of the hyperbolic metric.

To fully justify the definition it remains to show that we obtain the expected dihedral angle when the two sides intersect at the origin (1, 0, 0) T of the hyperboloid. For simplicity we assume that S and T are two lines intersecting at the origin of the hyperbolic plane. In the hyperboloid model we can assume that S = {(cosh(x), sinh(x), 0) | x ∈ R} and T = {(cosh(x), cos(θ(S, T )) sinh(x), sin(θ(S, T )) sinh(x)) | x ∈ R}. Then u = (0, 0, -1) is Lorentz orthogonal to S and v = (0, -sin(θ(S, T )), cos(θ(S, T ))) is Lorentz orthogonal to T . Vectors u and v are directed away from P ( P is defined consistently with θ(S, T ) ). A computation yields u • v = -cos(θ(S, T )). Since ||u|| = ||v|| = 1 we obtain that cos(η(u, v)) = -cos(θ(S, T )). Since by definition both θ(S, T ) and η(u, v) are in [0, π] , this gives θ(S, T ) = π -η(u, v).

We can now come back to the hypercube T centered at the origin of hyperbolic space. Let C 1 , respectively C 2 , be the 3-face of T orthogonal in hyperbolic 4-space to the first, respectively second, axis and such that its first, respectively second, coordinate in the hyperboloid model is positive. Recall that x 0 is referred to as the zeroth coordinate. Thus the first coordinate is x 1 and the second is x 2 . Points of C 1 have coordinates of the form λ(cosh(t/2), sinh(t/2), a, b, c) T for some a, b, c ∈ R and a normalising constant λ. Similarly points of C 2 have coordinates of the form λ(cosh(t/2), a, sinh(t/2), b, c) T . It is straightforward to verify that N 1 = (sinh(t/2), cosh(t/2), 0, 0, 0) T is Lorentz orthogonal to C 1 and N 2 = (sinh(t/2), 0, cosh(t/2), 0, 0) T is Lorentz orthogonal to C 2 . We have:

η(N 1 , N 2 ) = arccos( N 1 • N 2 ||N 1 ||||N 2 || ) = arccos(-sinh 2 (t/2)), θ(C 1 , C 2 ) = π -η(N 1 , N 2 ), θ(C 1 , C 2 ) = π -arccos(-sinh 2 (t/2)).
As announced, the dihedral angle between two adjacent 3-faces of the hypercube T decreases with parameter t, or equivalently when the volume of T increases.

Since we want to build a {4,3,3,5} tessellation, five hypercubes have to be incident to each 2-face of the hypercube. This imposes θ(C 1 , C 2 ) = 2π/5 and leads to t = 2arsinh( cos(2π/5)). We eventually obtain

cosh(t) = 1 + √ 5 2
and sinh(t

) = 1 + √ 5 2 ,
the golden ratio φ and its square root.

We denote by Γ the discrete subgroup of SO o (1, 4) generated by the four direct isometries g 1 , g 2 , g 3 and g 4 sending a 3-face of the hypercube onto the opposite 3-face. Note that there are eight such direct isometries but they are pairwise inverse of each other.

Coxeter group approach

The problem with the group Γ defined above is that its fundamental domain is not the hypercube. Indeed there are elements of Γ that fix the hypercube globally but not pointwise. They correspond to symmetries of the hypercube. Therefore the fundamental domain of Γ is only a fraction of the hypercube.

However we would like to work with {4, 3, 3, 5} tessellations. This way the tessellation is regular with a local structure that is easy to describe. To achieve this goal we will define a double extension of Γ which is a representation of the {4, 3, 3, 5} Coxeter group. The standard technique of considering cosets of this Coxeter group will then yield the tessellation by hypercubes (see [START_REF] Mcmullen | Abstract regular polytopes[END_REF]). We can define Γ {4,3,3,5} = r 0 , r 1 , r 2 , r 3 , r 4 , with its five generators given by:

r 0 =       1 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1       , r 1 =       1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1       , r 2 =       1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1       , r 3 =       1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0       , r 4 =       φ 0 0 0 - √ φ 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 √ φ 0 0 0 -φ      
.

It is straightforward to verify that these five generators satisfy the relations defining the {4, 3, 3, 5} string Coxeter group:

r 2 0 = r 2 1 = r 2 2 = r 2 3 = r 2 4 = (r 0 r 1 ) 4 = (r 1 r 2 ) 3 = (r 2 r 3 ) 3 = (r 3 r 4 ) 5 = id.
To obtain a {4, 3, 3, 5} tessellation of H 4 , we can follow [START_REF] Mcmullen | Abstract regular polytopes[END_REF] and identify S i -cosets in Γ {4,3,3,5} with i-faces of the {4, 3, 3, 5} tessellation. For i ∈ {0, . . . , 4}, the group S i is the subgroup of Γ {4,3,3,5} generated by the four generators (r j ) j =i (for instance S 1 def = r 0 , r 2 , r 3 , r 4 ). By definition, an i-face F a and a j-face F b are incident if the corresponding cosets g a S i and g b S j have a non-empty intersection.

With these definitions we only have a combinatorial description of the {4, 3, 3, 5} tessellation. To obtain the geometrical version of the tessellation, observe that each element of Γ {4,3,3,5} corresponds to a simplex of H 4 : the identity of Γ {4,3,3,5} corresponds to a fundamental domain S of H 4 (which happens to be a simplex in this case) and any g ∈ Γ {4,3,3,5} corresponds to gS. Now an i-face of the tessellation corresponds to a coset of S i in Γ {4,3,3,5} . This coset can be considered as a set of elements of Γ {4,3,3,5} or, in other words, as a set of closed simplices of H 4 . If i = 4 the geometrical 4-face is defined as the union of these closed simplices. If i ∈ {0, . . . , 3} the geometrical i-face is defined as the intersection of the 4-faces incident to this i-face. This {4, 3, 3, 5} tessellation of hyperbolic 4-space has an infinite number of i-faces for every i ∈ {0, . . . , 4}. To build a code with a finite number of qubits, we need a tessellation with a finite number of 2-faces. We use in the sequel number theoretical tools to construct quotients of the hyperbolic 4-space equipped with a {4, 3, 3, 5} tessellation.

4 Compact Manifolds equipped with a {4, 3, 3, 5} Tessellation

We want to define a quantum code by identifying physical qubits with 2-faces of a tessellation. To obtain a code with a finite number of physical qubits, we will consider tessellations of compact manifolds. We will therefore consider the {4, 3, 3, 5} tessellation of compact manifolds obtained as quotients of hyperbolic 4-space. These manifolds are called arithmetic because they are quotients of H 4 by arithmetic subgroups of Γ {4,3,3,5} . We first review the definitions of a number field and its ring of integers. We then use these tools to associate an arithmetic subgroup Γ {4,3,3,5} (I) to every ideal I of the ring of integers Z[φ].

Number fields and rings of integers

Definition 6 A number field K is a finite degree field extension of the field of rational numbers Q.

Definition 7 A complex number is an algebraic number if it is a root of a non-zero polynomial over Q.

Theorem 8 (e.g. Marcus, [START_REF] Daniel | Number fields[END_REF] Appendix 2) Every number field has the form Q(α) for some algebraic number α ∈ C. If α is a root of an irreducible polynomial over Q having degree n, then

Q(α) = {a 0 + a 1 α + ... + a n-1 α n-1 | ∀i ∈ {0, . . . , n -1}, a i ∈ Q}. Since √ 5 is a root of X 2 -5, which is irreducible over Q, we have Q( √ 5) = {a 0 + a 1 √ 5 | a 0 , a 1 ∈ Q}.
Definition 9 A complex number is an algebraic integer if it is a root of a monic (leading coefficient equal to 1) polynomial with coefficients in Z.

Definition 10

The ring of integers of a number field K is the subset of its algebraic integers. It is denoted O K .

Propositon 11 (e.g. Marcus, [START_REF] Daniel | Number fields[END_REF] p. 15) Let m ∈ Z satisfy m ≡ 1 (mod 4) and let K be the quadratic number field Q( √ m). Then,

O K = a + b √ m 2 | a, b ∈ Z . Applying this characterization to the case K = Q( √ 5) yields: O Q( √ 5) = a + b √ m 2 | a, b ∈ Z, a ≡ b (mod 2) O Q( √ 5) = Z[φ].
where φ is the golden ratio 1+ Definition 12 A number field is totally real if all its embeddings in C are embeddings in R.

In order to prove the same asymptotic behaviour of the code parameters n, k and d as in Refs [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] and [START_REF] Plinio | Systole of congruence coverings of arithmetic hyperbolic manifolds[END_REF], we need to work with a totally real number field. Note that the totally real number field condition is not explicit in [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] but it is implicitly used to show that their arithmetic group Γ is discrete. However Q( √ φ) is not a totally real number field. Indeed √ φ has minimal polynomial X 4 -X 2 + 1 which factorises as (X -

√ φ)(X + √ φ) X -i √ 5-1 2 X + i √ 5-1 2
and thus Q( √ φ) admits the two non-real embeddings determined by

√ φ → i √ 5-1 2
and by

√ φ → -i √ 5-1 2 .
We therefore conjugate matrices of Γ {4,3,3,5} in such a way that all their entries now belong to a totally real number field. Since matrix multiplication is defined through addition and multiplication of their entries, it is sufficient to ensure that the four matrices generating Γ {4,3,3,5} have their entries in a totally real number field.

Observe that 1/

√ φ 0 0 1 φ - √ φ √ φ -φ √ φ 0 0 1 = φ -1 φ -φ and φ 1 φ φ -1 = φ -1 φ -φ .
Therefore, defining P = diag( √ φ, 1, 1, 1, 1), the group Γ{4,3,3,5} defined as P -1 Γ {4,3,3,5} P has all its matrices with entries in the number field

K = Q(φ) = Q( √ 5
), and even in its ring of integers Z[φ]. Note that since Γ {4,3,3,5} is a subgroup of O(1, 4), matrices g in Γ{4,3,3,5} satisfy the equation g T Jg = J where J = diag(-φ, 1,

Now the minimal polynomial of √ 5 is X 2 -5 which factorises as (X -√ 5)(X + √ 5).

Hence the two embeddings of Q(

π I : M n (A) → M n (A/I) (a i,j ) → (a i,j + I).
It is natural to consider ideals of the ring A because we want the quotient A/I to be a ring in order for M n (A/I) to be defined. Hence to each ideal I of Z[φ] corresponds a normal subgroup Γ {4,3,3,5} (I) of Γ {4,3,3,5} . We denote by M(I) the quotient of H 4 by Γ {4,3,3,5} (I). By definition M(I) = Γ {4,3,3,5} (I)\H 4 is the set of orbits of H 4 under the action of Γ {4,3,3,5} (I). Note that we use the notation Γ {4,3,3,5} (I)\H 4 and not H 4 /Γ {4,3,3,5} (I) because Γ {4,3,3,5} (I) acts on H 4 on the left. M(I) naturally inherits the hyperbolic structure of H 4 .

For completeness, we will now detail how M(I) inherits the {4, 3, 3, 5} tessellation of H 4 .

By definition of Γ(I) the following short sequence is exact:

1 → Γ {4,3,3,5} (I) → Γ {4,3,3,5} → π I (Γ {4,3,3,5} ) → 1.
Therefore, by the first isomorphism theorem, the quotient group Γ {4,3,3,5} /Γ {4,3,3,5} (I) is isomorphic to π I (Γ {4,3,3,5} ). This quotient group acts on M(I) in the following manner: for any g • Γ {4,3,3,5} (I) ∈ Γ {4,3,3,5} /Γ {4,3,3,5} (I) and Γ {4,3,3,5} (I) • x in M(I),

(g • Γ {4,3,3,5} (I)) • (Γ {4,3,3,5} (I) • x) = Γ {4,3,3,5} (I) • (g • x).
Since Γ {4,3,3,5} (I) is normal in Γ {4,3,3,5} , this is well defined and it is a group action. We will see in subsection 4.4 that for ideals with sufficiently large norms (see Definition 16), Γ {4,3,3,5} (I) acts freely (without fixed points) on H 4 . Therefore for such ideals M(I) is a manifold.

Moreover for i ∈ {0, . . . , 4}, i-faces of the {4, 3, 3, 5} tessellation of H 4 have a diameter upper bounded by some constant c depending on the local structure. Again, for ideals with sufficiently large norms, Γ {4,3,3,5} (I) acts on H 4 in a way such that no pair of points x, y ∈ H 4 satisfying d(x, y) ≤ c belong to the same orbit. For such ideals I, the {4, 3, 3, 5} local structure is preserved by Γ {4,3,3,5} (I). We can retrieve it by considering cosets of π I (Γ {4,3,3,5} ).

More precisely the group Γ{4,3,3,5} (I) is generated by r 0, J , r 1, J , r 2, J , r 3, J and r 4, J :

r 0, J =       1 0 0 0 0 0 -1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1       , r 1, J =       1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1       , r 2, J =       1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1       , r 3, J =      
1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0

      , r 4, J =       φ 0 0 0 -1 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 φ 0 0 0 -φ      
.

Therefore for any ideal I of Z[φ], the group π I ( Γ{4,3,3,5} ) is generated by r 0,I , r 1,I , r 2,I , r 3,I and r 4,I :

r 0,I =       1 + I 0 0 0 0 0 -1 + I 0 0 0 0 0 1 + I 0 0 0 0 0 1 + I 0 0 0 0 0 1 + I       , r 1,I =       1 + I 0 0 0 0 0 1 + I 0 0 1 + I 0 0 0 0 0 1 + I 0 0 0 0 1 + I       , r 2,I =       1 + I 0 0 0 0 0 1 + I 0 0 0 0 0 0 1 + I 0 0 0 1 + I 0 0 0 0 0 0 1 + I       , r 3,I =       1 + I 0 0 0 0 1 + I 0 0 0 0 1 + I 0 0 0 0 0 1 + I 0 0 0 1 + I       , r 4,I =       φ + I 0 0 0 -1 + I 0 1 + I 0 0 0 0 0 1 + I 0 0 0 0 0 1 + I 0 φ + I 0 0 0 -φ + I       .
For ideals I whose norm is large enough, we can define i-faces of M(I) with the same coset method we used for H 4 : i-faces correspond to cosets of π I ( Γ{4,3,3,5} ) by its subgroup S i,I generated by (r j,I ) j =i . Incident faces correspond to cosets whose intersection is not empty. We will use this method in Subsection 4.5 to construct explicit quantum codes.

The results stated in the sequel of this paper are valid for ideals I whose norm is large enough to have a {4, 3, 3, 5} tessellation of M(I). It is shown in Ref. [START_REF] Plinio | Systole of congruence coverings of arithmetic hyperbolic manifolds[END_REF] that [Γ {4,3,3,5} : Γ {4,3,3,5} (I)] ≤ 4N (I) dim(O(1,4)) = 4N (I) 10 . This provides an upper bound on the size of the quantum code associated with an ideal I: n(I) ≤ N (I) 10 /20.

(1)

Note that the ring Z[φ] admits a family of ideals whose norms are unbounded. Indeed the norm of the ideal of Z[φ] generated by m is m 2 . This translates into a family of quantum codes with an unbounded number of physical qubits. Moreover there are other ideals in Z[φ].

For example, the ideal generated by √ 5 has norm 5.

We will now paraphrase the correspondence exposed in Ref. [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] between a family of coverings and a family of quantum codes. From each 4-dimensional manifold equipped with a {4, 3, 3, 5} tessellation M(I), a code is constructed: qubits are identified with 2-faces of M(I), X-type stabilizers are identified with 1-faces (edges) of M(I) and Z-type stabilizers are identified with 3-faces of M(I). Each X-type, respectively Z-type, stabilizer acts by an X Pauli matrix, respectively a Z Pauli matrix, on every qubit it is incident to. The codespace is the common (+1)-eigenspace of the set of stabilizers. The length n of the code, i.e. its number of physical qubits, is the number of 2-faces of the tessellation. It is proportional to the volume of M(I). The dimension k of the code, i.e. its number of logical qubits, is the second Betti number of M(I), i.e. the rank of its second homology group. The minimum distance d of the code is the minimal number of 2-faces forming a homologically nontrivial 2-cycle in M(I). It is lower bounded by a quantity proportional to the least area of a homologically nontrivial surface of M(I). These proportionality coefficients do not depend on the ideal I. With this correspondence, the asymptotic behaviour of n, k and d is understood in terms of the family of manifolds (M(I)) I∈Z[φ] independently of the {4, 3, 3, 5} tessellation.

To each ideal I of the ring of integers Z[φ] corresponds a manifold M(I) equipped with a {4, 3, 3, 5} tessellation and a quantum error correcting code C(I).

Lower bound on the rate of the quantum codes

Quantum codes based on regular tessellations of hyperbolic spaces have a non-vanishing rate. It is well-known for tessellations of the hyperbolic plane and it is also true for tessellations of the hyperbolic 4-space. The argument is given in Ref. [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] (Theorem 7 and Corollary 9) and we can sketch it here and make it more quantitative than in Ref. [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF]:

As a consequence of Gauss-Bonnet-Chern's theorem [START_REF] Shiing-Shen Chern | A simple intrinsic proof of the gauss-bonnet formula for closed riemannin manifolds[END_REF], the Euler characteristic χ(I) of the closed oriented hyperbolic 4-manifolds M(I) satisfies χ(I) = c vol(M(I)). It is possible to generalise the definition of the Euler characteristic (see e.g. [START_REF] Martelli | Hyperbolic four-manifolds[END_REF]) to orbifolds (roughly speaking, manifolds that can have singularities) in such a way that this definition still holds. We can illustrate this by computing the Euler characteristic of the hypercube T of the {4,3,3,5} tessellation of hyperbolic 4-space. For each i in {0, . . . , 4} we have to divide the number of i-faces of T by the number of hypercubes an i-face would be incident to in the {4,3,3,5} tessellation of hyperbolic 4-space. We obtain: Moreover, by definition of the Euler characteristic,

χ(T ) = 1 1 - 8 2 + 24
χ(I) = 4 i=0 (-1) i dim H i (M(I), Z 2 ), where H i (M(I), Z 2 ) is the i th homology group of M(I) with coefficients in Z 2 . Since M(I) is a connected 4-manifold, dim H 0 (M(I), Z 2 ) = dim H 4 (M(I), Z 2 ) = 1.
Since physical qubits are identified with 2-faces of the tessellation, the number of logical qubits k(I) of the quantum code corresponding to M(I) is dim H 2 (M(I), Z 2 ).

k(I) = χ(I) + dim H 1 (M(I), Z 2 ) + dim H 3 (M(I)Z 2 ) -2 ≥ χ(I) -2 ≥ 17 360 n(I) -2
This proves that the asymptotic rate of this family of quantum codes is greater than or equal to 17 360 ≈ 0.0472.

Note that with the {5, 3, 3, 5} tessellation, the lower bound on the asymptotic rate is 5 720 × 26 ≈ 0.18. The other regular tessellations of hyperbolic 4-space yield lower rates.

Lower bound on the minimum distances of the quantum codes

Following Ref. [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] we could prove that the minimum distance d asymptotically satisfies n ≤ d ≤ n 0.3 for an > 0. But we will rather follow Ref. [START_REF] Plinio | Systole of congruence coverings of arithmetic hyperbolic manifolds[END_REF] and Ref. [START_REF] Plinio | On Arithmetic Manifolds with Large Systole[END_REF] and derive a tighter lower bound for the minimum distance: d = Ω(n 0.1 ). We will also mention a variant of the construction yielding the even better d = Ω(n 0.2 ). These two lower bounds rely on algebraic arguments.

The first lower bound on the minimum distance is obtained by lower-bounding the trace of matrices of Γ{4,3,3,5} (I). Indeed this lower bound on the trace of a matrix g then yields a lower bound on the distance between a point x ∈ H 4 and its image g • x. Finally, through Anderson's theorem (Ref. [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF] th. 17) the size of the smallest homologically nontrivial 2-cycle is exponentially controlled by the size of the smallest homologically nontrivial 1-cycle.

We will start by deriving the lower bound on the trace of a matrix g of Γ{4,3,3,5} (I). g satisfies the matrix equation g T Jg = J where J = diag(-φ, 1, 1, 1, 1). This translates into 10 quadratic equations on the entries of g. We will only need the five equations coming from entries on the diagonal:

-φ g 2 0,0 + g 2 1,0 + g 2 2,0 + g 2 3,0 + g 2 4,0 = -φ, -φ g 2 0,j + g 2 1,j + g 2 2,j + g 2 3,j + g 2 4,j = 1 for j ∈ {1, . . . , 4}.
Denoting by σ the nontrivial embedding of Q( √ 5) in C that sends √ 5 to -√ 5 and applying it to these equations yields:

-σ(φ) σ(g 0,0 ) 2 + σ(g 1,0 ) 2 + σ(g 2,0 ) 2 + σ(g 3,0 ) 2 + σ(g 4,0 ) 2 = -σ(φ), (2)
-σ(φ) σ(g 0,j ) 2 + σ(g 1,j ) 2 + σ(g 2,j ) 2 + σ(g 3,j ) 2 + σ(g 4,j ) 2 = 1 for j ∈ {1, . . . , 4}. (3)
Observing that -σ(φ) is positive, we obtain from Eq.(2) that |σ(g 0,0 )| ≤ 1. Similarly Eq.(3) yields |σ(g j,j )| ≤ 1 for j ∈ {1, . . . , 4}. Defining for j ∈ {0, . . . , 4}, y j := g j,j -1, we have |σ(y j )| ≤ 2 for j ∈ {0, . . . , 4}. Moreover we can rewrite Eq.( 2) and Eq.( 3):

-2φ y 0 -φ y 2 0 + g 2 1,0 + g 2 2,0 + g 2 3,0 + g 2 4,0 = 0, (4)
2y j + y 2 j -φ g 2 0,j + i =j g 2 i,j = 0 for j ∈ {1, . . . , 4}. (5)
From Eq.( 4) and Eq.( 5) we obtain that 2φ y 0 and 2y j for j ∈ {1, . . . , 4} belong to I 2 .

Definition 17

The norm N (x) of an element x of a number field is the product of its conjugates. For a quadratic field with non trivial embedding σ, N (x) = xσ(x).

Propositon 18 (e.g. [START_REF] Plinio | On Arithmetic Manifolds with Large Systole[END_REF] ) The absolute value of the norm of an element of an ideal is greater than or equal to the norm of this ideal.

By multiplication and summation we know that 2φ(y 0 + y 1 + ... + y 4 ) belongs to I 2 . Hence,

|N (2φ(y 0 + y 1 + ... + y 4 ))| ≥ N (I) 2 |N (y 0 + y 1 + ... + y 4 )| ≥ N (I) 2 N (2φ) ≥ N (I) 2 4 .
Therefore, Since tr(g) = y 0 + y 1 + ... + y 4 + 5, we obtain |tr(g)| ≥ N (I) 2 40 -5.

|y
Injecting Eq. 1, we can lower-bound the absolute value of the trace of a matrix g ∈ Γ {4,3,3,5} (I) by the number of physical qubits n(I):

|tr(g)| ≥ 1 2 × 20 0.8 n(I) 0.2 -5.
We will now define the displacement function of a matrix g ∈ Γ {4,3,3,5} (I) acting on H 4 and lower-bound it by |tr(g)|.

Definition 19

The displacement function ρ of a matrix M acting on a space X is the infimum over x ∈ X of the distance between x and M x:

ρ M = inf x∈X d(x, M x).
In our case, since the quotient manifold M(I) is closed and compact, the 1-systole is nothing but the infimum over g ∈ Γ {4,3,3,5} (I) of the displacement function of g:

1-syst(M(I)) = inf g∈Γ {4,3,3,5} (I) ρ g .
Observing that both the trace and the displacement function are invariant by conjugation it is easy to prove (see [START_REF] Plinio | On Arithmetic Manifolds with Large Systole[END_REF] Proposition 6.1.1 p.64):

|tr(g)| ≤ 2 cosh(ρ g ) + 3. Thus, 1-syst(M(I)) ≥ ρ g ≥ ln(|tr(g)| -4) ≥ ln 1 2 × 20 0.8 n(I) 0.2 -9 ≥ ln n(I) 0.2 -18 × 20 0.8 2 × 20 0.8 .

Definition 20

The injectivity radius of a hyperbolic manifold is the supremum of the radii r such that the restriction of the covering projection H 4 → M to any ball of radius r is injective.

The injectivity radius R(I) of the closed compact manifold M(I) is half its 1-systole:

R(I) ≥ 1-syst(M(I)) 2 ,
≥ ln n(I) 0.2 -18 × 20 0.8 2 × 20 0.8 0.5

.

A specific case of Anderson's theorem yields: Theorem 21 ([1] th. 17) Let M be a closed manifold with a hyperbolic metric. Let Z be a homologically non-trivial 2-cycle with coefficients in Z 2 . Let R be the injectivity radius of M . Then the volume of Z is greater than or equal to the volume of a disk of radius R in the hyperbolic plane: vol(Z) ≥ 2π(cosh(R) -1).

Since every 2-face of the {4,3,3,5} tessellation has the same volume v, for every 2-chain C of M(I) with its tessellation, vol(C) = wt(C) × v where wt(C) is the number of faces of the chain C. To have a fully explicit result, we will compute the value of v, which is also the area of a square in the regular {4,5} tessellation of the hyperbolic plane. We can compute its value thanks to the (2-dimensional) Gauss-Bonnet theorem:

v = -2π χ({4, 5}-square) = -2π 1 1 - 4 2 + 4 5 = 2 5 π.
Applying Theorem 21 to M(I) yields:

d(I) ≥ π v (exp(R(I)) -2),
where d(I) is the minimal distance of the quantum code corresponding to M(I). This gives the bound on the minimal distance:

d(I) ≥ 5 2 n(I) 0.2 -18 × 20 0.8 2 × 20 0.8 0.5 -5.
Asymptotically, d(I) is greater than or equal to Similarly to Ref. [START_REF] Plinio | Systole of congruence coverings of arithmetic hyperbolic manifolds[END_REF], we can consider the spin group Spin(1, 4), which is a double covering of SO o (1, 4). Defining principal congruence subgroups at the level of the spin group Spin [START_REF] Guth | Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds[END_REF][START_REF] Gottesman | Stabilizer codes and quantum error correction[END_REF], Murillo shows that the minimum distance d of the corresponding codes satisfies d = Ω(n 0.2 ) [START_REF] Plinio | Systole of congruence coverings of arithmetic hyperbolic manifolds[END_REF]. We note that the arithmetic manifolds defined at the level of the spin group are not strictly speaking the same as the ones defined at the level of the indefinite orthogonal group. Indeed the arithmetic subgroups of Γ {4,3,3,5} by which the hyperbolic 4-space is quotiented are different. To derive the lower bound n 0.2 on the minimum distance, the whole construction has to be done at the level of the spin group. Doing so does not alter the rate of the family of codes nor its {4, 3, 3, 5} local structure. Therefore it does not modify the local decoders designed in Section 5. However since using the spin group makes the exposition less intuitive and does not improve the main result qualitatively, we will not state it in the main theorem:

Theorem 22 There exists a family of homological quantum error correcting codes [[n, k, d]] defined from hyperbolic 4-manifolds equipped with {4, 3, 3, 5} tessellations. This family has non-vanishing rate k n which is asymptotically lower bounded by 17/360. The minimum distance d of its codes grows at least like n 0.1 .

Estimates of the number of physical qubits

The family of codes used to state Theorem 22 has the drawback of being sparse. We show now that the smallest value of n corresponding to a proper ideal of Z[φ] is 234 000. However there are normal subgroups of Γ {4,3,3,5} which are not constructed from an ideal of Z[φ].

Finding such normal subgroups with small index in Γ {4,3,3,5} would lead to quantum codes with a more reasonable, i.e. small enough to be practical, number of physical qubits. Even though the control over the minimum distance is lost when considering non arithmetic normal subgroups, the rate of the family of codes and the local decoders are valid for any normal subgroup. Moreover it could be interesting to use the technique of Ref. [START_REF] Nikolas P Breuckmann | Hyperbolic and semi-hyperbolic surface codes for quantum storage[END_REF] to interpolate between arithmetic hyperbolic 4-dimensional codes and e.g. Euclidean 4-dimensional codes. This can be done by refining the hyperbolic tessellation by a Euclidean tessellation of the hypercubes.

Since SO o (1, 4) has dimension 10, the number of hypercubes in the manifold equipped with a {4, 3, 3, 5} tessellation M(I) is proportional to N (I) 10 . Therefore the number of qubits of the quantum error correcting code is also proportional to N (I) 10 . In Z[φ], the smallest proper

r 0,F5 =      
1 0 0 0 0 0 4 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1

      , r 1,F5 =      
1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1

      , r 2,F5 =      
1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1

      , r 3,F5 =      
1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0

      , r 4,F5 =       3 0 0 0 4 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 3 0 0 0 2       .
Using the software GAP for computational discrete algebra and this set of generators, we find that |π √ 5Z[φ] (Γ {4,3,3,5} )| = 18 720 000 (which implies that π √ 5Z[φ] (Γ {4,3,3,5} ) is the whole orthogonal group with dimension 5 and entries in F 5 ). Since |S 2,( √

5Z[φ]) | = 80, the number n( √ 5Z[φ]
) of physical qubits of the corresponding code is 18 720 000/80 = 234 000. Using a computational discrete algebra software like GAP and the coset method, we can compute the parity check matrices of this code.

Local Decoders

In this section, we design efficient decoding algorithms for the family of codes constructed in the previous section. These decoders are tailored for the whole hyperbolic 4-space equipped with a {4, 3, 3, 5} tessellation. Of course we want to apply these decoders to codes with a finite number of physical qubits, i.e. to the hyperbolic manifolds M(I) equipped with a {4, 3, 3, 5} tessellation.

In this work we consider arbitrary errors of weight logarithmic in the number of physical qubits. Indeed the injectivity radii of the arithmetic hyperbolic manifolds associated with the golden code family scale logarithmically with their volumes. In terms of decoding, this implies that decoding a number of errors logarithmic in the number of physical qubits is strictly equivalent in the arithmetic hyperbolic manifolds and in the whole hyperbolic 4-space equipped with a {4, 3, 3, 5} tessellation. In other words our decoder provably succeeds for any error pattern of weight logarithmic in the number of physical qubits. Second, the same decoder will succeed with high probability to correct random error patterns of weight linear in the number of physical qubits, for instance if the qubits are affected independently by depolarizing noise.

The advantage of our decoders over the generic hyperbolic 4-dimensional decoder by Hastings [START_REF] Hastings | Quantum codes from high-dimensional manifolds[END_REF] is their high locality. Indeed Hastings' decoder is local at the level of a ball of radius R dec where R dec is constant but unknown. Since in hyperbolic 4-space the number of 2-faces in a ball of radius R dec grows like e 3R dec , even small values of R dec can lead to an unpractical degree of locality. For instance the authors of [START_REF] Nikolas P Breuckmann | Local decoders for the 2d and 4d toric code[END_REF] use the value R dec = 1.5 to implement a version of Hastings' decoder in a 4-dimensional toric code setting. With such a small value of R dec the analysis of the performance of Hastings' decoder probably does not apply. The analysis of our decoders, on the other hand, is valid at a level of locality that is computationally practical.

Since the codes we consider are CSS, it is possible to decode X-type and Z-type errors independently, and this is what our algorithm does. Because correcting these two types of errors on a qubit is sufficient to correct an arbitrary single-qubit error, we can state our decoding theorem as follows.

Theorem 23 There exists a constant C such that for any error E corrupting less than C log n physical qubits, the decoding algorithm returns a set of qubits E such that E and E differ by a sum of stabilizers.

Since stabilizers act trivially on the codespace, Theorem 23 implies that any codestate corrupted on at most C log n physical qubits is perfectly recovered by the active error correction procedure.

Moreover, standard results in percolation theory show that for a random error model where each qubit is affected independently and identically with a depolarizing node, then below some constant noise threshold, the error will affect qubits that belong to small connected components of the tessellation of size O(log n). This is because the tessellation has constant degree. Using the same ideas as in [START_REF] Fawzi | Efficient decoding of random errors for quantum expander codes[END_REF], the decoding algorithm will correct the error with high probability.

Theorem 24 There exists a constant p 0 > 0 such that if each qubit is independently and identically affected by an X or a Z error with probability p < p 0 , then the decoding algorithm corrects the error with high probability.

Decoding Z-errors

As mentioned, the algorithm successively decodes Z-errors then X-errors. It succeeds if it recovers the right error patterns, up to some element of the stabilizer group. We first consider Z-errors. A Z-decoder takes as input a syndrome on X-type stabilizers and outputs a set of Z-errors consistent with this syndrome. For golden codes, X-type stabilizers are defined by edges in the {4, 3, 3, 5} tessellation. The error pattern is by definition the set of 2-faces corresponding to qubits having a Z-error. The syndrome is the boundary of the error pattern. Since every boundary is a cycle, the syndrome consists of several loops of edges.

Definition 25 A path of edges from vertex v 1 to vertex v 2 is minimal if no other path of edges from vertex v 1 to vertex v 2 is shorter.

The Z-decoder follows from following lemma: Lemma 26 In the {4, 3, 3, 5} tessellation, every loop of edges has at least one subpath of length at most 8 which is not minimal. Lemma 26 is proven in the appendix.

With Lemma 26 at hand, it is now easy to design a local decoder:

• From every edge of the syndrome, explore every path of edges in the syndrome of length at most 8.

• If such a path is not minimal, flip qubits to decrease its length.

• Iterate, until no non-minimal path of length at most 8 can be found.

While the complexity of the Z-decoder appears at first sight to be quadratic in the size of the syndrome, it can be made linear if one only explores in the (i + 1) th step paths that were not already explored during the i-th round of the algorithm. Indeed flipping a qubit only affects a constant number of paths of length at most 8. Moreover, as long as the error weight is below the injectivity radius of the manifold, or if the error consists of many such small connected components, then the syndrome weight is proportional to the error weight. This fact comes from the hyperbolicity of the tessellation. In other words, the decoding algorithm has a complexity linear in the error weight.

Decoding X-errors

We now turn our attention to decoding X-errors. An X-decoder takes as input a syndrome on Z-type stabilizers and outputs a set of X-errors consistent with this syndrome. For golden codes, Z-type stabilizers are defined by polyhedrons (3-faces) in the {4, 3, 3, 5} tessellation. It is more convenient for us to work with edges than with polyhedrons. We therefore consider the {5, 3, 3, 4} dual tessellation. With this point of view, Z-type stabilizers are defined by edges in the {5, 3, 3, 4} dual tessellation.

The X-decoder follows from the following lemma: Lemma 27 In the {5, 3, 3, 4} tessellation, every loop of edges has at least one subpath incident to a single 4-face and which is not minimal. Lemma 27 is proven in the appendix.

With Lemma 27 at hand, it is now easy to design a local decoder:

• From every edge of the syndrome, explore every path of edges in the syndrome incident to a single 4-face.

• If such a path is not minimal, flip qubits to decrease its length.

• Iterate, until no non-minimal path incident to a single 4-face can be found.

The complexity of this X-decoder is linear in the size of the error for the same reason as the Z-decoder.

In this work, we have presented a variant of the quantum LDPC code family due to Guth and Lubotzky. Like theirs, our family is also obtained by considering tessellations of hyperbolic 4-space, but the crucial new feature of our construction is that the tessellation is regular. We then exploit this regularity to design an efficient and explicit decoding algorithm that provably corrects arbitrary errors of weight O(log n) and decodes with high probability random independent and identically distributed errors provided the error rate is below some constant threshold.

We note that both the dimension 4 and hyperbolicity present advantages for decoding. Placing the qubits on 2-faces yields syndromes which are cycles of edges (or of coedges) and a decoder should simply try to shorten such cycles, which can be done efficiently by means of a local algorithm as we demonstrated. This algorithm is also more efficient in hyperbolic space since the syndrome weight increases linearly with the error weight (for small errors). This is arguably simpler than pairing vertices as required in surface codes. Another advantage of 1-dimensional syndromes is that they contain redundant information, which should be helpful when considering more realistic scenarios where syndrome measurements are not assumed to be ideal.

Future work should focus on simulating the performance of hyperbolic 4-dimensional codes with respect to different error models. Although the code family based on quotienting by arithmetic subgroups is arguably out of reach for simulations, it will be interesting to consider quotienting by different normal subgroups, yielding codes of more reasonable size. While the bounds on the minimum distance would not apply anymore in that case, we expect the behaviour of the decoding algorithm to be essentially identical for the usual error models.

subpath of length at most 4 which is not minimal.

Proof: Equivalently, in the {4, 5} tessellation of hyperbolic plane every loop of edges admits at least one of the two subpaths depicted on It is sufficient to prove it on a single loop of edges of the {4, 5} tessellation of hyperbolic plane. We choose an arbitrary orientation on this loop. An edge e is written e = {v 1 , v 2 } if it is oriented from v 1 to v 2 . To each edge e = {v 1 , v 2 } we assign a cone C e defined as the set of points of hyperbolic plane closer to e than to any other edge incident to v 2 . The cone C e divides the hyperbolic plane in two regions: the outside of the cone and the inside of the cone. We suppose by contradiction that there exists a loop L of edges in the {4, 5} tessellation of hyperbolic plane such that every subpath of L of length at most 4 is minimal. Figure A.2 shows by an exhaustive search that for any edge e, there exists f in L \ {e} such that C f con-tains C e . By immediate induction, it is then possible to construct a sequence (e i ) i∈N of edges in L such that j > i implies that C ej contains C ei . This contradicts the fact that L is a loop.

We can now prove Lemma 26. Proof [of Lemma 26]: It follows the exact same line. To each edge e = {v 1 , v 2 }, we assign a cone C e defined as the set of points of hyperbolic 4-space closer to e than to any other edge incident to v 2 . Since the number of length 8 paths on the edge graph of the {4, 3, 3, 5} tessellation is too high to check every case manually, we used a computer program to find that every minimal path of length 8 contains a subpath such that the cone assigned to its last edge contains the cone assigned to its first edge. Therefore in order to form a loop, at least one subpath of length at most 8 has to not be minimal. The decoder consists in flipping qubits in order to shorten this subpath.

√ 5 2 . 4 . 2

 242 Arithmetic subgroups Γ {4,3,3,5} (I) Since φ and its square root are algebraic numbers, Q( √ φ) is a number field. Its ring of integers is Z[ √ φ], and therefore every matrix of Γ {4,3,3,5} has its coefficients in the ring Z[ √ φ].

√ 5 ) 5 √ 5 )

 555 in C are the identity and the embedding determined by √ is thus a totally real number field. Definition 13 Let I be an ideal of a ring A. Let G be a matrix group with coefficients in A. The principal congruence subgroup of level I of G is the kernel of the reduction modulo I morphism. It is denoted G(I) = ker π I with

Definition 14

 14 Let H be a subgroup of a group G. The index of H in G, denoted [G : H], is the cardinal of the quotient G/H. Lemma 15 The number of 2-faces of the {4, 3, 3, 5} tessellation of M(I) is n(I) = [Γ {4,3,3,5} : Γ {4,3,3,5} (I)]/80. Proof: M(I) admits a tessellation by [Γ {4,3,3,5} : Γ {4,3,3,5} (I)] simplices isometric to a fundamental domain of the action of Γ {4,3,3,5} on H 4 . A 2-face of the {4, 3, 3, 5} tessellation of M(I) corresponds to a coset of S 2,I in Γ {4,3,3,5} (I). The result follows from the value of the cardinal of S 2,I : |S 2,I | = |S 2 | = | r 0 , r 1 | × | r 3 , r 4 | = 8 × 10 = 80. Definition 16 The norm N (I) of an ideal I of a ring A is the cardinal of the quotient A/I.

  -Chern theorem also yields χ(T ) = c vol(T ).n(I) = #(2-faces)

0 + y 1 +

 1 ... + y 4 | = |N (y 0 + y 1 + ... + y 4 )| |σ(y 0 + y 1 + ... + y 4 )| ≥ N (I) 2 4 |σ(y 0 )| + |σ(y 1 )| + ... + |σ(y 4 )| ≥ N (I) 2 40 .

5 2 1 . 5

 515 ×20 0.4 n(I) 0.1 ≈ 0.53 n(I) 0.1 .

  ideals we have found have norm 4, 5, 9, 11. The ideal whose norm is 4 is 2Z[φ]. But we have to ignore this ideal because r 0,2Z[φ] is the identity. The ideal whose norm is 5 is√ 5Z[φ]. It corresponds to a number of qubits of the order of 5 10 ≈ 10 7 .More precisely, we can compute an upper bound on the cardinal of π I (Γ {4,3,3,5} ) for the idealI = √ 5Z[φ]. Since Z[φ]/( √ 5Z[φ]) is the finite field F 5 , π √ 5Z[φ] (Γ {4,3,3,5} ) is isomorphicto a subgroup of the orthogonal group with dimension 5 and entries in F 5 . Using the result of [29], Sec. 3.7.2 p. 72, we obtain |π √ 5Z[φ] (Γ {4,3,3,5} )| ≤ 18 720 000. Moreover, since φ + √ 5Z[φ] in Z[φ]/( √ 5Z[φ]) corresponds to 3 in F 5 , we have the following generating set for π √ 5Z[φ] (Γ {4,3,3,5} ):

  Fig. A.1.

Fig. A. 1 .

 1 Fig. A.1. In the {4, 5} tessellation of hyperbolic plane, every loop of edges contains one of the two subpaths in red. These two subpaths are not minimal: they can be replaced by the shorter green ones by flipping one or two qubits. (source for image: [31])

Fig. A. 2 .

 2 Fig. A.2. The dark blue cone assigned to the last edge of the path contains the light blue cone assigned to the first edge of the path. Every minimal path of length 4 contains one of these six subpaths (or a subpath symmetric to it). Therefore if every length 4 subpath is minimal, it is impossible to form a loop. (source for image: [31])

Fig. B. 2 .

 2 Fig. B.2. Every loop L in the {5, 4} tessellation has a subpath S consisting of three edges incident to the same pentagon. S is not minimal since it can be replaced by a path of length 2. A similar property holds for loops in the {5, 3, 3, 4} tessellation. (source for image: [31])

Acknowledgements

We thank Gilles Zémor for introducing the authors to the construction of [1] and for fruitful discussions on tessellations and homological codes. We thank Nicolas Bergeron for mentioning the arithmeticity of the discrete isometry groups corresponding to regular tessellations of hyperbolic 4-space. We also thank Benjamin Audoux, Alain Couvreur, Antoine Grospellier, Anirudh Krishna and Jean-Pierre Tillich for useful discussions on quantum codes. We are also truly grateful for the very detailed comments provided by an anonymous referee and which helped us to significantly improve our exposition. We acknowledge support from the ANR through the QuantERA project QCDA.

Appendix A: Proof of the Z-decoder Lemma Before proving Lemma 26, we first establish a 2-dimensional version of it. Even though this 2-dimensional version is irrelevant to decoding homological quantum codes, it allows us to illustrate the main ideas with figures and may help the reader understand the key role of hyperbolicity in Lemma 26.

Lemma 28

In the {4, 5} tessellation of hyperbolic plane, every loop of edges has at least one Appendix B: Proof of the X-decoder Lemma Before proving Lemma 27 we prove a 2-dimensional version of it. Even though the 2dimensional version is irrelevant to decoding homological quantum codes, it allows us to illustrate the main ideas with figures and may help the reader understand the key role of hyperbolicity in Lemma 27.

Lemma 29 In the {5, 4} tessellation of hyperbolic plane, every loop of edges admits at least one subpath incident to a single pentagon and which is not minimal.

Equivalently, in the {5, 4} tessellation of hyperbolic plane every loop of edges has at least one subpath consisting of three edges incident to the same pentagon. After flipping the qubit corresponding to this pentagon, this subpath of length 3 (or 4) is replaced by a subpath of length 2 (or 1) and thus the syndrome weight is reduced. We denote these two subpaths by L g and L r . Without loss of generality, assume that the geodesic line H is extremal with respect to L g in the sense that every edge in L g is incident to a pentagon incident to an edge of H. This is illustrated in Fig B .2(b). Without loss of generality, assume that the edge of L g incident to v 1 does not belong to the extremal geodesic line H. If there exists a pentagon P such that every edge in L g is incident to P , then L g is not minimal because the path in the geodesic line H going from v 1 to v 2 consists of a single edge. It is thus shorter than L g and Lemma 29 is proven in this case. If such a pentagon P doesn't exist, we denote by w the last vertex of L g such that every which intersects the loop L at two of its vertices v 1 and v 2 . Vertices v 1 and v 2 define a partition of L into two subpaths. We denote these two subpaths by L g and L r . Without loss of generality, assume that the geodesic hyperplane H is extremal with respect to L g in the sense that every edge in L g is incident to a 4-face incident to an edge of H. This is illustrated in Fig. B.2(b). Without loss of generality, assume that the edge of L g incident to v 1 does not belong to the extremal geodesic hyperplane H. If there exists a 4-face P such that every edge in L g is incident to P , then L g is not minimal. Indeed the path in the geodesic hyperplane H going from v 1 to v 2 is shorter than L g and Lemma 27 is proven in this case. If such a 4-face P doesn't exist, we denote by w the last vertex of L g such that every vertex between v 1 and w in L g is incident to a single 4-face (see Fig. B.2(c)). We consider the subpath S of L g going from v 1 to w. S is incident to a single 4-face. We denote by x the vertex of H at edge-distance 1 from w. We define S as one of the shortest path in H going from v 1 to x concatenated with the single edge path going from x to w (see Fig. B.2(d)). An exhaustive search on the 1-skeleton of a 120-cell shows that S is always shorter than S.