Quantum Lego: Quantum Codes and their Enumerators from Tensor Networks

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


Duration: 29:42
76 views
0

Brad Lackey (Microsoft)
https://simons.berkeley.edu/talks/brad-lackey-microsoft-2024-04-22
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms

We provide an overview of the quantum lego formalism, a method for constructing and analyzing large quantum error correcting codes from smaller ones using techniques from tensor networks, and provide some examples of how to realize popular codes through this formalism. We also show that the quantum weight enumerators of codes constructed via quantum lego can often be computed efficiently, providing an exact computation of the code distance.



Other Videos By Simons Institute for the Theory of Computing


2024-04-30Continuous-time quantum walks for MAX-CUT are hot
2024-04-30Circuit Conspiracies
2024-04-30Analog quantum machine learning for near-term hardware
2024-04-30Hardware-efficient quantum computing using qudits
2024-04-30Probing the limits of classical computing with arbitrarily connected quantum circuits
2024-04-30Emergence of Universal Randomness in Quantum Many-body Dynamics
2024-04-30Exploring the quantum computing frontier with reconfigurable atom arrays
2024-04-30On Scrambling Times of Quantum Systems, Including Black Holes
2024-04-30From randomized benchmarking to cycle error reconstruction
2024-04-30How to fault-tolerantly realize any quantum circuit with local operations
2024-04-30Quantum Lego: Quantum Codes and their Enumerators from Tensor Networks
2024-04-30QEC demonstrations leveraging dynamic circuits
2024-04-30Scheduling syndrome measurement circuits
2024-04-30Halving the cost of surface codes by running error correction at the logical level
2024-04-30A NASA Perspective on Quantum Computing, with Emphasis on Recent Results in Distributed Computing
2024-04-30Quantum neural networks
2024-04-30Classical algorithm for simulating experimental Gaussian boson sampling
2024-04-30Dawn in the age of quantum fault tolerance
2024-04-25Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
2024-04-24Parameterized Inapproximability of the Minimum Distance Problem over all Fields...
2024-04-24List-decoding random codes ensembles


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms
Brad Lackey