Zobrazeno 1 - 10
of 215
pro vyhledávání: '"Watrous, John"'
Autor:
Bostanci, John, Watrous, John
Publikováno v:
Quantum 6, 882 (2022)
This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that the computa
Externí odkaz:
http://arxiv.org/abs/2102.00512
Autor:
Girard, Mark, Leung, Debbie, Levick, Jeremy, Li, Chi-Kwong, Paulsen, Vern, Poon, Yiu Tung, Watrous, John
In the theory of quantum information, the mixed-unitary quantum channels, for any positive integer dimension $n$, are those linear maps that can be expressed as a convex combination of conjugations by $n\times n$ complex unitary matrices. We consider
Externí odkaz:
http://arxiv.org/abs/2003.14405
Autor:
Ghosh, Soumik, Watrous, John
This paper studies complexity theoretic aspects of quantum refereed games, which are abstract games between two competing players that send quantum states to a referee, who performs an efficiently implementable joint measurement on the two states to
Externí odkaz:
http://arxiv.org/abs/2002.01509
Autor:
Lee, Colin Do-Yan, Watrous, John
Publikováno v:
Quantum 4, 253 (2020)
A quantum channel is said to be a mixed-unitary channel if it can be expressed as a convex combination of unitary channels. We prove that, given the Choi representation of a quantum channel, it is NP-hard with respect to polynomial-time Turing reduct
Externí odkaz:
http://arxiv.org/abs/1902.03164
Publikováno v:
Quantum 5, 448 (2021)
We identify necessary and sufficient conditions for a quantum channel to be optimal for any convex optimization problem in which the optimization is taken over the set of all quantum channels of a fixed size. Optimality conditions for convex optimiza
Externí odkaz:
http://arxiv.org/abs/1810.13295
Autor:
Molina, Abel, Watrous, John
Yao (1993) proved that quantum Turing machines and uniformly generated quantum circuits are polynomially equivalent computational models: $t \geq n$ steps of a quantum Turing machine running on an input of length $n$ can be simulated by a uniformly g
Externí odkaz:
http://arxiv.org/abs/1808.01701
Autor:
Menda, Sanketh, Watrous, John
This paper investigates the power of quantum statistical zero knowledge interactive proof systems in the relativized setting. We prove the existence of an oracle relative to which quantum statistical zero-knowledge does not contain UP intersect coUP,
Externí odkaz:
http://arxiv.org/abs/1801.08967
Autor:
Su, Yuan, Watrous, John
Publikováno v:
Quantum 2, 98 (2018)
The quantum strategy (or quantum combs) framework is a useful tool for reasoning about interactions among entities that process and exchange quantum information over the course of multiple turns. We prove a time-reversal property for a class of linea
Externí odkaz:
http://arxiv.org/abs/1801.08491
Autor:
Russo, Vincent, Watrous, John
Several variants of nonlocal games have been considered in the study of quantum entanglement and nonlocality. This paper concerns two of these variants, called quantum-classical games and extended nonlocal games. We give a construction of an extended
Externí odkaz:
http://arxiv.org/abs/1709.01837