English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Instantaneous nonlocal quantum computation (INQC) evades apparent quantum andrelativistic constraints and allows to attack generic quantum positionverification (QPV) protocols (aiming at securely certifying the location of adistant prover) at an exponential entanglement cost. We consider adversariessharing maximally entangled pairs of qudits and find low-dimensional INQCattacks against the simple practical family of QPV protocols based on singlephotons polarized at an angle $\theta$. We find exact attacks against somerational angles, including some sitting outside of the Clifford hierarchy (e.g.$\pi/6$), and show no $\theta$ allows to tolerate errors higher than $\simeq5\cdot 10^{-3}$ against adversaries holding two ebits per protocol's qubit.

Breaking simple quantum position verification protocols with little entanglement