Jérémie Guillaud
Chief of Theory | Alice&Bob
Puteaux, Île-de-France, France
1 k abonnés
+ de 500 relations
Activité
-
What a day for the quantum industry. 🌟 Google Quantum AI has just proven, beyond any reasonable doubt, that Fault-Tolerant Quantum Computing is…
What a day for the quantum industry. 🌟 Google Quantum AI has just proven, beyond any reasonable doubt, that Fault-Tolerant Quantum Computing is…
Aimé par Jérémie Guillaud
-
Exciting new quantum error correction results arxiv.org/abs/2408.13687 Congrats to the team at Google Quantum! They show a logical quantum memory…
Exciting new quantum error correction results arxiv.org/abs/2408.13687 Congrats to the team at Google Quantum! They show a logical quantum memory…
Aimé par Jérémie Guillaud
-
Our Google Quantum AI team just posted a preprint of some exciting recent results. Logical qubits are groups of physical qubits used to achieve…
Our Google Quantum AI team just posted a preprint of some exciting recent results. Logical qubits are groups of physical qubits used to achieve…
Aimé par Jérémie Guillaud
Expérience
Formation
-
École Polytechnique
Engineer’s Degree Applied Mathematics
-
Activités et associations :X-Microfinance
Spécialisation en Mathématiques Appliquées
-
Université Pierre et Marie Curie (Paris VI)
Master’s Degree Applied Mathematics
-
Mathématiques de la Modélisation - Spécialisation Contrôle, Optimisation, Calcul des Variations.
-
Publications
-
Performance Analysis of a Repetition Cat Code Architecture: Computing 256-bit Elliptic Curve Logarithm in 9 Hours with 126 133 Cat Qubits
Physical Review Letters
Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a protection against the remaining phase errors can be ensured by a simple repetition code. We here quantify the cost of a repetition code and provide valuable guidance for the choice of a large scale architecture using cat qubits by realizing a performance analysis based on the computation of discrete…
Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a protection against the remaining phase errors can be ensured by a simple repetition code. We here quantify the cost of a repetition code and provide valuable guidance for the choice of a large scale architecture using cat qubits by realizing a performance analysis based on the computation of discrete logarithms on an elliptic curve with Shor’s algorithm. By focusing on a 2D grid of cat qubits with neighboring connectivity, we propose to implement 2-qubit gates via lattice surgery and Toffoli gates with off-line fault-tolerant preparation of magic states through projective measurements and subsequent gate teleportations. All-to-all connectivity between logical qubits is ensured by routing qubits. Assuming a ratio between single- and two-photon losses of 10−5 and a cycle time of 500 ns, we show concretely that such an architecture can compute a 256-bit elliptic curve logarithm in 9 h with 126 133 cat qubits and on average 19 photons by cat state. We give the details of the realization of Shor’s algorithm so that the proposed performance analysis can be easily reused to guide the choice of architecture for others platforms.
Other authorsSee publication -
Quantum computation with cat qubits
SciPost Physics Lecture Notes
These are the lecture notes from the 2019 Les Houches Summer School on “Quantum In- formation Machines”. After a brief introduction to quantum error correction and bosonic codes, we focus on the case of cat qubits stabilized by a nonlinear multi-photon driven dissipation process. We argue that such a system can be seen as a self-correcting qubit where bit-flip errors are robustly and exponentially suppressed. Next, we provide some experimental directions to engineer such a multi-photon driven…
These are the lecture notes from the 2019 Les Houches Summer School on “Quantum In- formation Machines”. After a brief introduction to quantum error correction and bosonic codes, we focus on the case of cat qubits stabilized by a nonlinear multi-photon driven dissipation process. We argue that such a system can be seen as a self-correcting qubit where bit-flip errors are robustly and exponentially suppressed. Next, we provide some experimental directions to engineer such a multi-photon driven dissipation process with superconducting circuits. Finally, we analyze various logical gates that can be imple- mented without re-introducing bit-flip errors. This set of bias-preserving gates pave the way towards a hardware-efficient and fault-tolerant quantum processor.
Other authorsSee publication -
Two-photon driven Kerr quantum oscillator with multiple spectral degeneracies
Physical Review A
Kerr nonlinear oscillators driven by a two-photon process are promising systems to encode quantum information and to ensure a hardware-efficient scaling towards fault-tolerant quantum computation. In this paper, we show that an extra control parameter, the detuning of the two-photon drive with respect to the oscillator resonance, plays a crucial role in the properties of the defined qubit. At specific values of this detuning, we benefit from strong symmetries in the system, leading to multiple…
Kerr nonlinear oscillators driven by a two-photon process are promising systems to encode quantum information and to ensure a hardware-efficient scaling towards fault-tolerant quantum computation. In this paper, we show that an extra control parameter, the detuning of the two-photon drive with respect to the oscillator resonance, plays a crucial role in the properties of the defined qubit. At specific values of this detuning, we benefit from strong symmetries in the system, leading to multiple degeneracies in the spectrum of the effective confinement Hamiltonian. Overall, these degeneracies lead to a stronger suppression of bit-flip errors. We also study the combination of such Hamiltonian confinement with colored dissipation to suppress leakage outside of the bosonic code space. We show that the additional degeneracies allow us to perform fast and high-fidelity gates while preserving a strong suppression of bit-flip errors.
Other authorsSee publication -
High-performance repetition cat code using fast noisy operations
arXiv:2212.11927
Bosonic cat qubits stabilized by two-photon driven dissipation benefit from exponential suppression of bit-flip errors and an extensive set of gates preserving this protection. These properties make them promising building blocks of a hardware-efficient and fault-tolerant quantum processor. In this paper, we propose a performance optimization of the repetition cat code architecture using fast but noisy CNOT gates for stabilizer measurements. This optimization leads to high thresholds for the…
Bosonic cat qubits stabilized by two-photon driven dissipation benefit from exponential suppression of bit-flip errors and an extensive set of gates preserving this protection. These properties make them promising building blocks of a hardware-efficient and fault-tolerant quantum processor. In this paper, we propose a performance optimization of the repetition cat code architecture using fast but noisy CNOT gates for stabilizer measurements. This optimization leads to high thresholds for the physical figure of merit, given as the ratio between intrinsic single-photon loss rate of the bosonic mode and the engineered two-photon loss rate, as well as a very interesting scaling below threshold of the required overhead, to reach an expected level of logical error rate. Relying on the specific error models for cat qubit operations, this optimization exploits fast parity measurements, using accelerated low-fidelity CNOT gates, combined with fast ancilla parity-check qubits. The significant enhancement in the performance is explained by: 1- the highly asymmetric error model of cat qubit CNOT gates with a major component on control (ancilla) qubits, and 2- the robustness of the error correction performance in presence of the leakage induced by fast operations. In order to demonstrate these performances, we develop a method to sample the repetition code under circuit-level noise that also takes into account cat qubit state leakage.
-
Error rates and resource overheads of repetition cat qubits
Physical Review A
We estimate and analyze the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation. The cat qubits stabilized by two-photon dissipation exhibit an extremely biased noise where the bit-flip error rate is exponentially suppressed with the mean number of photons. In a recent work we suggested that the remaining phase-flip error channel could be suppressed using a one-dimensional repetition code. Indeed, using only…
We estimate and analyze the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation. The cat qubits stabilized by two-photon dissipation exhibit an extremely biased noise where the bit-flip error rate is exponentially suppressed with the mean number of photons. In a recent work we suggested that the remaining phase-flip error channel could be suppressed using a one-dimensional repetition code. Indeed, using only bias-preserving gates on the cat qubits, it is possible to build a universal set of fault-tolerant logical gates at the level of the repetition cat qubit. In this paper we perform Monte Carlo simulations of all the circuits implementing the protected logical gates, using a circuit-level error model. Furthermore, we analyze two different approaches to implement a fault-tolerant Toffoli gate on repetition cat qubits. These numerical simulations indicate that very low logical error rates could be achieved with a reasonable resource overhead, and with parameters that are within the reach of near-term circuit QED experiments.
-
Repetition Cat Qubits for Fault-Tolerant Quantum Computation
Physical Review X
We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative process exhibit a tunable noise bias where the effective bit-flip errors are exponentially suppressed with the average number of photons. We propose a realization of a set of gates on the cat qubits that preserve such a noise bias. Combining these base qubit…
We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative process exhibit a tunable noise bias where the effective bit-flip errors are exponentially suppressed with the average number of photons. We propose a realization of a set of gates on the cat qubits that preserve such a noise bias. Combining these base qubit operations, we build, at the level of the repetition cat qubit, a universal set of fully protected logical gates. This set includes single-qubit preparations and measurements, not, controlled-not, and controlled-controlled-not (Toffoli) gates. Remarkably, this construction avoids the costly magic state preparation, distillation, and injection. Finally, all required operations on the cat qubits could be performed with slight modifications of existing experimental setups.
-
Remote entanglement stabilization and concentration by quantum reservoir engineering
Physical Review A
Quantum information processing in a modular architecture requires the distribution, stabilization, and distillation of entanglement in a qubit network. We present autonomous entanglement stabilization protocols between two superconducting qubits that are coupled to distant cavities. The coupling between cavities is mediated and controlled via a three-wave mixing device that generates either a two-mode squeezed state or a delocalized mode between the remote cavities depending on the pump applied…
Quantum information processing in a modular architecture requires the distribution, stabilization, and distillation of entanglement in a qubit network. We present autonomous entanglement stabilization protocols between two superconducting qubits that are coupled to distant cavities. The coupling between cavities is mediated and controlled via a three-wave mixing device that generates either a two-mode squeezed state or a delocalized mode between the remote cavities depending on the pump applied to the mixer. Local drives on the qubits and the cavities steer and maintain the system to the desired qubit Bell state. Most spectacularly, even a weakly squeezed state can stabilize a maximally entangled Bell state of two distant qubits through an autonomous entanglement concentration process. Moreover, we show that such reservoir-engineering-based protocols can stabilize entanglement in the presence of qubit-cavity asymmetries and losses.
-
The Operator Approach To Entropy Games
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Entropy games and matrix multiplication games have been recently introduced by Asarin et al. They model the situation in which one player (Despot) wishes to minimize the growth rate of a matrix product, whereas the other player (Tribune) wishes to maximize it. We develop an operator approach to entropy games. This allows us to show that entropy games can be cast as stochastic mean payoff games in which some action spaces are simplices and payments are given by a relative entropy…
Entropy games and matrix multiplication games have been recently introduced by Asarin et al. They model the situation in which one player (Despot) wishes to minimize the growth rate of a matrix product, whereas the other player (Tribune) wishes to maximize it. We develop an operator approach to entropy games. This allows us to show that entropy games can be cast as stochastic mean payoff games in which some action spaces are simplices and payments are given by a relative entropy (Kullback-Leibler divergence). In this way, we show that entropy games with a fixed number of states belonging to Despot can be solved in polynomial time. This approach also allows us to solve these games by a policy iteration algorithm, which we compare with the spectral simplex algorithm developed by Protasov.
Other authorsSee publication
Résultats d’examens
-
TOEFL iBT
Résultat : 110
Langues
-
French
Bilingue ou langue natale
-
English
Capacité professionnelle complète
Organisations
-
X-Microfinance
Treasurer
-Evaluation and follow up of local projects in Guatemala, Morocco, and Togo. Management of a 100,000 euros budget.
Plus d’activités de Jérémie
-
Today in QEC on the arXiv: One of the biggest experiments yet! https://lnkd.in/gyfg2MB5 I'm particularly impressed by the number of syndrome…
Today in QEC on the arXiv: One of the biggest experiments yet! https://lnkd.in/gyfg2MB5 I'm particularly impressed by the number of syndrome…
Aimé par Jérémie Guillaud
-
🚀 Breaking News: Major Strides in Quantum Error Correction! 🌟 Hot off the press—today, a significant breakthrough in quantum computing was…
🚀 Breaking News: Major Strides in Quantum Error Correction! 🌟 Hot off the press—today, a significant breakthrough in quantum computing was…
Aimé par Jérémie Guillaud
-
Alice & Bob's recent breakthrough in quantum computing is making waves. Their Boson 4 chip system uses cat qubits to extend bit-flip times from…
Alice & Bob's recent breakthrough in quantum computing is making waves. Their Boson 4 chip system uses cat qubits to extend bit-flip times from…
Aimé par Jérémie Guillaud
-
I’m #hiring a Digital Communication Manager for the exceptional Marketing Team at Alice & Bob! Apply here 👉 https://lnkd.in/eYr_Wkns ⚛ Alice & Bob…
I’m #hiring a Digital Communication Manager for the exceptional Marketing Team at Alice & Bob! Apply here 👉 https://lnkd.in/eYr_Wkns ⚛ Alice & Bob…
Aimé par Jérémie Guillaud
-
Had a great time at the Fault-Tolerant #Quantum Technologies 2024 Workshop in #Benasque, #Spain. Great talks, great discussions and many great…
Had a great time at the Fault-Tolerant #Quantum Technologies 2024 Workshop in #Benasque, #Spain. Great talks, great discussions and many great…
Aimé par Jérémie Guillaud
-
Check out our blog post providing an accessible explanation of our new CliNR scheme for partial quantum error correction.
Check out our blog post providing an accessible explanation of our new CliNR scheme for partial quantum error correction.
Aimé par Jérémie Guillaud
-
My first paper is out ! 📄 The research I did during my time at NarangLab at UCLA is now available on arXiv! URL: arxiv.org/abs/2408.07118 In this…
My first paper is out ! 📄 The research I did during my time at NarangLab at UCLA is now available on arXiv! URL: arxiv.org/abs/2408.07118 In this…
Aimé par Jérémie Guillaud
-
Summer Olympics are underway !! go France !!! 🇫🇷🇫🇷🇨🇵🇫🇷 New fun discipline to watch: rugby 7 ! but tonight, it's an old favorite: Allez les…
Summer Olympics are underway !! go France !!! 🇫🇷🇫🇷🇨🇵🇫🇷 New fun discipline to watch: rugby 7 ! but tonight, it's an old favorite: Allez les…
Aimé par Jérémie Guillaud
-
Something is cooking at C12! This summer, we're pulling back the curtain on our R&D process at our labs in the heart of Paris! Join us for our…
Something is cooking at C12! This summer, we're pulling back the curtain on our R&D process at our labs in the heart of Paris! Join us for our…
Aimé par Jérémie Guillaud
-
After 5 years and 11 months, today I'm leaving IBM Quantum. It's been great working at the lab in Zurich, and with other IBMers across the world…
After 5 years and 11 months, today I'm leaving IBM Quantum. It's been great working at the lab in Zurich, and with other IBMers across the world…
Aimé par Jérémie Guillaud
-
New paper out on arXiv today. This one is on “Mitigating Losses of Superconducting Qubits Strongly Coupled to Defect Modes”, the problem which bugs…
New paper out on arXiv today. This one is on “Mitigating Losses of Superconducting Qubits Strongly Coupled to Defect Modes”, the problem which bugs…
Aimé par Jérémie Guillaud
Autres profils similaires
Autres personnes nommées Jérémie Guillaud
1 autre personne nommée Jérémie Guillaud est sur LinkedIn
Autres personnes nommées Jérémie Guillaud