François Arnault
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
François Arnault has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Nicolas Saussay
XLIM UMR 7252 Université de Limoges 123, Avenue Albert Thomas 87000 Limoges France
5 shared publications - Philippe Gaborit
XLIM, UMR 7252, Universit de Limoges, Limoges, France
5 shared publications - Gilles Zémor
IMB UMR 5251 Université de Bordeaux France
3 shared publications - Thierry P. Berger
Université de Limoges, XLIM, UMR 7252
3 shared publications - Wouter Rozendaal
IMB UMR 5251 Université de Bordeaux France
3 shared publications - Don Jean Baptiste Anoman2 shared publications
Latest Publications
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 26, 32-39
Upper bounds on the minimum distance of LDPC codes with double diagonal parity checks
We investigate the minimum distance of structured binary Low-Density Parity-Check (LDPC) codes whose parity-check matrices are of the form $ [ \mathbf{C} \, \vert \, \mathbf{M}] $ where $ \mathbf{C} $ is circulant and of column weight $ 2 $, and $ \mathbf{M} $ has fixed column weight $ r \geq 3 $ and row weight at least $ 1 $. These codes are of interest because they are LDPC codes which come with a natural linear-time encoding algorithm. We show that the minimum distance of these codes is in $ O(n^{\frac{r-2}{r-1} + \epsilon}) $, where $ n $ is the code length and $ \epsilon > 0 $ is arbitrarily small. This improves the previously known upper bound in $ O(n^{\frac{r-1}{r}}) $ on the minimum distance of such codes. Additionally, we show that the new upper bound also applies to the class of repeat-accumulate codes.- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 26, 32-39
Upper bounds on the minimum distance of LDPC codes with double diagonal parity checks
We investigate the minimum distance of structured binary Low-Density Parity-Check (LDPC) codes whose parity-check matrices are of the form $ [ \mathbf{C} \, \vert \, \mathbf{M}] $ where $ \mathbf{C} $ is circulant and of column weight $ 2 $, and $ \mathbf{M} $ has fixed column weight $ r \geq 3 $ and row weight at least $ 1 $. These codes are of interest because they are LDPC codes which come with a natural linear-time encoding algorithm. We show that the minimum distance of these codes is in $ O(n^{\frac{r-2}{r-1} + \epsilon}) $, where $ n $ is the code length and $ \epsilon > 0 $ is arbitrarily small. This improves the previously known upper bound in $ O(n^{\frac{r-1}{r}}) $ on the minimum distance of such codes. Additionally, we show that the new upper bound also applies to the class of repeat-accumulate codes.- Open Access
(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes
Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero elements per row. Leveraging a lower bound on their minimum distance, we construct three novel infinite families of optimal (2,2)-GB codes with parameters [[ 2n^2, 2, n ]], [[ 4r^2, 2, 2r ]], and [[(2t + 1)^2 + 1, 2, 2t + 1 ]]. These families match the performance of Kitaev's toric code and the best 2D weight-4 surface codes, reaching known theoretical limits. In particular, the second family breaks a long-held belief by providing optimal even-distance GB codes, previously deemed impossible. All are CSS codes derived from Cayley graphs. Recognizing that standard equivalence relations do not preserve their CSS structure, we introduce a CSS-preserving equivalence relation for rigorous comparison of Cayley graph-based CSS codes. Under this framework, the first two families are inequivalent to all previously known optimal weight-4 2D surface codes, while the third family is equivalent to the best-known odd-distance 2D surface code. Finally, we classify all extremal, non-equivalent (2,2)-GB codes with length below 200 and present a comparison table with existing notable 2D weight-4 surface codes.
Open Access(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes
Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero elements per row. Leveraging a lower bound on their minimum distance, we construct three novel infinite families of optimal (2,2)-GB codes with parameters [[ 2n^2, 2, n ]], [[ 4r^2, 2, 2r ]], and [[(2t + 1)^2 + 1, 2, 2t + 1 ]]. These families match the performance of Kitaev's toric code and the best 2D weight-4 surface codes, reaching known theoretical limits. In particular, the second family breaks a long-held belief by providing optimal even-distance GB codes, previously deemed impossible. All are CSS codes derived from Cayley graphs. Recognizing that standard equivalence relations do not preserve their CSS structure, we introduce a CSS-preserving equivalence relation for rigorous comparison of Cayley graph-based CSS codes. Under this framework, the first two families are inequivalent to all previously known optimal weight-4 2D surface codes, while the third family is equivalent to the best-known odd-distance 2D surface code. Finally, we classify all extremal, non-equivalent (2,2)-GB codes with length below 200 and present a comparison table with existing notable 2D weight-4 surface codes.
- Open Access
On the Generalization of Kitaev Codes as Generalized Bicycle Codes
Surface codes have historically been the dominant choice for quantum error correction due to their superior error threshold performance. However, recently, a new class of Generalized Bicycle (GB) codes, constructed from binary circulant matrices with three non-zero elements per row, achieved comparable performance with fewer physical qubits and higher encoding efficiency. In this article, we focus on a subclass of GB codes, which are constructed from pairs of binary circulant matrices with two non-zero elements per row. We introduce a family of codes that generalizes both standard and optimized Kitaev codes for which we have a lower bound on their minimum distance, ensuring performance better than standard Kitaev codes. These codes exhibit parameters of the form $ [| 2n , 2, \geq \sqrt{n} |] $ where $ n$ is a factor of $ 1 + d^2 $. For code lengths below 200, our analysis yields $21$ codes, including $7$ codes from Pryadko and Wang's database, and unveils $14$ new codes with enhanced minimum distance compared to standard Kitaev codes. Among these, $3$ surpass all previously known weight-4 GB codes for distances $4$, $8$, and $12$.Open AccessOn the Generalization of Kitaev Codes as Generalized Bicycle Codes
Surface codes have historically been the dominant choice for quantum error correction due to their superior error threshold performance. However, recently, a new class of Generalized Bicycle (GB) codes, constructed from binary circulant matrices with three non-zero elements per row, achieved comparable performance with fewer physical qubits and higher encoding efficiency. In this article, we focus on a subclass of GB codes, which are constructed from pairs of binary circulant matrices with two non-zero elements per row. We introduce a family of codes that generalizes both standard and optimized Kitaev codes for which we have a lower bound on their minimum distance, ensuring performance better than standard Kitaev codes. These codes exhibit parameters of the form $ [| 2n , 2, \geq \sqrt{n} |] $ where $ n$ is a factor of $ 1 + d^2 $. For code lengths below 200, our analysis yields $21$ codes, including $7$ codes from Pryadko and Wang's database, and unveils $14$ new codes with enhanced minimum distance compared to standard Kitaev codes. Among these, $3$ surpass all previously known weight-4 GB codes for distances $4$, $8$, and $12$. - Open Access
A Variant of the Bravyi-Terhal Bound for Arbitrary Boundary Conditions
We present a modified version of the Bravyi-Terhal bound that applies to quantum codes defined by local parity-check constraints on a $D$-dimensional lattice quotient. Specifically, we consider a quotient $\mathbb{Z}^D/Λ$ of $\mathbb{Z}^D$ of cardinality $n$, where $Λ$ is some $D$-dimensional sublattice of $\mathbb{Z}^D$: we suppose that every vertex of this quotient indexes $m$ qubits of a stabilizer code $C$, which therefore has length $nm$. We prove that if all stabilizer generators act on qubits whose indices lie within a ball of radius $ρ$, then the minimum distance $d$ of the code satisfies $d \leq m\sqrt{γ_D}(\sqrt{D} + 4ρ)n^\frac{D-1}{D}$ whenever $n^{1/D} \geq 8ρ\sqrt{γ_D}$, where $γ_D$ is the $D$-dimensional Hermite constant. We apply this bound to derive an upper bound on the minimum distance of Abelian Two-Block Group Algebra (2BGA) codes whose parity-check matrices have the form $[\mathbf{A} \, \vert \, \mathbf{B}]$ with each submatrix representing an element of a group algebra over a finite abelian group.Open AccessA Variant of the Bravyi-Terhal Bound for Arbitrary Boundary Conditions
We present a modified version of the Bravyi-Terhal bound that applies to quantum codes defined by local parity-check constraints on a $D$-dimensional lattice quotient. Specifically, we consider a quotient $\mathbb{Z}^D/Λ$ of $\mathbb{Z}^D$ of cardinality $n$, where $Λ$ is some $D$-dimensional sublattice of $\mathbb{Z}^D$: we suppose that every vertex of this quotient indexes $m$ qubits of a stabilizer code $C$, which therefore has length $nm$. We prove that if all stabilizer generators act on qubits whose indices lie within a ball of radius $ρ$, then the minimum distance $d$ of the code satisfies $d \leq m\sqrt{γ_D}(\sqrt{D} + 4ρ)n^\frac{D-1}{D}$ whenever $n^{1/D} \geq 8ρ\sqrt{γ_D}$, where $γ_D$ is the $D$-dimensional Hermite constant. We apply this bound to derive an upper bound on the minimum distance of Abelian Two-Block Group Algebra (2BGA) codes whose parity-check matrices have the form $[\mathbf{A} \, \vert \, \mathbf{B}]$ with each submatrix representing an element of a group algebra over a finite abelian group. - Open Access
Upper Bounds on the Minimum Distance of Structured LDPC Codes
We investigate the minimum distance of structured binary Low-Density Parity-Check (LDPC) codes whose parity-check matrices are of the form $[\mathbf{C} \vert \mathbf{M}]$ where $\mathbf{C}$ is circulant and of column weight $2$, and $\mathbf{M}$ has fixed column weight $r \geq 3$ and row weight at least $1$. These codes are of interest because they are LDPC codes which come with a natural linear-time encoding algorithm. We show that the minimum distance of these codes is in $O(n^{\frac{r-2}{r-1} + ε})$, where $n$ is the code length and $ε> 0$ is arbitrarily small. This improves the previously known upper bound in $O(n^{\frac{r-1}{r}})$ on the minimum distance of such codes.Open AccessUpper Bounds on the Minimum Distance of Structured LDPC Codes
We investigate the minimum distance of structured binary Low-Density Parity-Check (LDPC) codes whose parity-check matrices are of the form $[\mathbf{C} \vert \mathbf{M}]$ where $\mathbf{C}$ is circulant and of column weight $2$, and $\mathbf{M}$ has fixed column weight $r \geq 3$ and row weight at least $1$. These codes are of interest because they are LDPC codes which come with a natural linear-time encoding algorithm. We show that the minimum distance of these codes is in $O(n^{\frac{r-2}{r-1} + ε})$, where $n$ is the code length and $ε> 0$ is arbitrarily small. This improves the previously known upper bound in $O(n^{\frac{r-1}{r}})$ on the minimum distance of such codes. - Open Access
Quantum Random Number Generator based on Violations of the Free CHSH-3 Inequality
We describe a protocol for generating random numbers based on the existence of quantum violations of a free Clauser-Horne-Shimony-Holt inequality, namely CHSH-3. Our method uses semidefinite programming relaxations to compute such violations. In a standard setting the CHSH-3 inequality involves two separated qutrits and compatible measurement, that is, commuting with each other, yielding the known quantum bound of $1+\sqrt{11/3} \approx 2.9149$. In our framework, $d$-dimensional quantum systems (qudits) where $d$ is not fixed a priori, and measurement operators possibly not compatible, are allowed. This loss of constraints yields a higher value for the maximum expectation of the CHSH-3 inequality. Based on such upper bound on the violation of CHSH-3, we develop a random number generator of type prepare-and-measure, but with one part. Our protocol generates a maximal entropy and its security is based, through self testing arguments, on the attainability of the maximal violation of the free CHSH-3 for quantum systems.Open AccessQuantum Random Number Generator based on Violations of the Free CHSH-3 Inequality
We describe a protocol for generating random numbers based on the existence of quantum violations of a free Clauser-Horne-Shimony-Holt inequality, namely CHSH-3. Our method uses semidefinite programming relaxations to compute such violations. In a standard setting the CHSH-3 inequality involves two separated qutrits and compatible measurement, that is, commuting with each other, yielding the known quantum bound of $1+\sqrt{11/3} \approx 2.9149$. In our framework, $d$-dimensional quantum systems (qudits) where $d$ is not fixed a priori, and measurement operators possibly not compatible, are allowed. This loss of constraints yields a higher value for the maximum expectation of the CHSH-3 inequality. Based on such upper bound on the violation of CHSH-3, we develop a random number generator of type prepare-and-measure, but with one part. Our protocol generates a maximal entropy and its security is based, through self testing arguments, on the attainability of the maximal violation of the free CHSH-3 for quantum systems. - Open Access
Random generation with the spin of a qutrit
We consider the use of a single qutrit for random generation. This is possible because single qutrits exhibit contextuality features. We aim to optimize the entropy of the generated sequence. To do this, we do not rely on the KCBS inequality but instead on the use of a specific state and a check for fidelity. By the way, we show that this check can be considered as a variant of the CHSH inequality applied to pairs of photons or spin-1/2 particles (qutrits are often realized as a pair of indistinguishable qubits). The physical realisation of this random generator should be eased by the fact it needs only to implement spin operations and measurement, not general $\SU(3)$ qutrit manipulations.Open AccessRandom generation with the spin of a qutrit
We consider the use of a single qutrit for random generation. This is possible because single qutrits exhibit contextuality features. We aim to optimize the entropy of the generated sequence. To do this, we do not rely on the KCBS inequality but instead on the use of a specific state and a check for fidelity. By the way, we show that this check can be considered as a variant of the CHSH inequality applied to pairs of photons or spin-1/2 particles (qutrits are often realized as a pair of indistinguishable qubits). The physical realisation of this random generator should be eased by the fact it needs only to implement spin operations and measurement, not general $\SU(3)$ qutrit manipulations. - 1 January 2015
- Published by Springer Nature
- p. 3-13
Multidimensional Bell Inequalities and Quantum Cryptography
- 1 January 2015
- Published by Springer Nature
- p. 3-13
Multidimensional Bell Inequalities and Quantum Cryptography
- Open Access
A qutrit Quantum Key Distribution protocol with better noise resistance
The Ekert quantum key distribution protocol uses pairs of entangled qubits and performs checks based on a Bell inequality to detect eavesdropping. The 3DEB protocol uses instead pairs of entangled qutrits to achieve better noise resistance than the Ekert protocol. It performs checks based on a Bell inequality for qutrits named CHSH-3. In this paper, we present a new protocol, which also uses pairs of entangled qutrits, but achieves even better noise resistance than 3DEB. This gain of performance is obtained by using another inequality called here hCHSH-3. As the hCHSH3 inequality involve products of observables which become incompatible when using quantum states, we show how the parties running the protocol can measure the violation of hCHSH3 in the presence of noise, to ensure the secrecy of the key.
Open AccessA qutrit Quantum Key Distribution protocol with better noise resistance
The Ekert quantum key distribution protocol uses pairs of entangled qubits and performs checks based on a Bell inequality to detect eavesdropping. The 3DEB protocol uses instead pairs of entangled qutrits to achieve better noise resistance than the Ekert protocol. It performs checks based on a Bell inequality for qutrits named CHSH-3. In this paper, we present a new protocol, which also uses pairs of entangled qutrits, but achieves even better noise resistance than 3DEB. This gain of performance is obtained by using another inequality called here hCHSH-3. As the hCHSH3 inequality involve products of observables which become incompatible when using quantum states, we show how the parties running the protocol can measure the violation of hCHSH3 in the presence of noise, to ensure the secrecy of the key.
- Open Access
Formes quadratiques de discriminants emboîtés
Quadratic forms with embedded discriminants. Integral binary quadratic forms have multiple applications, for example in factorization or cryptography. The Nice family of cryptographic systems makes use of quadratic forms with different discriminants $\pm p$, and $\pm pq^2$ where $p$, $q$ are large primes. This paper shows the precise links between forms with $D$ discriminant and forms with $Df^2$ discriminant, which are crucial in the analysis of the systems Nice and theirs attacks. We also introduce the notion of semi-equivalence of binary quadratic forms, and give some characterizations of semi-equivalent forms, which are useful in the analysis of these attacks. ----- Les formes quadratiques binaires fournissent un moyen explicite pour manipuler des id\'eaux de corps quadratiques, et leurs applications pratiques sont multiples. De nombreux algorithmes de factorisation les utilisent. Elle sont aussi utilis\'ees en cryptographie, en particulier pour les syst\`emes Nice. Les syst\`emes de chiffrement Nice utilisent des formes quadratiques de discriminants $\pm p$ et $\pm pq^2$ o\`u $p$ et $q$ sont des nombres premiers. Cet article pr\'ecise les liens entre les formes de discriminant $D$ et celles de discriminant $Df^2$, ce qui est essentiel pour l'analyse de Nice et de ses attaques. Il introduit aussi la notion de formes quadratiques semi-\'equivalentes et en explicite plusieurs caract\'erisations, utiles pour l'analyse de ces attaques.Open AccessFormes quadratiques de discriminants emboîtés
Quadratic forms with embedded discriminants. Integral binary quadratic forms have multiple applications, for example in factorization or cryptography. The Nice family of cryptographic systems makes use of quadratic forms with different discriminants $\pm p$, and $\pm pq^2$ where $p$, $q$ are large primes. This paper shows the precise links between forms with $D$ discriminant and forms with $Df^2$ discriminant, which are crucial in the analysis of the systems Nice and theirs attacks. We also introduce the notion of semi-equivalence of binary quadratic forms, and give some characterizations of semi-equivalent forms, which are useful in the analysis of these attacks. ----- Les formes quadratiques binaires fournissent un moyen explicite pour manipuler des id\'eaux de corps quadratiques, et leurs applications pratiques sont multiples. De nombreux algorithmes de factorisation les utilisent. Elle sont aussi utilis\'ees en cryptographie, en particulier pour les syst\`emes Nice. Les syst\`emes de chiffrement Nice utilisent des formes quadratiques de discriminants $\pm p$ et $\pm pq^2$ o\`u $p$ et $q$ sont des nombres premiers. Cet article pr\'ecise les liens entre les formes de discriminant $D$ et celles de discriminant $Df^2$, ce qui est essentiel pour l'analyse de Nice et de ses attaques. Il introduit aussi la notion de formes quadratiques semi-\'equivalentes et en explicite plusieurs caract\'erisations, utiles pour l'analyse de ces attaques.