Efficient Error Correction in Neutral Atoms via Erasure Conversion | Quantum Colloquium

Published on ● Video Link: https://www.youtube.com/watch?v=Oc6ve3SuSxY



Duration: 1:37:46
1,502 views
16


Jeff Thompson (Princeton)
https://simons.berkeley.edu/events/quantum-colloquium-efficient-error-correction-neutral-atoms-erasure-conversion
Quantum Colloquium

Executing quantum algorithms on error-corrected logical qubits is a critical step for scalable quantum computing, but the requisite numbers of qubits and physical error rates are demanding for current experimental hardware. Recently, the development of error correcting codes tailored to particular physical noise models has helped relax these requirements, exemplified by the case of biased noise in bosonic superconducting qubits. In this talk, I will discuss our recent proposal for a novel neutral atom qubit using Yb-171, which allows the dominant physical errors to be converted into erasures, that is, errors in known locations [1]. The key idea is to encode qubits in a metastable electronic level, such that gate errors predominantly result in transitions to disjoint subspaces whose populations can be continuously monitored via fluorescence. Using realistic experimental parameters, we estimate that 98% of errors can be converted into erasures. We quantify the benefit of this approach via circuit-level simulations of the surface code, finding a threshold increase from 0.937% to 4.15%. Importantly, achieving a circuit-level benefit does not require bias-preserving gates. I will also discuss ongoing work towards an experimental implementation of these qubits [2], as well as prospects for converting a wider range of errors into erasures. [1] Y. Wu, S. Kolkowitz, S. Puri, and J. D. Thompson, arxiv:2201.03540 (2022). [2] S. Ma, A. P. Burgers, G. Liu, J. Wilson, B. Zhang, and J. D. Thompson, arxiv:2112.06799 (2021).

Panel featuring Kenneth Brown (Duke University), Ignacio Cirac (Max Planck Institute of Quantum Optics), Liang Jiang (University of Chicago), and Mark Saffman (UW Madison); Umesh Vazirani (UC Berkeley; moderator). 1:04:34




Other Videos By Simons Institute for the Theory of Computing


2022-05-05What Does Machine Learning Offer Game Theory (And Vice Versa)?
2022-05-05Variants and Invariants in No-Regret Algorithms
2022-05-05When Is Offline Two-Player Zero-Sum Markov Game Solvable?
2022-05-05General Game-Theoretic Multiagent Reinforcement Learning
2022-05-05Kernelized Multiplicative Weights for 0/1-Polyhedral Games:...
2022-05-04Multi-Agent Reinforcement Learning Towards Zero-Shot Communication
2022-05-04Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning
2022-05-04Independent Learning in Stochastic Games
2022-05-04On Rewards in Multi-Agent Systems
2022-05-04Learning Automata as Building Blocks for MARL
2022-05-04Efficient Error Correction in Neutral Atoms via Erasure Conversion | Quantum Colloquium
2022-05-04Multi-Agent Reinforcement Learning in the High Population Regime
2022-05-04A Regret Minimization Approach to Mutli-Agent Control and RL
2022-05-03The Complexity of Markov Equilibrium in Stochastic Games
2022-05-03The Complexity of Infinite-Horizon General-Sum Stochastic Games: Turn-Based and Simultaneous Play
2022-05-03Policy Gradients in General-Sum Dynamic Games: When Do They Even Converge?
2022-05-03No-Regret Learning in Time-Varying Zero-Sum Games
2022-05-03What is the Statistical Complexity of Reinforcement Learning?
2022-05-03V-Learning: Simple, Efficient, Decentralized Algorithm for Multiagent RL
2022-05-02"Calibeating": Beating Forecasters at Their Own Game
2022-04-30Adjudicating Between Different Causal Accounts of Bell Inequality Violations



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Quantum Colloquium
Umesh Vazirani
Jeff Thompson
Kenneth Brown
Ignacio Cirac
Liang Jiang
Mark Saffman