Haar random qubit states show vanishing fermionic non-Gaussianity for subsystems smaller than half the total size without symmetry, small but finite non-Gaussianity with U(1) symmetry, and extensive non-Gaussianity for larger subsystems.
Random Quantum Circuits,
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
verdicts
UNVERDICTED 5roles
background 3polarities
background 3representative citing papers
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.
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.
Lecture notes and accompanying library teach replica tensor network methods to compute circuit-averaged observables in random quantum circuits by mapping them to classical statistical mechanics models.
Review of universality principles and examples in driven open quantum matter via Lindblad-Keldysh field theory, organized into three classes of nonequilibrium phenomena.
citing papers explorer
-
Non-Gaussianity of random quantum states
Haar random qubit states show vanishing fermionic non-Gaussianity for subsystems smaller than half the total size without symmetry, small but finite non-Gaussianity with U(1) symmetry, and extensive non-Gaussianity for larger subsystems.
-
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.
-
Entanglement and circuit complexity in finite-depth random linear optical networks
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.
-
Lecture Notes on Replica Tensor Networks for Random Quantum Circuits
Lecture notes and accompanying library teach replica tensor network methods to compute circuit-averaged observables in random quantum circuits by mapping them to classical statistical mechanics models.
-
Universality in driven open quantum matter
Review of universality principles and examples in driven open quantum matter via Lindblad-Keldysh field theory, organized into three classes of nonequilibrium phenomena.