Élie Genois

Élie Genois

Auto-generated profile, based on publicly available information

Élie Genois

Google Research, Mountain View, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 December 2024 in Nature
Verified
Journal Article
Open access
PDF file
HNHartmut Neven
Hartmut Neven
DADmitry A. Abanin
Dmitry A. Abanin
LALaleh Aghababaie-Beni
Laleh Aghababaie-Beni
IAIgor Aleiner
Igor Aleiner
TATrond I. Andersen
Trond I. Andersen
NZNicholas Zobrist
Nicholas Zobrist
Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of \(\varLambda \mathrm{=2.14}\pm 0.02\) when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit’s lifetime by a factor of \(2.4\pm 0.3\). Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or \(3\) \(\times \) \({10}^{9}\) cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.

25 May 2022 in Nature
Verified
Journal Article
Closed access
PDF file
SKSebastian Krinner
Sebastian Krinner
NLNathan Lacroix
Nathan Lacroix
ARAnts Remm
Ants Remm
APAgustin Di Paolo
Agustin Di Paolo
EGElie Genois
Elie Genois
AWAndreas Wallraff
Andreas Wallraff

9 October 2024 in Nature
Verified
Journal Article
Open access
PDF file
AMA. Morvan
A. Morvan
BVB. Villalonga
B. Villalonga
XMX. Mi
X. Mi
SMS. Mandrà
S. Mandrà
ABA. Bengtsson
A. Bengtsson
SBS. Boixo
S. Boixo
Undesired coupling to the surrounding environment destroys long-range correlations in quantum processors and hinders coherent evolution in the nominally available computational space. This noise is an outstanding challenge when leveraging the computation power of near-term quantum processors1. It has been shown that benchmarking random circuit sampling with cross-entropy benchmarking can provide an estimate of the effective size of the Hilbert space coherently available2,3,4,5,6,7,8. Nevertheless, quantum algorithms’ outputs can be trivialized by noise, making them susceptible to classical computation spoofing. Here, by implementing an algorithm for random circuit sampling, we demonstrate experimentally that two phase transitions are observable with cross-entropy benchmarking, which we explain theoretically with a statistical model. The first is a dynamical transition as a function of the number of cycles and is the continuation of the anti-concentration point in the noiseless case. The second is a quantum phase transition controlled by the error per cycle; to identify it analytically and experimentally, we create a weak-link model, which allows us to vary the strength of the noise versus coherent evolution. Furthermore, by presenting a random circuit sampling experiment in the weak-noise phase with 67 qubits at 32 cycles, we demonstrate that the computational cost of our experiment is beyond the capabilities of existing classical supercomputers. Our experimental and theoretical work establishes the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors.

4 June 2025 in Nature
Verified
Journal Article
Open access
PDF file
TCT. A. Cochran
T. A. Cochran
BJB. Jobst
B. Jobst
ERE. Rosenberg
E. Rosenberg
YLY. D. Lensky
Y. D. Lensky
GGG. Gyawali
G. Gyawali
PRP. Roushan
P. Roushan
Lattice gauge theories (LGTs)1,2,3,4 can be used to understand a wide range of phenomena, from elementary particle scattering in high-energy physics to effective descriptions of many-body interactions in materials5,6,7. Studying dynamical properties of emergent phases can be challenging, as it requires solving many-body problems that are generally beyond perturbative limits8,9,10. Here we investigate the dynamics of local excitations in a \({{\mathbb{Z}}}_{2}\) LGT using a two-dimensional lattice of superconducting qubits. We first construct a simple variational circuit that prepares low-energy states that have a large overlap with the ground state; then we create charge excitations with local gates and simulate their quantum dynamics by means of a discretized time evolution. As the electric field coupling constant is increased, our measurements show signatures of transitioning from deconfined to confined dynamics. For confined excitations, the electric field induces a tension in the string connecting them. Our method allows us to experimentally image string dynamics in a (2+1)D LGT, from which we uncover two distinct regimes inside the confining phase: for weak confinement, the string fluctuates strongly in the transverse direction, whereas for strong confinement, transverse fluctuations are effectively frozen11,12. We also demonstrate a resonance condition at which dynamical string breaking is facilitated. Our LGT implementation on a quantum processor presents a new set of techniques for investigating emergent excitations and string dynamics.

26 May 2025 in Nature
Verified
Journal Article
Open access
PDF file
NLN. Lacroix
N. Lacroix
ABA. Bourassa
A. Bourassa
FHF. J. H. Heras
F. J. H. Heras
LZL. M. Zhang
L. M. Zhang
JBJ. Bausch
J. Bausch
KSK. J. Satzinger
K. J. Satzinger
Quantum error correction [1–4] is essential for bridging the gap between the error rates of physical devices and the extremely low error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors [5–8] have focused primarily on the surface code [9], which offers a high error threshold but poses limitations for logical operations. The color code [10] enables more efficient logic, but it requires more complex stabilizer measurements and decoding. Measuring these stabilizers in planar architectures like superconducting qubits is challenging, and realizations of color codes [11–19] have not addressed performance scaling with code size on any platform. Here, we present a comprehensive demonstration of the color code on a superconducting processor [8]. Scaling the code distance from three to five suppresses logical errors by a factor of Λ3/5 = 1.56(4). Simulations indicate this performance is below the threshold of the color code, and the color code may become more efficient than the surface code following modest device improvements. We test transversal Clifford gates with logical randomized benchmarking [20] and inject magic states [21], a key resource for universal computation, achieving fidelities exceeding 99 % with post-selection. Finally, we teleport logical states between color codes using lattice surgery [22]. This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future.

17 October 2025 in Nature Physics
Verified
Journal Article
Open access
PDF file
AEAlec Eickbusch
Alec Eickbusch
MMMatt McEwen
Matt McEwen
VSVolodymyr Sivak
Volodymyr Sivak
ABAlexandre Bourassa
Alexandre Bourassa
JAJuan Atalaya
Juan Atalaya
AMAlexis Morvan
Alexis Morvan
A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has enabled different codes and implementations that do not rely on static syndrome measurements. Here we experimentally demonstrate three time-dynamic implementations of the surface code, each offering a distinct solution to hardware design challenges faced by surface code realizations. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Finally, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead. We measure the error suppression factor when scaling from distance-3 to distance-5 codes of Λ35,hex = 2.15(2), Λ35,walk = 1.69(6) and Λ35,iSWAP = 1.56(2), achieving state-of-the-art error suppression for each. Our work demonstrates that dynamic circuit approaches meet the demands for fault tolerance and enable alternative strategies for scalable hardware design.