Constant depth pseudoentanglement - Shallow circuits, deep backstory @SimonsInstitute
Constant depth pseudoentanglement - Shallow circuits, deep backstory  @SimonsInstitute
Uploaded July 2026 | Updated September 2026, 2 weeks ago
Andru Gheorghiu (IBM Quantum)
https://simons.berkeley.edu/talks/andru-gheorghiu-ibm-quantum-2026-07-24
Quantum Summer Cluster Final Workshop

Pseudoentangled states are quantum states whose entanglement structure is computationally hard to determine. In particular, given copies of such states, or in some cases even the circuits preparing them, no polynomial-time quantum algorithm can estimate their entanglement entropy across a specified cut. In this talk, I'll discuss a recent result showing that pseudoentangled states can be constructed by 2D-local constant-depth circuits. This gives a strong separation with respect to pseudoerandom states, which cannot be constructed from local constant-depth circuits, and strengthens previous results on the hardness of learning the entanglement structure of local Hamiltonian ground-states.

I will also discuss the backstory for this result, in particular how I used AI tools in order to improve upon my original construction and write the paper.

Based on: arxiv.org/abs/2605.31448
Constant depth pseudoentanglement - Shallow circuits, deep backstoryCan AI do research math?Are We Measuring the Right Thing? Distribution Shift Lessons for Federated LearningGeneralization insights from actual cognitionHow abundant are good interpolators?Fast mixing of all-to-all quantum systems at high temperaturesSolving Semidecidable Problems in Group TheoryFoundation models in health AIAn introduction to the hardness versus randomness paradigmA new class of algorithms for trajectory inferenceRandom hyperbolic surfacesA 3D Self-Correcting Quantum Memory
Simons Institute for the Theory of Computing |

Constant depth pseudoentanglement - Shallow circuits, deep backstory

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER