Complexity is not enough for randomness
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1775384 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 2174437 (Why is no real title available?)
- scientific article; zbMATH DE number 1890851 (Why is no real title available?)
- scientific article; zbMATH DE number 2116093 (Why is no real title available?)
- scientific article; zbMATH DE number 3243294 (Why is no real title available?)
- A bound on chaos
- A geometric approach to quantum circuit lower bounds
- Algebraic aspects of increasing subsequences
- Average-case speedup for product formulas
- Black holes and random matrices
- Black holes and the butterfly effect
- Black holes as mirrors: quantum information in random subsystems
- Brownian motions in a Lie group
- Chaos and complexity by design
- Chaos, complexity, and random matrices
- Characterization of Chaotic Quantum Spectra and Universality of Level Fluctuation Laws
- Chord diagrams, exact correlators in spin glasses and black hole bulk reconstruction
- Computational complexity and black hole horizons
- Concentration of norms and eigenvalues of random matrices
- Convergence of the empirical spectral measure of unitary Brownian motion
- Entanglement is not enough
- Evenly distributed unitaries: On the structure of unitary designs
- Fast scramblers, horizons and expander graphs
- Integration formulas for Brownian motion on classical compact Lie groups
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Linear growth of circuit complexity from Brownian dynamics
- Local random quantum circuits are approximate polynomial-designs
- Mixing properties of stochastic quantum Hamiltonians
- Optimizing quantum process tomography with unitary2-designs
- Phase transition in the density of states of quantum spin glasses
- Quantum Complexity Theory
- Quantum computation as geometry
- Quantum computations: algorithms and error correction
- Random Matrices in Physics
- Random quantum circuits are approximate 2-designs
- Revisiting Brownian SYK and its possible relations to de Sitter
- Statistical Theory of the Energy Levels of Complex Systems. I
- Stringy effects in scrambling
- Symmetry, Representations, and Invariants
- The Brown measure of the free multiplicative Brownian motion
- The Heat Kernel on Hyperbolic Space
- The approach to thermal equilibrium in quantized chaotic systems
- The theory of quantum information
- Towards a full solution of the large N double-scaled SYK model
- Towards the fast scrambling conjecture
- Unitary designs and codes
Cited in
(2)
This page was built for publication: Complexity is not enough for randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7029172)
