Zobrazeno 1 - 10
of 222
pro vyhledávání: '"A. Pereszlenyi"'
Building on the quantum ensemble based classifier algorithm of Schuld and Petruccione [arXiv:1704.02146v1], we devise equivalent classical algorithms which show that this quantum ensemble method does not have advantage over classical algorithms. Esse
Externí odkaz:
http://arxiv.org/abs/2102.00949
Publikováno v:
PLoS ONE, Vol 18, Iss 11, p e0293816 (2023)
Viking sailors ruled the North Atlantic Ocean for about three hundred years. Their main sailing route was the 60° 21' 55'' latitude between Norway and Greenland. Although they did not have a magnetic compass, in sunshine they used a sun-compass to d
Externí odkaz:
https://doaj.org/article/09b0745c4ad2460bbd098fd4e3a0150a
The quantum PCP (QPCP) conjecture states that all problems in QMA, the quantum analogue of NP, admit quantum verifiers that only act on a constant number of qubits of a polynomial size quantum proof and have a constant gap between completeness and so
Externí odkaz:
http://arxiv.org/abs/1603.00903
We show a parallel repetition theorem for the entangled value $\omega^*(G)$ of any two-player one-round game $G$ where the questions $(x,y) \in \mathcal{X}\times\mathcal{Y}$ to Alice and Bob are drawn from a product distribution on $\mathcal{X}\times
Externí odkaz:
http://arxiv.org/abs/1311.6309
Autor:
Pereszlényi, Attila
We give a simpler proof of one of the results of Kobayashi, Le Gall, and Nishimura [arXiv:1210.1290v2], which shows that any QMA protocol can be converted to a one-sided error protocol, in which Arthur and Merlin initially share a constant number of
Externí odkaz:
http://arxiv.org/abs/1306.5406
Autor:
Pereszlényi, Attila
This paper studies multiple-proof quantum Merlin-Arthur (QMA) proof systems in the setting when the completeness-soundness gap is small. Small means that we only lower-bound the gap with an inverse-exponential function of the input length, or with an
Externí odkaz:
http://arxiv.org/abs/1205.2761
In this paper, we show a direct product theorm in the model of two-party bounded-round public-coin randomized communication complexity. For a relation f subset of X times Y times Z (X,Y,Z are finite sets), let R^{(t), pub}_e (f) denote the two-party
Externí odkaz:
http://arxiv.org/abs/1201.1666
Autor:
Pereszlényi, Attila
This paper proves one of the open problem posed by Beigi et al. in arXiv:1004.0411v2. We consider quantum interactive proof systems where in the beginning the verifier and prover send messages to each other with the combined length of all messages be
Externí odkaz:
http://arxiv.org/abs/1109.0964
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Hladik, Vit, Berenblyum, Roman, Pereszlenyi, Miroslav, Krejci, Oldrich, Francu, Juraj, Riis, Fridtjof, Ford, Eric P., Kollbotn, Lars, Khrulenko, Alexey
Publikováno v:
In Energy Procedia July 2017 114:5742-5747