REVIEW 6 cited by
Random Quantum Circuits
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Quantum circuits -- built from local unitary gates and local measurements -- are a new playground for quantum many-body physics and a tractable setting to explore universal collective phenomena far-from-equilibrium. These models have shed light on longstanding questions about thermalization and chaos, and on the underlying universal dynamics of quantum information and entanglement. In addition, such models generate new sets of questions and give rise to phenomena with no traditional analog, such as new dynamical phases in quantum systems that are monitored by an external observer. Quantum circuit dynamics is also topical in view of experimental progress in building digital quantum simulators that allow control of precisely these ingredients. Randomness in the circuit elements allows a high level of theoretical control, with a key theme being mappings between real-time quantum dynamics and effective classical lattice models or dynamical processes. Many of the universal phenomena that can be identified in this tractable setting apply to much wider classes of more structured many-body dynamics.
Forward citations
Cited by 6 Pith papers
-
Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms
Clebsch-Gordan transforms give exact compressed oracles for Haar-random unitary group actions, with efficient circuits for U(d).
-
Streamlined Krylov construction and classification of ergodic Floquet systems
A Szegő/CMV Krylov construction maps Floquet unitary dynamics to a five-diagonal chain, with a conjectured classification of chaos and integrability by Verblunsky coefficient asymptotics.
-
Quantum random walks on d-regular graphs with Haar-random coin operators
Haar-random coin quantum walks on d-regular graphs yield a non-ergodic averaged channel that depolarizes the coin while preserving forever-measurable initial-state information in the vertex subspace for Cayley graphs ...
-
Coherent error induced phase transition
The paper shows that in stabilizer codes a change in the logical stabilizer group after a coherent Clifford error and syndrome measurement exactly determines the MAP recovery probability, and that above a critical err...
-
Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity
Reducing a graph walk to distance-layers reproduces Krylov/spread complexity, yielding analytic finite-q SYK Lanczos coefficients and hypercube complexity D sin²(t/D), with faster saturation than classical-walk circuits.
- Measurement induced scrambling and emergent symmetries in random circuits
Discussion (0). Continue with ORCID to comment.