Quantifying non-stabilizerness via information scrambling
From MaRDI portal
Publication:6600311
DOI10.21468/SCIPOSTPHYS.16.2.043MaRDI QIDQ6600311
Publication date: 9 September 2024
Published in: SciPost Physics (Search for Journal in Brave)
Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) General relativity (83Cxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Black holes and the butterfly effect
- A new universal and fault-tolerant quantum basis
- Completely positive linear maps on complex matrices
- Fault-tolerant quantum computation with higher-dimensional systems
- Chaos in quantum channels
- A bound on chaos
- Chaos and complexity by design
- Quantum epidemiology: operator growth, thermal effects, and SYK
- Metal--insulator transition in a weakly interacting many-electron system with localized single-particle states
- Bulk locality and quantum error correction in AdS/CFT
- The Heisenberg representation of quantum computers
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- The resource theory of stabilizer quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The computational complexity of linear optics
Related Items (1)
This page was built for publication: Quantifying non-stabilizerness via information scrambling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6600311)