Decoupling with random quantum circuits
arXiv:1307.0632 · doi:10.1007/s00220-015-2470-1
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 Ω(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.
25 pages
References in corpus (13)
- Black holes as mirrors: quantum information in random subsystems
- Quantum information can be negative
- The thermodynamic meaning of negative entropy
- Aspects of generic entanglement
- The mother of all protocols: Restructuring quantum information's family tree
- Unitarity of black hole evaporation in final-state projection models
- Entanglement sampling and applications
- The decoupling approach to quantum information theory
- Exact convergence times for generation of random bipartite entanglement
- Disordered Systems and the Replica Method in AdS/CFT
- Efficient algorithm for multi-qudit twirling for ensemble quantum computation
- Relative Thermalization
- Near-linear constructions of exact unitary 2-designs
Cited by in corpus (68)
- Chaos and complexity by design
- Chaos, Complexity, and Random Matrices
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Barren plateaus preclude learning scramblers
- Approximate unitary -designs by short random quantum circuits using nearest-neighbor and long-range gates
- Direct randomized benchmarking for multi-qubit devices
- Entanglement sampling and applications
- Random quantum circuits anti-concentrate in log depth
- Open Quantum Symmetric Simple Exclusion Process
- Entanglement dynamics in hybrid quantum circuits
- Quantum Simulation of the Sachdev-Ye-Kitaev Model by Asymmetric Qubitization
- Fast scrambling on sparse graphs
- Scrambling and Complexity in Phase Space
- Quantum coding with low-depth random circuits
- Unitary designs from statistical mechanics in random quantum circuits
- Entanglement production and information scrambling in a noisy spin system
- Equilibrium Fluctuations in Maximally Noisy Extended Quantum Systems
- Tight bounds on the convergence of noisy random circuits to the uniform distribution
- Strengthening weak measurements of qubit out-of-time-order correlators
- Dynamics of Fluctuations in Quantum Simple Exclusion Processes
- Fastest local entanglement scrambler, multistage thermalization, and a non-Hermitian phantom
- A Separation of Out-of-time-ordered Correlation and Entanglement
- Relative Thermalization
- Spectral decoupling in many-body quantum chaos
- Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
- Measurement-induced phase transitions in sparse nonlocal scramblers
- Scrambling and Lyapunov Exponent in Unitary Networks with Tunable Interactions
- Crystalline Quantum Circuits
- Correlation length in random MPS and PEPS
- A quantum hamiltonian simulation benchmark
- How to build Hamiltonians that transport noncommuting charges in quantum thermodynamics
- Classically estimating observables of noiseless quantum circuits
- Can the Macroscopic Fluctuation Theory be Quantized?
- Operator growth in random quantum circuits with symmetry
- Quantum neural networks form Gaussian processes
- Universal fluctuations around typicality for quantum ergodic systems
- Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
- One-shot quantum error correction of classical and quantum information
- Sachdev-Ye-Kitaev circuits for braiding and charging Majorana zero modes
- Near-linear constructions of exact unitary 2-designs
- Topological Defects in Floquet Circuits
- The principle of majorization: application to random quantum circuits
- Quantum Error Correction from Complexity in Brownian SYK
- Decoupling with random diagonal unitaries
- Estimating the randomness of quantum circuit ensembles up to 50 qubits
- Efficient methods for one-shot quantum communication
- One-Shot Randomized and Nonrandomized Partial Decoupling
- Mixing and localisation in random time-periodic quantum circuits of Clifford unitaries
- Unitary k-designs from random number-conserving quantum circuits
- Complexity-constrained quantum thermodynamics
- Approximate Unitary -Designs from Shallow, Low-Communication Circuits
- Entanglement structure in the volume-law phase of hybrid quantum automaton circuits
- Linear Cross Entropy Benchmarking with Clifford Circuits
- Saturation and recurrence of quantum complexity in random local quantum dynamics
- Universal Spreading of Conditional Mutual Information in Noisy Random Circuits
- Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder
- Reliability Function of Quantum Information Decoupling via the Sandwiched Rényi Divergence
- Hayden-Preskill recovery in chaotic and integrable unitary circuit dynamics
- Phase transitions in sampling and error correction in local Brownian circuits
- Quantum Local Differential Privacy and Quantum Statistical Query Model
- Decoding general error correcting codes and the role of complementarity
- A Theory of Direct Randomized Benchmarking
- Extending Classically Simulatable Bounds of Clifford Circuits with Nonstabilizer States via Framed Wigner Functions
- Charge-conserving unitaries typically generate optimal covariant quantum error-correcting codes
- Dual-unitary shadow tomography
- Propagation of correlations in Local Random Quantum Circuits
- Field theory of charge sharpening in symmetric monitored quantum circuits
- Circuit complexity and functionality: a thermodynamic perspective