Richard Feynman triggered the study of Quantum Computing conjecturing that classical computers could not simulate quantum systems efficiently. Since then, quantum computational models have beenâ€¦ (More)

The class QMA plays a fundamental role in quantum complexity theory and it has found surprising connections to condensed matter physics and in particular in the study of the minimum energy of quantumâ€¦ (More)

The importance of being able to verify quantum computation delegated to remote servers increases with recent development of quantum technologies. In some of the proposed protocols for this task, aâ€¦ (More)

In order to discover how Quantum Mechanics would improve the power of computational devices, Quantum Computation was proposed by Feynman [6] in 1982 and since then some important breakthroughs inâ€¦ (More)

where a âˆˆ Fq is picked uniformly at random and e âˆˆ Fq is an â€™errorâ€™ term drawn from some distribution Ï‡. The goal is to output s, while minimizing the number of samples used and the computation time.â€¦ (More)

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â€¦ (More)