Quantum Summer Cluster Workshop 2023
2023-07-10..2023-07-14
Berkeley, United States
who it's for
quantum complexity theorists, quantum information theorists, quantum algorithms researchers, experimental NISQ researchers, quantum cryptographers, quantum error correction researchers, quantum machine learning researchers
topics
linear cross-entropy benchmarking; two-copy Bell sampling verification; tensor-network contraction cost; NISQ-implementable hard circuits; Szegedy quantum walk algorithms for partition functions; quantum Gibbs sampler via Lindbladian; dissipative quantum eigensolver; compiled CHSH single-prover verification; quantum PCP and NLTS constructions; approximate quantum error correction bounds; holographic complexity, geometry and entropy
| title | author | length |
|---|---|---|
| Verifiable Quantum Supremacy: What I Hope Will Be Done | Scott Aaronson | 01h 20m |
Argues for a concrete research program: design circuits that are NISQ-implementable, provably hard for classical simulation, yet classically efficiently… | ||
| Validated Quantum Advantage via Bell Sampling | Dominik Hangleiter | 58m |
Proposes a concrete model that samples 2n-bit outcomes by applying a two-copy transversal Bell measurement to C ⊗ C, gives complexity-theoretic evidence that… | ||
| A Phase Transition in Linear Cross-Entropy Benchmarking | Abhinav Deshpande | 51m |
Shows that the linear cross-entropy benchmark (XEB) stops tracking fidelity as noise crosses a sharp phase transition: XEB ≈ fidelity for εN ≪ 1 but breaks… | ||
| Utility, Computational Cost, and Effective Quantum Volume of NISQ Experiments | Benajmin Villalonga | 59m |
Argues that optimized tensor network contraction is the leading classical tool, links its cost to a treewidth/effective area and shows random circuit sampling… | ||
| Quantum Advantage with Shallow Clifford Circuits | Daniel Grier | 01h 10m |
Constant-depth Clifford circuits on 2D graph states provably solve a relation that bounded‑fan‑in constant‑depth classical circuits cannot: the GHZ game gives… | ||
| Quantum Gibbs Sampling | Anthony Chen | 01h 26m |
Construction of a continuous-time Lindbladian gives a quantum Gibbs sampler that is efficiently implementable on a fault-tolerant device and has the Gibbs… | ||
| Quantum Algorithms for Approximating Partition Functions | Yassine Hamoudi | 01h 06m |
Presents a concrete, implementable route to speed up classical MCMC partition‑function estimation: convert reversible Markov chains to a unitary via Szegedy… | ||
| How Simulating Balls and Springs Captures the Power of Quantum Computing | Robin Kothari | 01h 28m |
Defines a classical decision problem: predict one coordinate of the time evolution of 2^n coupled oscillators where inputs are given by a succinct circuit… | ||
| Making the Leap to Quantum PCPs | Chinmay Nirkhe | 50m |
Claim: there is an explicit stabilizer Hamiltonian built from high-rate high-distance codes whose low-energy states provably need large circuit depth, using… | ||
| Compiled Nonlocal Games: From CHSH to BQP Verification | Anand Natarajan, Tina Zhang | 01h 06m |
Applies the Kalai‑et‑al. compilation to CHSH and proves the compiled single‑prover protocol still attains the Tsirelson bound (cos^2(π/8) ≈ 0.85), then… | ||
| QMA and the Power of “Positivity” | Kunal Marwaha | 52m |
The paper shows a surprising dichotomy: restricting witnesses to non-negative amplitudes can either leave QMA+ equal to QMA or make QMA+ (and QMA2+) as… | ||
| Dissipative State Preparation and the Dissipative Quantum Eigensolver | Toby Cubitt | 01h 15m |
Constructs a Dissipative Quantum Eigensolver that uses weak local measurements and a conditional stopping rule (stop after n successive “good” outcomes) to… | ||
| Geometry, Entropy and Complexity in Quantum Gravity (Part I) | Patrick Hayden | 01h 06m |
Overview of how anti‑de Sitter geometry encodes quantum information: the spatial metric makes the boundary infinitely far yet causally reflective so light… | ||
| Geometry, Entropy and Complexity in Quantum Gravity (Part II) | Patrick Hayden | 01h 21m |
Argues that semi‑classical Euclidean path integrals and saddle points reproduce holographic entropies via Ryu–Takayanagi and recover Hawking area law, shows… | ||
| Quantum Commitments and Black Hole Radiation Decoding | Fermi Ma | 01h 00m |
A reformulation of Harlow–Hayden’s decoding task as a radiation distinguishing game shows a concrete equivalence: distinguishing whether register B is… | ||
| Learning Beyond Stabilizer States | William Kretschmer | 01h 04m |
Shows concrete algorithms and limits: outputs of Clifford+T circuits with n qubits and k T gates are learnable in poly(n) time with sample and runtime scaling… | ||
| Improved Machine Learning Algorithm for Predicting Ground State Properties | Laura Lewis | 01h 15m |
A classical ML pipeline encodes geometric locality into a feature map, uses L1‑regularized regression (LASSO) plus classical shadows and proven bounds… | ||
| Approaching the Quantum Singleton Bound with Approximate Error Correction | Louis Golowich | 01h 03m |
Constructs efficiently decodable approximate quantum codes of any constant rate R that correct adversarial errors up to nearly the quantum Singleton bound… | ||
| Lightning Talks | GREGORY D. KAHANAMOKU-MEYER | 02h 41m |
Short lightning set with concrete claims and tools: a quantum-arithmetic method merges Karatsuba with Fourier-space phases to get subquadratic multiplication… | ||
| nothing matches | ||