Complexity of quantum circuits via sensitivity, magic, and coherence
From MaRDI portal
Publication:6564161
DOI10.1007/s00220-024-05030-6MaRDI QIDQ6564161
Arthur Jaffe, Roy J. Garcia, Lu Li, Dax Enshan Koh, Kaifeng Bu
Publication date: 28 June 2024
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Communication, information (94Axx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The average sensitivity of bounded-depth circuits
- Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
- Upper bounds on Fourier entropy
- Boolean function complexity. Advances and frontiers.
- Bounded-depth circuits cannot sample good codes
- Entanglement rates and the stability of the area law for the entanglement entropy
- Optimal hypercontractivity for Fermi fields and related non-commutative integration inequalities
- Circuit complexity in interacting QFTs and RG flows
- Circuit complexity in quantum field theory
- Holographic spacetimes as quantum circuits of path-integrations
- Classical simulation of quantum circuits by half Gauss sums
- Towards a proof of the Fourier-entropy conjecture?
- Fermionic linear optics revisited
- The typical-state paradox: diagnosing horizons with complexity
- Quantum skew divergence
- Tight Bound on Relative Entropy by Entropy Difference
- Decision trees, protocols and the entropy-influence conjecture
- The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions
- Quantum Computation and Quantum Information
- Quantum Computation as Geometry
- Constant depth circuits, Fourier transform, and learnability
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- The Algorithmic Foundations of Differential Privacy
- Hudson’s theorem for finite-dimensional quantum systems
- Matchgates and classical simulation of quantum circuits
- Every monotone graph property has a sharp threshold
- 10.1162/153244302760200704
- A quantitative theory of coherent delocalization
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Quantifying magic for multi-qubit operations
- Analysis of Boolean Functions
- Gentle measurement of quantum states and differential privacy
- A Composition Theorem for the Fourier Entropy-Influence Conjecture
- Circuit Complexity in Topological Quantum Field Theory
Related Items (1)
This page was built for publication: Complexity of quantum circuits via sensitivity, magic, and coherence
