From the 8 of 321 papers with an AI index.
266 citations
- SLAC National Accelerator LaboratoryUS80 papers
- University of ChicagoUS63 papers
- University College LondonGB46 papers
- Lawrence Berkeley National LaboratoryUS45 papers
- Centre National de la Recherche ScientifiqueFR44 papers
- University of California SystemUS44 papers
- University of CambridgeGB43 papers
- University of MichiganUS43 papers
- University of TorontoCA43 papers
- Sorbonne UniversitéFR42 papers
- Université Paris-SaclayFR42 papers
- Institució Catalana de Recerca i Estudis AvançatsES41 papers
15 papers · 1 filter
Growth and collapse of subsystem complexity under random unitary circuits
Jeongwan Haah, Douglas Stanford
For chaotic quantum dynamics modeled by random unitary circuits, we study the complexity of reduced density matrices of subsystems as a function of evolution time where the initial…
Infinite temperature at zero energy
Matteo Ippoliti, David M. Long
We construct a family of static, geometrically local Hamiltonians that inherit eigenstate properties of periodically-driven (Floquet) systems. Our construction is a variation of th…
Practical Limits on Integrated Squeezers
Devin J. Dean, Taewon Park, Lars S. Madsen +12
Recent experiments have demonstrated the successful generation and detection of moderately squeezed vacuum states with integrated photonics. However, in order to benefit from the r…
Entanglement cost for infinite-dimensional physical systems
Hayata Yamasaki, Kohdai Kuroiwa, Patrick Hayden +1
We prove that the entanglement cost equals the regularized entanglement of formation for any infinite-dimensional quantum state with finite quantum entropy on at least on…
Machine-learning-assisted material and geometry characterization from Casimir force measurement
Hideo Iizuka, Shanhui Fan
A broadband electromagnetic source is important for scientific and technological applications. Quantum vacuum fluctuations, which manifest most prominently in the Casimir effect, p…
Elevating Variational Quantum Semidefinite Programs for Polynomial Objectives
Iria W. Wang, Robin Brown, Taylor L. Patti +3
Many practically important NP-hard optimization problems are inherently higher-order polynomial optimizations, which are typically addressed using approximation algorithms. Classic…