13 citations · 31 across the 6 of their papers we have counts for
7 papers
Quantum Inspired Adaptive Boosting
Bálint Daróczy, Katalin Friedl, László Kabódi +2
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 e…
Pointer Quantum PCPs and Multi-Prover Games
Alex B. Grilo, Iordanis Kerenidis, Attila Pereszlényi
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…
A parallel repetition theorem for entangled two-player one-round games under product distributions
Rahul Jain, Attila Pereszlényi, Penghui Yao
We show a parallel repetition theorem for the entangled value of any two-player one-round game where the questions to Alice an…
One-Sided Error QMA with Shared EPR Pairs -- A Simpler Proof
Attila Pereszlényi
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 prot…
Multi-Prover Quantum Merlin-Arthur Proof Systems with Small Gap
Attila Pereszlényi
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 ga…
A direct product theorem for bounded-round public-coin randomized communication complexity
Rahul Jain, Attila Pereszlenyi, Penghui Yao
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…
On quantum interactive proofs with short messages
Attila Pereszlényi
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 s…