4.6 Article

Rigidity of quantum steering and one-sided device-independent verifiable quantum computation

Journal

NEW JOURNAL OF PHYSICS
Volume 19, Issue -, Pages -

Publisher

IOP PUBLISHING LTD
DOI: 10.1088/1367-2630/aa5cff

Keywords

quantum steering; self-testing; rigidity; delegated quantum computation; device independence

Funding

  1. EPSRC [EP/N003829/1, EP/M013243/1]
  2. EPSRC [EP/N003829/1, EP/M013243/1] Funding Source: UKRI
  3. Engineering and Physical Sciences Research Council [EP/N003829/1, EP/M013243/1] Funding Source: researchfish

Ask authors/readers for more resources

The relationship between correlations and entanglement has played a major role in understanding quantum theory since the work of Einstein et al (1935 Phys. Rev. 47 777-80). Tsirelson proved that Bell states, shared among two parties, when measured suitably, achieve the maximum non-local correlations allowed by quantum mechanics (Cirel'son 1980 Lett. Math. Phys. 4 93-100). Conversely, Reichardt et al showed that observing the maximal correlation value over a sequence of repeated measurements, implies that the underlying quantum state is close to a tensor product of maximally entangled states and, moreover, that it is measured according to an ideal strategy (Reichardt et al 2013 Nature 496 456-60). However, this strong rigidity result comes at a high price, requiring a large number of entangled pairs to be tested. In this paper, we present a significant improvement in terms of the overhead by instead considering quantum steering where the device of the one side is trusted. We first demonstrate a robust one-sided device-independent version of self-testing, which characterises the shared state and measurement operators of two parties up to a certain bound. We show that this bound is optimal up to constant factors and we generalise the results for the most general attacks. This leads us to a rigidity theorem for maximal steering correlations. As a key application we give a one-sided device-independent protocol for verifiable delegated quantum computation, and compare it to other existing protocols, to highlight the cost of trust assumptions. Finally, we show that under reasonable assumptions, the states shared in order to run a certain type of verification protocol must be unitarily equivalent to perfect Bell states.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available