.png){kind=icon}
.png){kind=icon}
Return
On the equivalence between classically verifiable position verification and certified randomness
.png){kind=icon}
OA
AI
DOI：10.1038/s41467-026-70628-4.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Gate-based quantum computers can accelerate computational tasks beyond classical capabilities. Random circuit sampling is a task that has experimentally demonstrated algorithmic quantum advantage on near-term devices, but its practical utility has been limited. Recently, certified randomness generation based on random circuits was demonstrated on a trapped-ion quantum computer, advancing near-term applications. In this work, we connect single-device certified randomness to classically verifiable position verification, a classical communication primitive that avoids long-distance quantum communication challenges. We present a generic compiler that converts any such certified randomness protocol into a secure classically verifiable position verification scheme, extend it to multi-round protocols, and show its equivalence to a relaxed certified randomness variant. Our near-term instantiation based on random circuit sampling demonstrates classically verifiable position verification as a practical application for near-term devices. This article establishes a connection between single-device certified randomness and classically verifiable position verification. Through this connection, it shows that the latter can be implemented using noisy intermediate-scale quantum devices.
Keywords:
Computer science
Quantum information
Science
Humanities and Social Sciences
multidisciplinary
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.