Decoupling with random quantum circuits
From MaRDI portal
Abstract: Decoupling has become a central concept in quantum information theory with applications including proving coding theorems, randomness extraction and the study of conditions for reaching thermal equilibrium. However, our understanding of the dynamics that lead to decoupling is limited. In fact, the only families of transformations that are known to lead to decoupling are (approximate) unitary two-designs, i.e., measures over the unitary group which behave like the Haar measure as far as the first two moments are concerned. Such families include for example random quantum circuits with O(n^2) gates, where n is the number of qubits in the system under consideration. In fact, all known constructions of decoupling circuits use Omega(n^2) gates. Here, we prove that random quantum circuits with O(n log^2 n) gates satisfy an essentially optimal decoupling theorem. In addition, these circuits can be implemented in depth O(log^3 n). This proves that decoupling can happen in a time that scales polylogarithmically in the number of particles in the system, provided all the particles are allowed to interact. Our proof does not proceed by showing that such circuits are approximate two-designs in the usual sense, but rather we directly analyze the decoupling property.
Recommendations
Cites work
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Aspects of generic entanglement
- Decoupling with unitary approximate two-designs
- Efficient Quantum Polar Codes Requiring No Preshared Entanglement
- Entanglement Sampling and Applications
- Local random quantum circuits are approximate polynomial-designs
- One-shot decoupling
- Probability and Computing
- Pseudo-random unitary operators for quantum information processing
- Quantum state merging and negative information
- Quantum to classical randomness extractors
- Random quantum circuits are approximate 2-designs
- The mother of all protocols: restructuring quantum information's family tree
- Towards the fast scrambling conjecture
Cited in
(28)- Nonlinear stochastic operators and associated inhomogeneous entangled quantum Markov chains
- Quantum epidemiology: operator growth, thermal effects, and SYK
- The black hole interior from non-isometric codes and complexity
- Mixing properties of stochastic quantum Hamiltonians
- Quantum causal influence
- Reliability function of quantum information decoupling via the sandwiched Rényi divergence
- Chaos and complexity by design
- Classically simulating quantum circuits with local depolarizing noise
- Chaos, complexity, and random matrices
- Linear growth of circuit complexity from Brownian dynamics
- Stringy effects in scrambling
- Spectral decoupling in many-body quantum chaos
- Mixing and localization in random time-periodic quantum circuits of Clifford unitaries
- Decoupling with unitary approximate two-designs
- Topological defects in Floquet circuits
- Typical unpreparability of quantum states with quantum circuit model
- Universal constraints on energy flow and SYK thermalization
- Random quantum circuits are approximate 2-designs
- Quantum error correction from complexity in Brownian SYK
- One-shot randomized and nonrandomized partial decoupling
- Random quantum circuits transform local noise into global white noise
- Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates
- Correlation length in random MPS and PEPS
- Number of quantum measurement outcomes as a resource
- Propagation of correlations in local random quantum circuits
- One-shot decoupling
- Can the macroscopic fluctuation theory be quantized?
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
This page was built for publication: Decoupling with random quantum circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q748450)
