Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Gutoski, Gus"'
Publikováno v:
Quantum 2, 89 (2018)
We introduce a definition of the fidelity function for multi-round quantum strategies, which we call the strategy fidelity, that is a generalization of the fidelity function for quantum states. We provide many properties of the strategy fidelity incl
Externí odkaz:
http://arxiv.org/abs/1704.04033
Publikováno v:
Chicago Journal of Theoretical Computer Science, 2016
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum oblivious transfe
Externí odkaz:
http://arxiv.org/abs/1310.3262
Autor:
Gutoski, Gus, Johnston, Nathaniel
Publikováno v:
J. Math. Phys. 55, 032201 (2014)
We study the number of measurements required for quantum process tomography under prior information, such as a promise that the unknown channel is unitary. We introduce the notion of an interactive observable and we show that any unitary channel acti
Externí odkaz:
http://arxiv.org/abs/1309.0840
Publikováno v:
Theory of Computing vol. 11, article 3, pages 59-103, March 2015
We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum interactive proof
Externí odkaz:
http://arxiv.org/abs/1308.5788
Publikováno v:
Advances in Cryptology -- Proc. CRYPTO 2013, LNCS vol. 8043, pp. 344-360, Springer
One-time programs are modelled after a black box that allows a single evaluation of a function, and then self-destructs. Because software can, in principle, be copied, general one-time programs exists only in the hardware token model: it has been sho
Externí odkaz:
http://arxiv.org/abs/1211.1080
Autor:
Gutoski, Gus
Publikováno v:
Chicago Journal of Theoretical Computer Science, article 7, 2013
This paper studies a generalization of multi-prover interactive proofs in which a verifier interacts with two competing teams of provers: one team attempts to convince the verifier to accept while the other attempts to convince the verifier to reject
Externí odkaz:
http://arxiv.org/abs/1012.0821
Autor:
Gutoski, Gus, Wu, Xiaodi
Publikováno v:
Computational Complexity: Volume 22, Issue 2 (2013), Page 385-428
This paper presents an efficient parallel approximation scheme for a new class of min-max problems. The algorithm is derived from the matrix multiplicative weights update method and can be used to find near-optimal strategies for competitive two-part
Externí odkaz:
http://arxiv.org/abs/1011.2787
Autor:
Gutoski, Gus
Publikováno v:
Journal of Mathematical Physics Volume 53, Issue 3, 032202 (2012)
The present paper studies an operator norm that captures the distinguishability of quantum strategies in the same sense that the trace norm captures the distinguishability of quantum states or the diamond norm captures the distinguishability of quant
Externí odkaz:
http://arxiv.org/abs/1008.4636
Autor:
Gutoski, Gus
This thesis is divided into two parts. In Part I we introduce a new formalism for quantum strategies, which specify the actions of one party in any multi-party interaction involving the exchange of multiple quantum messages among the parties. This fo
Externí odkaz:
http://arxiv.org/abs/1003.0038
Autor:
Gutoski, Gus
We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions and n-qub
Externí odkaz:
http://arxiv.org/abs/0908.3491