Quantum
Where Quantum Fourier Sampling Stops Short: A Three-Gate Audit Protocol for Delay-PUF Security Models
Publication: quant-ph updates on arXiv.org
Author: Owen Friedewald, Ali Shiri Sichani, Chi-Ren Shyu
Source published: 05/10/2026, 04:00:00 UTC
Briefing created: 05/10/2026, 04:17:53 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 05/10/2026, 04:13:25 UTC.
Briefings
A new three-gate audit protocol evaluates quantum Fourier sampling for delay-PUF security by testing access matching, oracle synthesis, and spectral learnability. The study found no end-to-end advantage in the evaluated regime, as quantum-kernel diagnostics correlate with classical metrics and ideal sampling requires fewer coherent calls on thresholded tasks. The protocol aims to separate ideal query advantages from realizable security benefits.
Key points
- The audit protocol uses three gates to evaluate quantum Fourier sampling against access matching, oracle synthesis, and spectral learnability for delay-based PUFs.
- Quantum-kernel diagnostics correlate with classical Gram matrix metrics, suggesting geometric difference can grow via classical ill-conditioning rather than task-label alignment.
Context and limitations
Evidence is limited to a static backend snapshot; quantum-kernel diagnostics correlate with classical metrics, and ideal sampling requires fewer coherent calls on thresholded tasks.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 05/10/2026, 04:17:53 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeibxzlhyxa7jnc7boo5azxpdo3ze73qe2bxo3wdcvnlqbbcbklp7om