Summer Cluster Final Workshop 2026
2026-07-17..2026-07-23
Berkeley, United States
| title | author | length |
|---|---|---|
| Talk by Hsin-Yuan Huang (Oratomic, Caltech) | Hsin-Yuan Huang | 01h 19m |
Argues that large language models plus persistent memory and multi-agent verifier loops already solve many self-contained theory problems: cites the MemGPT… | ||
| Ground Energy estimation of Quantum Impurity model is in BQP | Jiaqing Jiang | 01h 03m |
Shows that ground-energy estimation for quantum impurity Hamiltonians admits a polynomial-time quantum algorithm that outputs the ground energy to… | ||
| Constant depth pseudoentanglement - Shallow circuits, deep backstory | Andru Gheorghiu | 01h 03m |
Claim: pseudoentangled states are constructible by 2D-local constant-depth (QNC0) circuits that encode an entropy gap of order log N using linear maps turned… | ||
| Quantum architecture for utility scale with HPC, AI and Quantum | Matthias Troyer | 01h 07m |
AI+HPC pipeline screens 32 million candidates by atomic substitution, retrains on DFT, validates 583 targets and sends 18 to the lab where one solid‑state… | ||
| Gap Amplification for Local Hamiltonians with Combinatorial Soundness | Quynh T. Nguyen | 01h 09m |
Gives a concrete template that turns a two-local input Hamiltonian into a two-local output Hamiltonian on local dimension 2^{polylog n} and proves… | ||
| Building a Quantum Computer with QLDPC Codes | Sunny Zhiyang He | 01h 01m |
Overview of concrete claims, tools, and limits: modern proposals replace surface codes with QLDPC memory plus LDPC surgery extractors, use Stim and open… | ||
| Efficient Quantum Algorithm for Heisenberg Spin Systems | Benjamin Wong | 43m |
Shows that a Suzuki‑Fisher family of Heisenberg models (including the antiferromagnet on any bipartite graph and certain sign‑problem cases) has a spectral gap… | ||
| Talk by Chris Pattison (UC Berkeley) | Chris Pattison | 53m |
Claim: fault-tolerant universal computation uses only a constant number of global control lines plus a few fully controllable qubits, achieved by compiling 1D… | ||
| Lightning Talks | 33m | |
Observation: pure symmetric n‑qubit states satisfy a quantitative de Finetti rigidity: the trace‑distance of any m‑qubit marginal to a product state is at… | ||
| On constant T-depth circuits | Isaac Kim | 51m |
Claims that many basic quantum subroutines admit constant T-depth constructions: single-qubit rotations (including programmable rotation) and the quantum part… | ||
| How did we miss the random purification channel? | Ewin Tang | 01h 02m |
An efficient quantum channel converts N copies of a mixed state ρ into N copies of a random purification (the same purification each time), implemented by a… | ||
| Learning the structure of open quantum systems | Laura Lewis | 54m |
Provides efficient algorithms that recover unknown Lindbladians for k‑local, bounded‑degree and some long‑range models, achieving structure learning with total… | ||
| Lightning Talks | MICHAEL RAGONE | 01h 41m |
Covers rigorous thermalization rates for the mean-field Heisenberg ferromagnet: proves the Davies-generator spectral gap is constant for non-critical β and… | ||
| Classical algorithms for quantum Gibbs states | Alexander Zlokapa | 01h 07m |
Claims a rigorous classical algorithm that estimates local thermal expectations for SYK by proving a zero‑free disk around β=0 and using Barvinok-style Taylor… | ||
| Fast mixing of all-to-all quantum systems at high temperatures | Thiago Bergamaschi | 01h 08m |
Proves that bounded-degree all-to-all k‑local Hamiltonians have a critical temperature above which the Gibbs sampler has a system-size independent spectral… | ||
| Peaked quantum advantage using error correction | Soumik Ghosh | 51m |
Proposes a concrete experiment called Hidden Code Sampling that encodes k logical qubits into n≈120 physical qubits using CSS codes, produces conditional peaks… | ||
| A 3D Self-Correcting Quantum Memory | Shankar Balasubramanian, Margarita Davydova | 01h 41m |
Construction gives a family of local CSS stabilizer Hamiltonians in three dimensions whose thermal Lindbladian dynamics have a Gibbs fixed point and whose… | ||
| Fault-Tolerance Against Adversarial Errors & PCPs | Louis Golowich | 01h 37m |
Constructs a compiler that turns any logical circuit into a fault‑tolerant physical circuit that tolerates an almost linear number of adversarial bit/qubit… | ||
| Two classical oracle separations between QMA and QCMA | John Bostanci | 58m |
Claims two explicit classical oracle separations: one called spectral Forrelation and one called code intersection. Both languages are in QMA via a… | ||
| nothing matches | ||