Simplified instantaneous non-local quantum computation with applications to position-based cryptography

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages, 2 figures. V2: clarified results of the crypto section, improved readability

Scientific paper

Instantaneous measurements of non-local observables between space-like separated regions can be performed without violating causality. This feat relies on the use of entanglement. Here we propose novel protocols for this task and the related problem of multipartite quantum computation with local operations and a single round of classical communication. Compared to previously known techniques, our protocols reduce the entanglement consumption by an exponential amount. We also prove a linear lower bound on the amount of entanglement required for the implementation of a certain non-local measurement. These results relate to position-based cryptography: an amount of entanglement scaling exponentially in the number of communicated qubits is sufficient to render any such scheme insecure. Furthermore, we show that certain schemes are secure under the assumption that the adversary has less entanglement than a given linear bound and is restricted to classical communication.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Simplified instantaneous non-local quantum computation with applications to position-based cryptography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simplified instantaneous non-local quantum computation with applications to position-based cryptography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simplified instantaneous non-local quantum computation with applications to position-based cryptography will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-267656

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.