the verification of the computation within these models could be also performed in the restricted scheme. Encoding via blindness (a cryptographic protocol for dele-gated computing) has proven successful for the verification of universal quantum computation with a restricted verifier. In this paper, we present

We present a quantumly-enhanced protocol to achieve unconditionally secure delegated clas-sical computation where the client and the server have both their classical and quantum comput-ing capacity limited. We prove the same task cannot be achieved using only classical protocols. This extends

the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms, are demonstrated. The client only needs to be able

increase in the type, range and quality of papers submitted for consideration for publication and we accepted 17 papers from those submitted. All papers were double blind peer-reviewed before acceptance into the conference for publication. There are several definite strands of research and interest

We will try to explore, primarily from the complexity-theoretic point of view, limitations of error-correction and fault-tolerant quantum computation. We consider stochastic models of quantum computation on n qubits subject to noise operators that are obtained as products of tiny noise operators

predictions for their behavior? Vazirani has asked [Vaz07]: If computing predictions for Quantum Mechanics requires exponential resources, is Quantum Mechanics a falsifiable theory? In cryptographic settings, an untrusted future company wants to sell a quantum computer or perform a delegated quantum

comparison becomes an intractable work, especially when the DNA database is big and the computation resources are limited. Although the generic computation delegation schemes provide a theoretically feasible solution to this problem, it suffers from severe inefficiency when we directly substitute the general

Quantum Computing (QC) research has gained a lot of momentum recently due to several theoretical analyses that indicate that QC is significantly more efficient at solving certain classes of problems than classical computing. While experimental validation will ultimately be required, the primitive

of weight schemes, eigenvalues, and Kolmogorov complexity. All these formulations are information-theoretic and rely on the principle that if an algorithm successfully computes a function then, in particular, it is able to distinguish between inputs which map to different values. We present a stronger

every single spin can be measured individually. This unveils that an intrinsic complexity of naturally-occurring 2D quantum systems — which has been a long-standing challenge for traditional computers — could be tamed as a computationally valuable resource, even if we are limited not to create newly