Scheduling syndrome measurement circuits

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


Duration: 34:08
58 views
0

Andrew Cross (IBM)
https://simons.berkeley.edu/talks/andrew-cross-ibm-2024-04-22
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms

Stabilizer codes with low-weight check operators are good candidates for experimental realization. Given a subspace or subsystem stabilizer code with low weight checks, an important problem is to find fault-tolerant circuits to measure the checks, while satisfying hardware constraints. I will discuss this problem and present examples for current IBM devices as well as potential future devices on the IBM roadmap.



Other Videos By Simons Institute for the Theory of Computing


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
2024-04-24Tree codes
2024-04-24An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes


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
Andrew Cross