Random quantum circuits transform local noise into global white noise
From MaRDI portal
Publication:6202916
DOI10.1007/s00220-024-04958-zarXiv2111.14907OpenAlexW3215183963MaRDI QIDQ6202916
Nicholas Hunter-Jones, Alexander M. Dalzell, Fernando G. S. L. Brandão
Publication date: 26 March 2024
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.14907
Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) General quantum mechanics and problems of quantization (81Sxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local random quantum circuits are approximate polynomial-designs
- A spectral gap theorem in SU\((d)\)
- Decoupling with random quantum circuits
- Random quantum circuits are approximate 2-designs
- Holographic duality from random tensor networks
- Erratum to: Onset of random matrix behavior in scrambling systems
- Statistical aspects of the quantum supremacy demonstration
- Mixing properties of stochastic quantum Hamiltonians
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Fault-Tolerant Quantum Computation with Constant Error Rate
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Estimating the coherence of noise
- The emergence of typical entanglement in two-party random processes
- Computational Complexity
- The computational complexity of linear optics
- Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates
This page was built for publication: Random quantum circuits transform local noise into global white noise