Pseudoentanglement Ain't Cheap - Entropy and Non-Clifford Gates in Quantum States
Watch a 23-minute conference talk from the 19th Theory of Quantum Computation, Communication and Cryptography Conference (TQC 2024) exploring groundbreaking research on pseudoentangled state ensembles. Learn about a novel algorithm that demonstrates how pseudoentangled states with t bits of entropy gap require Ω(t) non-Clifford gates for preparation, aligning with existing pseudorandom state ensemble lower bounds. Discover how this polynomial-time algorithm estimates quantum state entanglement entropy across qubit cuts, providing estimates within t/2 bits accuracy for n-qubit states stabilized by at least 2^{n-t} Pauli operators. Presented by researchers Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang at OIST, Japan, this talk advances theoretical quantum information science understanding through rigorous mathematical analysis and algorithmic innovation.