activity
20102025
most citedQuantum entanglement from random measurements

57 citations · 86 across the 7 of their papers we have counts for

collaborators

7 papers

cs.IT2025

(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes

François Arnault, Philippe Gaborit, Nicolas Saussay

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…

quant-ph2025

A Variant of the Bravyi-Terhal Bound for Arbitrary Boundary Conditions

François Arnault, Philippe Gaborit, Wouter Rozendaal +2

We present a modified version of the Bravyi-Terhal bound that applies to quantum codes defined by local parity-check constraints on a -dimensional lattice quotient. Specifically…

quant-ph2014★ 57 cited

Quantum entanglement from random measurements

Minh Cong Tran, Borivoje Dakic, Francois Arnault +2

We show that the expectation value of squared correlations measured along random local directions is an identifier of quantum entanglement in pure states which can be directly expe…

quant-ph2014★ 3 cited

A qutrit Quantum Key Distribution protocol with better noise resistance

François Arnault, Zoé Amblard

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 pa…

quant-ph2011★ 17 cited

A complete set of multidimensional Bell inequalities

François Arnault

We give a multidimensional generalisation of the complete set of Bell-correlation inequalities given by Werner and Wolf, and by Zukowski and Brukner, for the two-dimensional case.…

math.NT2010★ 9 cited

Construction of self-dual normal bases and their complexity

François Arnault, Erik Jarl Pickett, Stéphane Vinatier

Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an expli…

cs.CR2010

Revisiting LFSMs

François Arnault, Thierry Berger, Marine Minier +1

Linear Finite State Machines (LFSMs) are particular primitives widely used in information theory, coding theory and cryptography. Among those linear automata, a particular case of…