Unscrambling Quantum Information with Clifford decoders

Abstract

Quantum information scrambling is a unitary process that destroys local correlations and spreads information throughout the system, effectively hiding it in nonlocal degrees of freedom. In principle, unscrambling this information is possible with perfect knowledge of the unitary dynamics [B. Yoshida and A. Kitaev, arXiv:1710.03363.]. However, this Letter demonstrates that even without previous knowledge of the internal dynamics, information can be efficiently decoded from an unknown scrambler by monitoring the outgoing information of a local subsystem. Surprisingly, we show that scramblers with unknown internal dynamics, which are rapidly mixing but not fully chaotic, can be decoded using Clifford decoders. The essential properties of a scrambling unitary can be efficiently recovered, even if the process is exponentially complex. Specifically, we establish that a unitary operator composed of $t$ non-Clifford gates admits a Clifford decoder up to $t\le n$.

References in corpus (29)

• A bound on chaos
• Average Entropy of a Subsystem
• Black holes and the butterfly effect
• Improved Simulation of Stabilizer Circuits
• Black holes as mirrors: quantum information in random subsystems
• Information in Black Hole Radiation
• Fast Scramblers
• Chaos in quantum channels
• Localized shocks
• Multiple Shocks
• Chaos and complexity by design
• Towards the fast scrambling conjecture
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Lieb-Robinson and the butterfly effect
• Disentangling Scrambling and Decoherence via Quantum Teleportation
• Quantum Chaos is Quantum
• Information Scrambling over Bipartitions: Equilibration, Entropy Production, and Typicality
• Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics
• Entanglement, quantum randomness, and complexity beyond scrambling
• Transitions in entanglement complexity in random quantum circuits by measurements
• Generalized Entanglement Entropies of Quantum Designs
• Conditional Mutual Information of Bipartite Unitaries and Scrambling
• Learning efficient decoders for quasi-chaotic quantum scramblers
• Transitions in Entanglement Complexity in Random Circuits
• Learning and Testing Algorithms for the Clifford Group
• Isospectral twirling and quantum chaos
• Learning quantum circuits of some $T$ gates
• Random Matrix Theory of the Isospectral twirling
• Retrieving information from a black hole using quantum machine learning

Cited by in corpus (24)

• Learning t-doped stabilizer states
• Pseudomagic Quantum States
• Learning efficient decoders for quasi-chaotic quantum scramblers
• Stabilizer entropy in non-integrable quantum evolutions
• Magic-induced computational separation in entanglement theory
• Phase transition in Stabilizer Entropy and efficient purity estimation
• Magic Resources of the Heisenberg Picture
• Quantum neural networks form Gaussian processes
• Stabilizer entropy of quantum tetrahedra
• Doped stabilizer states in many-body physics and where to find them
• Stabilizer Tensor Networks with Magic State Injection
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• Learning quantum states of continuous variable systems
• Bridging Entanglement and Magic Resources within Operator Space
• Optimal trace-distance bounds for free-fermionic states: Testing and improved tomography
• Hayden-Preskill recovery in chaotic and integrable unitary circuit dynamics
• Anticoncentration and State Design of Doped Real Clifford Circuits and Tensor Networks
• Non-Clifford Cost of Random Unitaries
• PAC-learning of free-fermionic states is NP-hard
• Learning out-of-time-ordered correlators with classical kernel methods
• On the stabilizer complexity of Hawking radiation
• Harvesting stabilizer entropy and non-locality from a quantum field
• The symplectic rank of non-Gaussian quantum states
• Adaptively secure unitary designs with constant non-Clifford cost