Pseudoentanglement
summary
Defines pseudoentanglement as two efficiently preparable ensembles that are computationally indistinguishable yet have a polynomial gap in von Neumann entropy; proves a SWAP-test lower bound showing pseudorandom states must have ≥log n entanglement and builds ensembles that saturate that bound using PRFs/PRPs to force collisions; gives a public‑key construction from LWE by creating injective vs lossy linear maps (hashing codomains to match types); derives hardness of measuring entanglement and of ground‑state entanglement for mapped local Hamiltonians.
AI-written summary · about
chapters (9)
- 0:00Introduction and overview
- 1:02Motivation and background
- 3:51Definition of pseudo-entanglement
- 8:33Private key construction
- 15:34Technical details of construction
- 24:03Generalizing the construction
- 36:19Public key construction
- 39:06LWE-based implementation
- 51:15Applications and open questions
related talks
01h 03mConstant depth pseudoentanglement - Shallow circuits, deep backstory
01h 03mA Survey on the Complexity of Entangled Provers
27mAbstracting Entanglement
01h 08mEntanglement in Many Body Quantum Systems
01h 22mTensors vs Entanglement
25mA Static Analysis of Entanglement
21mInteractive Proofs for Synthesizing Quantum States and Unitaries
58mLimitations for Quantum PCPs