Cover Image

A slightly improved upper bound for quantum statistical zero-knowledge

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gall, François Le, Liu, Yupan, Wang, Qisheng
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Space-bounded quantum state testing via space-efficient quantum singular value transformation
by: Gall, François Le, et al.
Published: (2023)

Space-bounded quantum interactive proof systems
by: Gall, François Le, et al.
Published: (2024)

Computational hardness of estimating quantum entropies via binary entropy bounds
by: Liu, Yupan
Published: (2026)

Quantum state testing beyond the polarizing regime and quantum triangular discrimination
by: Liu, Yupan
Published: (2023)

Quantum Merlin-Arthur proof systems for synthesizing quantum states
by: Delavenne, Hugo, et al.
Published: (2023)

On estimating the quantum $\ell_α$ distance
by: Liu, Yupan, et al.
Published: (2025)

On estimating the trace of quantum state powers
by: Liu, Yupan, et al.
Published: (2024)

A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
by: Chen, Kean, et al.
Published: (2025)

On Estimating the Quantum Tsallis Relative Entropy
by: Bao, Jinge, et al.
Published: (2025)

Does there exist a quantum fingerprinting protocol without coherent measurements?
by: Hasegawa, Atsuya, et al.
Published: (2025)

Information-Theoretic Lower Bounds for Approximating Monomials via Optimal Quantum Tsallis Entropy Estimation
by: Wang, Qisheng
Published: (2025)

Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
by: Wang, Qisheng
Published: (2024)

Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via Samplizer
by: Wang, Qisheng, et al.
Published: (2024)

Group Order is in QCMA
by: Gall, François Le, et al.
Published: (2025)

Classical versus quantum queries in quantum PCPs with classical proofs
by: Buhrman, Harry, et al.
Published: (2024)

The role of shared randomness in quantum state certification with unentangled measurements
by: Liu, Yuhan, et al.
Published: (2024)

Adversarially robust quantum state learning and testing
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Trace Estimation of Quantum State Powers: Sample Complexity and Computational Hardness
by: Chen, Kean, et al.
Published: (2025)

Information-theoretic generalization bounds for learning from quantum data
by: Caro, Matthias, et al.
Published: (2023)

Quantum Multi-Level Estimation of Functionals of Discrete Distributions
by: Chen, Kean, et al.
Published: (2026)

The vast world of quantum advantage
by: Huang, Hsin-Yuan, et al.
Published: (2025)

On the undecidability of quantum channel capacities
by: Bhattacharyya, Archishna, et al.
Published: (2026)

Exponential speedups in fault-tolerant processing of quantum experiments
by: Kannan, Ishaan, et al.
Published: (2026)

Exact spectral gaps of random one-dimensional quantum circuits
by: Deneris, Andrew E., et al.
Published: (2024)

Transversal non-Clifford gates for quantum LDPC codes on sheaves
by: Lin, Ting-Chun
Published: (2024)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
by: Gharibian, Sevag, et al.
Published: (2021)

Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction
by: Delavenne, Hugo, et al.
Published: (2024)

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
by: Dinur, Irit, et al.
Published: (2024)

Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
by: Liu, Yupan, et al.
Published: (2026)

Beating the natural Grover bound for low-energy estimation and state preparation
by: Buhrman, Harry, et al.
Published: (2024)

Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
by: Gall, François Le
Published: (2024)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
by: Hasegawa, Atsuya, et al.
Published: (2025)

Multi-Prover Interactive Proof Systems with Leakage
by: Asadi, Vahid R., et al.
Published: (2026)

The computational two-way quantum capacity
by: Meyer, Johannes Jakob, et al.
Published: (2026)

Random ensembles of symplectic and unitary states are indistinguishable
by: West, Maxwell, et al.
Published: (2024)

Accessible Quantum Correlations Under Complexity Constraints
by: Yángüez, Álvaro, et al.
Published: (2026)

Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
by: Golowich, Louis, et al.
Published: (2024)

Quantum Advantages in (n,d)->1 Random Access Codes
by: Ambainis, Andris, et al.
Published: (2015)

StoqMA vs. MA: the power of error reduction
by: Aharonov, Dorit, et al.
Published: (2020)

A polynomial-time classical algorithm for noisy quantum circuits
by: Schuster, Thomas, et al.
Published: (2024)