On quantum interactive proofs with a laconic prover
quant-ph, cs.CC, cs.CR
Submitted: 2026-09-30
Updated: 2026-10-05
Terminology
Sources
- Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination
- Improvements in Quantum SDP-Solving with Applications
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Properties of Classical and Quantum Jensen-Shannon Divergence
- Quantum Amplitude Amplification and Estimation
- Quantum interactive proofs with short messages
- Hamiltonian Simulation Using Linear Combinations of Unitary Operations
- Designing Optimal Quantum Detectors Via Semidefinite Programming
- Cryptographic Distinguishability Measures for Quantum Mechanical States
- Improved Quantum Algorithms for Fidelity Estimation
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Parallel approximation of min-max problems
- Quantum R'enyi and $f$-divergences from integral representations
- QIP = PSPACE
- Two-message quantum interactive proofs are in PSPACE
- Parallel approximation of non-interactive zero-sum quantum games
- Quantum measurements and the Abelian Stabilizer Problem
- Generalized Quantum Arthur-Merlin Games
- Non-Interactive Quantum Statistical and Perfect Zero-Knowledge
- The operational meaning of min- and max-entropy
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity