Stabilizer testing and magic entropy via quantum Fourier analysis
From MaRDI portal
Cites work
- A central limit theorem in many-body quantum dynamics
- A free analogue of Shannon's problem on monotonicity of entropy
- A quantum central limit theorem for non-equilibrium systems: exact local relaxation of correlated states
- A quantum central limit theorem for sums of independent identically distributed random variables
- A quantum linearity test for robustly verifying entanglement
- A quantum-mechanical central limit theorem
- Addition of certain non-commuting random variables
- An algebraic version of the central limit theorem
- An efficient test for product states with applications to quantum Merlin-Arthur games
- Block maps and Fourier analysis
- BOSONIC CENTRAL LIMIT THEOREM FOR THE ONE-DIMENSIONAL XY MODEL
- Central limit theorem for locally interacting Fermi gas
- Central limit theorem for mixing quantum systems and the CCR-algebra of fluctuations
- Central limit theorems for the large-spin asymptotics of quantum spins
- Completely positive linear maps on complex matrices
- Complexity of quantum circuits via sensitivity, magic, and coherence
- Composition of low-error 2-query PCPs using decodable PCPs
- Convergence rates for the quantum central limit theorem
- Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation
- Entanglement entropy and conformal field theory
- Entropy power inequalities for qudits
- Exchange relation planar algebras of small rank
- Fermionic linear optics revisited
- Fermionic quantum computation
- Holographic entanglement entropy: an overview
- scientific article; zbMATH DE number 4082316 (Why is no real title available?)
- scientific article; zbMATH DE number 1775384 (Why is no real title available?)
- Hudson’s theorem for finite-dimensional quantum systems
- Inequalities: theory of majorization and its applications
- Introduction to Property Testing
- Learning Quantum Circuits of Some T Gates
- Linear transformations which preserve trace and positive semidefiniteness of operators
- Local Hamiltonians whose ground states are hard to approximate
- Locally testable codes and PCPs of almost-linear length
- Low-degree testing for quantum states, and a quantum entangled games PCP for QMA
- Low-stabilizer-complexity quantum states are not pseudorandom
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- Negative quasi-probability as a resource for quantum computation
- Non-commutative central limits
- Non-deterministic exponential time has two-prover interactive protocols
- On a generalized central limit theorem and large deviations for homogeneous open quantum walks
- On a quantum entropy power inequality of Audenaert, Datta, and Ozols
- On quantum Rényi entropies: a new generalization and some properties
- On the complexity of k-SAT
- Optimal testing of Reed-Muller codes
- Possible generalization of Boltzmann-Gibbs statistics.
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Properties of subentropy
- Quantum f-divergences and error correction
- Quantum Boolean functions
- Quantum central limit theorems for weakly dependent maps. II
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Quantum computers that can be simulated classically in polynomial time
- Quantum entropy and central limit theorem
- Quantum Fourier analysis
- Quantum higher-order Fourier analysis and the Clifford hierarchy
- Quantum information processing with finite resources. Mathematical foundations
- Quantum interactive proofs and the complexity of separability testing
- Quantum locally testable codes
- Quantum Ruzsa divergence to quantify magic
- Relative entropy of states of von Neumann algebras
- Resource theory of quantum scrambling
- Robust PSPs of proximity, shorter PSPs and applications to coding
- Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations
- Self-testing/correcting with applications to numerical problems
- Shannon's monotonicity problem for free and classical entropy
- Stabilization of Quantum Computations by Symmetrization
- Symmetric informationally complete–positive operator valued measures and the extended Clifford group
- Testing Reed–Muller Codes
- The Entropy Power Inequality for Quantum Systems
- The Heisenberg representation of quantum computers
- The parametrized complexity of quantum verification
- The resource theory of stabilizer quantum computation
- The theory of quantum information
- Two-query PCP with subconstant error
- Volumes of restricted Minkowski sums and the free analogue of the entropy power inequality
Cited in
(1)
This page was built for publication: Stabilizer testing and magic entropy via quantum Fourier analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933530)
