Compare Papers
Paper 1
Parallel repetition with a threshold in quantum interactive proofs
Abel Molina
- Year
- 2020
- Journal
- arXiv preprint
- DOI
- arXiv:2008.07445
- arXiv
- 2008.07445
In this note, we show that $O(\log (1/ε))$ rounds of parallel repetition with a threshold suffice to reduce completeness and soundness error to $ε$ for single-prover quantum interactive proof systems. This improves on a previous $O(\log (1/ε) \log \log (1/ε))$ bound from Hornby (2018), while also simplifying its proof. A key element in our proof is a concentration bound from Impagliazzo and Kabanets (2010).
Open paperPaper 2
Proceedings 9th Workshop on Quantum Physics and Logic
Ross Duncan, Prakash Panangaden
- Year
- 2014
- Journal
- arXiv preprint
- DOI
- arXiv:1407.8427
- arXiv
- 1407.8427
This volume contains the proceedings of the ninth workshop on Quantum Physics and Logic (QPL2012) which took place in Brussels from the 10th to the 12th of October 2012. QPL2012 brought together researchers working on mathematical foundations of quantum physics, quantum computing, and spatio-temporal causal structures. The particular focus was on the use of logical tools, ordered algebraic and category-theoretic structures, formal languages, semantical techniques, and other computer science methods for the study of physical behaviour in general.
Open paper