Quantum Fault Tolerance with Flag Qubits | Quantum Colloquium

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=etA9l2NUCXI


Duration: 1:41:02
1,972 views
37

Rui Chao (Duke University)
Quantum Colloquium, Mar 9, 2021
https://simons.berkeley.edu/events/quantum-colloquium

Fault tolerance is necessary for reliable quantum computing. While there have been experimental tests of quantum error-correcting codes, testing fault-tolerance remains a major challenge, mainly due to the substantial overhead.

I will describe a qubit-efficient paradigm for fault-tolerance circuit design, termed the "flag method." Traditional approaches achieve fault-tolerance by preventing errors from spreading badly. In the flag method, "flag qubits" are added to catch the faults that can lead to correlated errors on the data. Provided the flag gadgets are carefully designed, the potential correlated errors can be diagnosed by their syndromes, and accordingly be remedied. I will illustrate the flag idea with several applications and extensions, which are of general theoretical interest as well as practical importance.



Other Videos By Simons Institute for the Theory of Computing


2021-03-18Belief and Survey Propagation
2021-03-17Non-CDCL Solvers
2021-03-17Panel & Questions | Quantum Colloquium
2021-03-17Towards Practical Quantum Advantage | Quantum Colloquium
2021-03-17What Maximum Clique Algorithms Can Teach Us, And Vice-Versa
2021-03-17Tutorial Session: Introduction to Quantum Chemistry | Quantum Colloquium
2021-03-15A Brief Introduction to Theoretical Foundations of Machine Learning and Machine Teaching
2021-03-12United for Change: Deliberative Coalition Formation to Change the Status Quo
2021-03-11Are we aging well?
2021-03-11The Dawn of Computational Complexity Theory
2021-03-10Quantum Fault Tolerance with Flag Qubits | Quantum Colloquium
2021-03-09Beyond NP with Tractable Circuits
2021-03-08Synthesis of Functional Reactive Programs via a Reduction of Asynchronous Inputs to Lists
2021-03-08Synthesis of Coordination Programs from Linear Temporal Specifications
2021-03-08Synthesizing Approximate Implementations for Reactive Systems
2021-03-08Control Synthesis and its Magical Futures
2021-03-08Shield Synthesis for Safe Reinforcement Learning
2021-03-08TBA
2021-03-05Designing Agents' Preferences, Beliefs, and Identities
2021-03-04On Symmetry and Quantification: A New Approach to Verify Distributed Protocols
2021-03-04Progress in Symbolic Satisfiability Solving


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing