Universal Fault-Tolerant Computing with Bacon-Shor Codes

Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=-bFz58qMogQ



Duration: 58:42
1,950 views
25


We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing in that higher levels of the Clifford hierarchy become accessible as the code becomes more asymmetric. For instance, in an appropriate gauge, Bacon-Shor codes on an m-by-mk lattice have transversal k-qubit-controlled Z. We also describe how, for any stabilizer code, logical operator asymmetry is a necessary condition for transversal gates in high levels of the Clifford hierarchy. For Bacon-Shor CCZ, through a variety of tricks, including intermediate error-correction and non-Pauli recovery, we reduce the overhead required for fault-tolerant implementation. We calculate pseudothresholds for our universal gate set on the smallest 3-by-3 Bacon-Shor code and also compare our gates with magic-states within the framework of a proposed ion trap architecture.

See more at https://www.microsoft.com/en-us/research/video/universal-fault-tolerant-computing-with-bacon-shor-codes/




Other Videos By Microsoft Research


2017-12-12Foundations of Data Science - Lecture 9 - Two Applications of SVD
2017-12-12Foundations of Data Science - Lecture 8 - Low Rank Approximation (LRA) via Length Squared Sampling
2017-12-12Foundations of Data Science - Lecture 7 - Singular Value Decomposition - ll
2017-12-11Foundations of Data Science - Lecture 6 - Singular Value Decomposition - l
2017-12-11Foundations of Data Science - Lecture 5 - Length Squared Sampling in Matrices
2017-12-11Detecting and Recognizing Text in Natural Images
2017-12-11CodeTalk: Rethinking IDE Accessibility
2017-12-11Seattle Angel Conference XII: Pitch 4-6
2017-12-11Seattle Angel Conference XII: Pitch Overview 1-3
2017-12-10Seattle Angel Conference XII: Announcements, Alumni Reports, and Keynote
2017-12-10Universal Fault-Tolerant Computing with Bacon-Shor Codes
2017-12-10Vega-Lite: A Grammar of Interactive Graphics
2017-12-06Disparity | Artist in Residence
2017-12-05Building a New View of Transcriptome Variations
2017-12-04Random self-similar trees: dynamical pruning and its applications to inviscid Burgers equations
2017-12-04Explaining Inconclusive Outcomes from Software Model Checkers to Users
2017-11-27Pacific Northwest Probability Seminar: An Analysis of Spatial Mixing
2017-11-20Keynote: Smart Enough to Work With Us? Foundations and Challenges for Teamwork-Enabled AI Systems
2017-11-19Pacific Northwest Probability Seminar: Gravitational Allocation to Uniform Points on the Sphere
2017-11-19Pacific Northwest Probability Seminar: A Characterization Theorem for the Gaussian Free Field
2017-11-19Two-round Secure Multiparty Computations from Minimal Assumptions



Tags:
microsoft research
fault-tolerance
bacon-shor