Summer Cluster on Quantum Computing 2025
2025-07-07..2025-07-11
Berkeley, United States
as the organisers put it
The Summer Cluster on Quantum Computing brings together researchers from academia and industry to explore topics from quantum complexity theory and cryptography to quantum algorithms, benchmarking, error correction, and fault tolerance. The cluster has a special focus on NISQ (noisy intermediate-scale quantum) computers and complexity-based evidence of quantum advantage.
| title | author | length |
|---|---|---|
| Thermal metastability and area laws | Anthony Chen | 01h 08m |
Claim: any quantum state that changes only slowly under a local, time-independent Lindbladian with KMS detailed balance satisfies an approximate… | ||
| Architectural mechanisms of a universal fault-tolerant quantum computer | Dolev Bluvstein | 01h 10m |
A neutral‑atom processor uses Rydberg atom arrays in optical tweezers with movable ancillas to implement distance‑5 surface and toric codes, a non‑destructive… | ||
| Tour de gross: A modular quantum computer based on bivariate bicycle codes | Eddie Schoute | 01h 06m |
Bicycle architecture uses bivariate bicycle codes — the gross (distance 12, 12 logicals in 288 physical qubits) and two‑gross (distance 18, 12 logicals in 576… | ||
| An Overview of QEC at Google | Dripto Debroy | 58m |
Survey of recent Google QEC work: defines and uses lambda ≈ 2 as the intensive scaling metric, reports distance-3/5/7 experiments showing exponential… | ||
| Panel Discussion | All right | 51m |
Panel covers concrete roadmaps and trade-offs: comparisons of surface codes vs LDPC, modular chip linking vs monolithic scaling, and compiler-to-hardware… | ||
| Reducing the number of qubits in quantum factoring | André Schrottenloher | 54m |
Claims factoring reduces to a discrete‑log instance so the quantum input register is n/2 + o(n) qubits (2048‑bit RSA → 1024‑bit DL), implements modular… | ||
| Exponential improvements to the average-case hardness of random circuits | Shaun Datta | 49m |
Claims an exponential improvement in robustness for estimating output probabilities of random circuits and BosonSampling, tightening the error from essentially… | ||
| Are Random Quantum Circuits PRUs? | Alex Lombardi | 01h 09m |
Claims that random brickwork circuits are PRUs assuming no efficient algorithm can exactly learn a random circuit’s depth; proves a conditional reduction: if… | ||
| Panel Discussion | Dominik Hangleiter | 43m |
Panelists argue that the field sits between shaky experimental claims and solid theory: random circuit sampling may be spoofable for LEB but not full… | ||
| Verifiable quantum advantage: old and new ideas | Alexandru Gheorghiu | 01h 05m |
Proposal: prepare an n-qubit phase state from a degree-3 polynomial made of disjoint k-bit blocks, hide the product structure by applying a random affine… | ||
| Quantum cryptography and quantum complexity | William Kretschmer | 59m |
Constructs a standard classical oracle where P = NP yet quantum‑computable one‑way functions and even trapdoor variants exist, using a forrelation encoding of… | ||
| How to model unitary oracles | Mark Zhandry | 01h 08m |
Argues that “efficient” unitaries must track global phase and that oracle access should allow conjugates and transposes as well as controlled and inverse… | ||
| When do you need an inverse or controlled unitary oracle? | Ewin Tang | 01h 05m |
Amplitude estimation provably needs both U and U^{-1} to get the usual 1/ε vs 1/ε^2 quantum speedup: with only forward queries and large dimension d ≳ 1/ε^2… | ||
| Informational and computational aspects of holography | Zixia Wei | 59m |
AdS3/CFT2 examples show entanglement entropy on a boundary circle mapping to a geometric area in the bulk via the Ryu–Takayanagi minimal surface, with the… | ||
| Quantum LDPC Codes with Transversal CCZ Gates | Louis Golowich | 01h 03m |
Constructs quantum LDPC codes that admit transversal CCZ by encoding qubits as level‑1 cochains, proving a cup product (via the Leibniz rule) produces… | ||
| Computational quantum chemistry: Classical gaps, quantum opportunities, open questions | Martin Head-Gordon | 01h 13m |
Classical methods power most chemistry but leave two gaps: DFT does 95% of daily simulations yet lacks chemical accuracy for barrier heights, and high‑accuracy… | ||
| How Hamiltonian complexity differs from quantum chemistry | Jiaqing Jiang | 01h 06m |
Worst-case ground-energy estimation is QMA-complete, but chemistry-relevant models like the translation-invariant Fermi–Hubbard lattice lack proven worst-case… | ||
| Sum of squares spectral amplification (SOSSA) | Robbie King | 57m |
Claims a practical cut to quantum chemistry phase estimation costs: compiled FeMoCo goes from “centuries” to hours by rewriting H in a sum of squares form and… | ||
| Panel Discussion | 52m | |
Discussion identifies concrete targets and limits: focus on the Fermi–Hubbard model and measuring Gibbs-state observables (Green’s functions) rather than just… | ||
| Few Single-Qubit Measurements Suffice to Certify Any Quantum State | William He | 55m |
Gives an algorithm that certifies any n‑qubit pure target state using linear number of copies and making quadratically many single-qubit measurements… | ||
| Rapid quantum ground state preparation via dissipative dynamics | Lin Lin | 56m |
Claims that Lindblad-style dissipative dynamics can prepare ground states from arbitrary initial states (even exponentially small overlap) and proves… | ||
| Lightning Talks | 01h 31m | |
A new construction claims to obfuscate any unitary quantum program using a classical oracle plus a random oracle (ePrint 2025/891) and even ships a QR-linked… | ||
| Computational quantum chemistry: Classical gaps, quantum opportunities, open questions Part 2 | Martin Head-Gordon | 32m |
Claims a hybrid workflow that compresses strong-correlation space into a small n‑particle basis and then uses a quantum device to evaluate matrix elements that… | ||
| nothing matches | ||