Alexis Morvan

Alexis Morvan

Auto-generated profile, based on publicly available information

Alexis Morvan

Google Research, Mountain View, CA, USA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
22 February 2023 in Nature
Verified
Journal Article
Open access
PDF file
RARajeev Acharya
Rajeev Acharya
IAIgor Aleiner
Igor Aleiner
RARichard Allen
Richard Allen
TATrond I. Andersen
Trond I. Andersen
MAMarkus Ansmann
Markus Ansmann
NZNingfeng Zhu
Ningfeng Zhu
Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10−6 logical error per cycle floor set by a single high-energy event (1.6 × 10−7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.

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.

9 April 2021 in Physical Review X
Verified
Journal Article
Open access
PDF file
MBM. S. Blok
M. S. Blok
VRV. V. Ramasesh
V. V. Ramasesh
TST. Schuster
T. Schuster
KOK. O’bRien
K. O’bRien
JKJ. M. Kreikebaum
J. M. Kreikebaum
ISI. Siddiqi
I. Siddiqi
The dynamics of quantum information in strongly interacting systems, known as quantum information scrambling, has recently become a common thread in our understanding of black holes, transport in exotic non-Fermi liquids, and many-body analogs of quantum chaos. To date, verified experimental implementations of scrambling have focused on systems composed of two-level qubits. Higher-dimensional quantum systems, however, may exhibit different scrambling modalities and are predicted to saturate conjectured speed limits on the rate of quantum information scrambling. We take the first steps toward accessing such phenomena, by realizing a quantum processor based on superconducting qutrits (three-level quantum systems). We demonstrate the implementation of universal two-qutrit scrambling operations and embed them in a five-qutrit quantum teleportation protocol. Measured teleportation fidelities Favg=0.568±0.001 confirm the presence of scrambling even in the presence of experimental imperfections and decoherence. Our teleportation protocol, which connects to recent proposals for studying traversable wormholes in the laboratory, demonstrates how quantum technology that encodes information in higher-dimensional systems can exploit a larger and more connected state space to achieve the resource efficient encoding of complex quantum circuits.

24 November 2021 in Physical Review X
Verified
Journal Article
Open access
PDF file
AHAkel Hashim
Akel Hashim
RNRavi K. Naik
Ravi K. Naik
AMAlexis Morvan
Alexis Morvan
JVJean-Loup Ville
Jean-Loup Ville
BMBradley Mitchell
Bradley Mitchell
ISIrfan Siddiqi
Irfan Siddiqi
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error that has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors and therefore do not reliably predict the global performance of quantum algorithms, leaving us unprepared to validate the accuracy of future large-scale quantum computations. Randomized compiling is a protocol designed to overcome these performance limitations by converting coherent errors into stochastic noise, dramatically reducing unpredictable errors in quantum algorithms and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking. In this work, we demonstrate significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor. Additionally, we accurately predict algorithm performance using experimentally measured error rates. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors, paving the way forward for scalable quantum computing.

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.

18 October 2023 in Nature
Verified
Journal Article
Open access
PDF file
JHJ. C. Hoke
J. C. Hoke
MIM. Ippoliti
M. Ippoliti
ERE. Rosenberg
E. Rosenberg
DAD. Abanin
D. Abanin
RAR. Acharya
R. Acharya
PRP. Roushan
P. Roushan
Measurement has a special role in quantum theory1: by collapsing the wavefunction, it can enable phenomena such as teleportation2 and thereby alter the ‘arrow of time’ that constrains unitary evolution. When integrated in many-body dynamics, measurements can lead to emergent patterns of quantum information in space–time3–10 that go beyond the established paradigms for characterizing phases, either in or out of equilibrium11–13. For present-day noisy intermediate-scale quantum (NISQ) processors14, the experimental realization of such physics can be problematic because of hardware limitations and the stochastic nature of quantum measurement. Here we address these experimental challenges and study measurement-induced quantum information phases on up to 70 superconducting qubits. By leveraging the interchangeability of space and time, we use a duality mapping9,15–17 to avoid mid-circuit measurement and access different manifestations of the underlying phases, from entanglement scaling3,4 to measurement-induced teleportation18. We obtain finite-sized signatures of a phase transition with a decoding protocol that correlates the experimental measurement with classical simulation data. The phases display remarkably different sensitivity to noise, and we use this disparity to turn an inherent hardware limitation into a useful diagnostic. Our work demonstrates an approach to realizing measurement-induced physics at scales that are at the limits of current NISQ processors.