A Unified Complexity Framework for Quantum Property Testing
quant-ph, cs.CC, cs.IT, math.IT
Submitted: 2026-08-03
Updated: 2026-10-29
Comments: 48 pages, 2 tables. More optimality mentioned; Hellinger distance added back. v3: Schmidt rank & MPS testing added; Hellinger distance removed. v2: Renyi/Tsallis entropy, rank testing, Hellinger distance added. v1: fidelity, trace distance, von Neumann entropy
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Minimax optimal estimators for general additive functional estimation
- A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
- Spectrum Estimation is Almost as Hard as Tomography
- Query-Optimal and Sample-Optimal Quantum Algorithms for Estimating Fidelity to a Pure State
- Improved Quantum Algorithms for Fidelity Estimation
- Optimal von Neumann Entropy Estimation
- Fidelity Estimation to a Known Quantum State Is Nearly Quadratic in the Smaller Rank
- Random dimension reduction and learning symmetric properties of quantum states
- Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform
- The Keyl-Werner algorithm is not optimal for spectrum estimation
- Mixed state tomography reduces to pure state tomography
- Optimal lower bounds for quantum state tomography
- Conjugate queries can help
- Quantum algorithms for Uhlmann transformation
- Estimating Fidelity to a Reference Quantum State
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements