How did we miss the random purification channel?
summary
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 circuit built from Schur‑Weyl/representation‑theory analysis and a Kraus decomposition. That channel reduces mixed‑state problems to pure‑state algorithms, yielding sample‑optimal mixed tomography (Θ‑optimal in all parameters) and polynomial gate complexity instead of prior exponential costs. Practical uses include sample‑to‑query reductions, optimal learning of channels and Gaussian states, and an improved spectrum estimator beating Keyl–Werner bounds; the construction works as claimed.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 1:08State purification in quantum info
- 3:15Defining the channel
- 7:14Quantum state tomography
- 12:43Discovery overdue
- 24:06Philosophical reasons
- 30:17Motivating the channel
- 46:39Conditional states to purifications
- 52:07Known results and follow-up
- 55:04Key perspectives
- 1:00:24Q&A
related talks
20mLow-Stabilizer-Complexity Quantum States Are Not Pseudorandom
55mFew Single-Qubit Measurements Suffice to Certify Any Quantum State
49mQuantum Garbled Circuits
01h 00mQuantum Physics for Software Developers
42mLearning Shallow Quantum Circuits and Quantum States Prepared by Shallow Circuits in Polynomial Time
01h 09mAre Random Quantum Circuits PRUs?
01h 02mProduct Mixing, Quantum Separation, and Comfortable Juntas
01h 10mLearning from Quantum Experiments