Quantum Protocols: Testing & Quantum PCPs
2020-03-30..2020-04-02
-- online --
who it's for
quantum complexity theorists, quantum information theorists, quantum experimentalists, quantum device verification engineers, quantum tomography researchers, quantum cryptographers, quantum software engineers
topics
Ehrenfest constraints Hamiltonian recovery; projected least squares tomography; classical shadows protocol; randomized local unitaries measurements; cycle benchmarking error correlations; learning Pauli channels; quantum low-degree test; Pauli-basis self-testing; MIP* = RE compression; quantum PCPs and derandomization; decidability with noisy EPR states; pseudorandom state ensembles in AdS/CFT
| title | author | length |
|---|---|---|
| Learning Many-Body Quantum Systems From Local Measurements | Itai Arad | 01h 08m |
Uses Ehrenfest constraints — measure expectation values of local commutators on a steady state (or time-averaged states) to form a linear system K·c≈0 and… | ||
| A General Introduction to Quantum Tomography -- and a Specialized Report on Property Testing... | Madalin Guta, Jonas Kahn | 01h 02m |
Quick, concrete guide: the first half surveys four concrete tomography strategies and their proven scalings — local asymptotic normality maps N qubits to a… | ||
| Predicting Many Properties of a Quantum System from Very Few Measurements | Richard Kueng | 01h 14m |
Claim: a simple protocol called classical shadows stores inverted post-measurement snapshots that are unbiased estimators of ρ, then uses median-of-means to… | ||
| Computational Pseudorandomness and Constraints on the Ads/Cft Duality | Adam Bouland, Bill Fefferman, Umesh Vazirani | 01h 08m |
Shows a concrete construction in the CFT domain that hides linear-in-time growth: an ensemble of 4^L states made by alternating a fixed scrambling unitary with… | ||
| Non-Local Binary Games With Noisy Epr States Are Decidable | Penghui Yao | 47m |
Shows that the value of non-local binary games where players share noisy EPR states is decidable by giving an explicit finite bound on how many noisy copies… | ||
| Self-Testing as an Approach to Certifying Quantum Systems | Andrea Coladangelo | 56m |
Classical players cap CHSH at 75% while quantum strategies reach about 85% and CHSH self-tests an EPR pair by forcing anti‑commuting observables (Jordan’s… | ||
| MIP* = RE Part 1: The Quantum Low-Degree Test | Zhengfeng Ji, Anand Natarajan, Thomas Vidick, Henry Yuen | 01h 10m |
Shows a concrete protocol that self-tests for 2^n EPR pairs by certifying Pauli relations on many qubits. It combines the magic‑square subtest to force… | ||
| Quantum PCPs Meet Derandomization | Alex B. Grilo | 01h 01m |
Conjecture: a gap-amplifying map from general local Hamiltonians to stochastic uniform Hamiltonians exists if and only if randomized verification class MA… | ||
| The Algebraic Side of MIP* = RE | William Slofstra | 01h 00m |
Shows MIP = RE produces a concrete obstruction to Connes embedding by building a finitely presented synchronous game algebra whose relations admit a tracial… | ||
| MIP* = RE Part 2: PCPs and Introspection | Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen | 01h 01m |
Claim: MIP contains nondeterministic doubly-exponential time (AnyExp) and the techniques extend to the full compression that yields MIP = RE. Key tools are… | ||
| MIP* = RE: Putting Everything Together | Zheng-Feng Jee | 01h 03m |
The result proves MIP = RE by building a recursive, gap-preserving compression that turns large multi‑prover quantum games into much smaller ones while… | ||
| Cross-Platform Verification of Intermediate Scale Quantum Devices with Randomized Measurements | Andreas Elben, B. Vermersch, R. van Bijnen, C. Kokail, P. Zoller, T. Brydges, M. Joshi, C. Maiers, P. Jurcevic, B. Lanyon, R. Blatt, C. Roos | 01h 01m |
Protocol uses randomized local unitaries on a single copy plus projective measurements to estimate second-order statistics that equal the trace overlap and… | ||
| Cycle Benchmarking: The New Paradigm for Assessing All Relevant Errors and Error Correlations... | Joe Emerson | 01h 05m |
Cycle benchmarking reconstructs per-cycle Pauli error probabilities (a Pauli channel reconstruction) and shows concrete surprises: trapped-ion single-qubit… | ||
| Not All Benchmarks Are Created Equal | Robin Blume-Kohout | 01h 03m |
A survey argues that benchmarking needs variety and clarity: a 1,500-source bibliography catalogs methods, testbeds run at 5–50 qubits, and many benchmarks… | ||
| Efficient Learning of Pauli Channels | Steve Flammia | 01h 04m |
Provides concrete, efficiently implementable routines to learn Pauli channels: general full-channel estimation requires n·2^n/ε^2 measurements to recover Pauli… | ||
| nothing matches | ||