Searcharxiv⌕ Search

arXiv subjects

Yusuf Alnawakhtha

Publications and source records attributed to Yusuf Alnawakhtha.

3 recordsLinked to original sources

Impossibility of perfect cheating for single-qubit position verification

In quantum position verification (QPV), a prover certifies her location to a set of verifiers by performing a quantum computation. One of the first QPV protocols was proposed by Kent, Munro, and Spiller in 2011: the prover receives a qubit $Q$ from one direction, receives an orthogonal basis $\{ v, v^\perp \}$ from the opposite direction, then measures $Q$ in $\{ v, v^\perp \}$ and broadcasts the result. Several variants of this protocol have been proposed and analyzed, but the question of whether the original protocol is secure has never been fully resolved. In this work we show that there is no perfect finite-dimensional cheating strategy for the single-qubit measurement protocol. Our proof uses tools from real algebraic geometry.

quant-ph↗

Quantum Position Verification with Remote Untrusted Devices

Position information underpins many modern technologies, from navigation and timing to authentication and critical infrastructure. However, classical methods of proving that information originates from a particular position are vulnerable to spoofing. This limitation can be overcome with quantum technologies but current protocols rely on trust in quantum hardware that can be undermined, or require quantum computers and bounds on adversarial computation. Nevertheless, there has been significant interest in experimental demonstrations, and aspects of these protocols have been implemented. Here we introduce and experimentally demonstrate the Bell-test quantum position verification protocol for device-independent quantum position verification that guarantees security with only observed correlations from a loophole-free Bell test across a quantum network. We experimentally implement a version of this device-independent protocol against adversaries who, before each trial, are weakly entangled. Our demonstration achieves a one-dimensional localization 2.47(2) times smaller than the best, necessarily non-remote, classical localization protocol. Compared to classical protocols with identical latencies, the localization volume is 4.53(5) times smaller, and represents a certifiable quantum advantage. The general Bell-test protocol is loss tolerant and secure against adversaries with significant quantum resources. This work allows digital security to be anchored to physically trusted locations, enabling new position-based authentication protocols for applications such as financial transactions, legal agreements, and securing critical infrastructure.

quant-ph↗

Lattice-Based Quantum Advantage from Rotated Measurements

Trapdoor claw-free functions (TCFs) are immensely valuable in cryptographic interactions between a classical client and a quantum server. Typically, a protocol has the quantum server prepare a superposition of two-bit strings of a claw and then measure it using Pauli-$X$ or $Z$ measurements. In this paper, we demonstrate a new technique that uses the entire range of qubit measurements from the $XY$-plane. We show the advantage of this approach in two applications. First, building on (Brakerski et al. 2018, Kalai et al. 2022), we show an optimized two-round proof of quantumness whose security can be expressed directly in terms of the hardness of the LWE (learning with errors) problem. Second, we construct a one-round protocol for blind remote preparation of an arbitrary state on the $XY$-plane up to a Pauli-$Z$ correction.

quant-ph↗