8
8.0
Jun 28, 2018
06/18
by
Theodoros Kapourniotis; Vedran Dunjko; Elham Kashefi
texts
eye 8
favorite 0
comment 0
In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highlighted recently. Currently, most of efficient quantum verification protocols are based on cryptographic techniques where an almost classical verifier executes her desired encrypted quantum computation remotely on an untrusted quantum prover. In this work we present a new protocol for quantum verification by...
Topic: Quantum Physics
Source: http://arxiv.org/abs/1506.06943
2
2.0
Jun 30, 2018
06/18
by
Theodoros Kapourniotis; Elham Kashefi; Animesh Datta
texts
eye 2
favorite 0
comment 0
While building a universal quantum computer remains challenging, devices of restricted power such as the so-called one pure qubit model have attracted considerable attention. An important step in the construction of these limited quantum computational devices is the understanding of whether the verification of the computation within these models could be also performed in the restricted scheme. Encoding via blindness (a cryptographic protocol for delegated computing) has proven successful for...
Topic: Quantum Physics
Source: http://arxiv.org/abs/1403.1438
3
3.0
Jun 30, 2018
06/18
by
Vedran Dunjko; Theodoros Kapourniotis; Elham Kashefi
texts
eye 3
favorite 0
comment 0
We present a quantumly-enhanced protocol to achieve unconditionally secure delegated classical computation where the client and the server have both limited classical and quantum computing capacity. We prove the same task cannot be achieved using only classical protocols. This extends the work of Anders and Browne on the computational power of correlations to a security setting. Concretely, we present how a client with access to a non-universal classical gate such as a parity gate could achieve...
Topic: Quantum Physics
Source: http://arxiv.org/abs/1405.4558
2
2.0
Jun 30, 2018
06/18
by
Daniel Mills; Anna Pappa; Theodoros Kapourniotis; Elham Kashefi
texts
eye 2
favorite 0
comment 0
We propose a new composable and information-theoretically secure protocol to verify that a server has the power to sample from a sub-universal quantum machine implementing only commuting gates. By allowing the client to manipulate single qubits, we exploit properties of Measurement based Blind Quantum Computing to prove security against a malicious Server and therefore certify quantum supremacy without the need for a universal quantum computer.
Topic: Quantum Physics
Source: http://arxiv.org/abs/1704.01998
