A new framework certifies global quantum properties including multipartite entanglement, circuit complexity, and quantum magic on small subsystems with constant sample complexity via local Pauli measurements.
Brandão, Wissam Chemissany, Nicholas Hunter-Jones, Richard Kueng, and John Preskill
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 4verdicts
UNVERDICTED 4roles
background 2polarities
background 2representative citing papers
Quantum systems reach a Maximal Entanglement Limit where entanglement geometry produces thermal reduced density matrices and probabilistic behavior in statistical and high-energy physics.
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
Krylov subspace methods efficiently describe quantum evolution, operator growth, and chaos in many-body systems, with metrics like Krylov complexity and applications in open systems, QFT, and quantum computing.
citing papers explorer
-
Certifying localizable quantum properties with constant sample complexity
A new framework certifies global quantum properties including multipartite entanglement, circuit complexity, and quantum magic on small subsystems with constant sample complexity via local Pauli measurements.
-
The Maximal Entanglement Limit in Statistical and High Energy Physics
Quantum systems reach a Maximal Entanglement Limit where entanglement geometry produces thermal reduced density matrices and probabilistic behavior in statistical and high-energy physics.
-
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
-
Quantum Dynamics in Krylov Space: Methods and Applications
Krylov subspace methods efficiently describe quantum evolution, operator growth, and chaos in many-body systems, with metrics like Krylov complexity and applications in open systems, QFT, and quantum computing.