Quantum interactive proofs with weak error bounds

DOI10.1145/2090236.2090259zbMath1347.68152arXiv1012.4427OpenAlexW2023312303MaRDI QIDQ2826062

Hirotada Kobayashi, John Watrous, Tsuyoshi Ito

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.4427

zbMATH Keywords

computational complexityquantum computinginteractive proofsnonlocal correlations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

A Complete Characterization of Unitary Quantum Space ⋮ An improved semidefinite programming hierarchy for testing entanglement

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

This page was built for publication: Quantum interactive proofs with weak error bounds