⚛️ quantum physics

Secure authentication via Quantum Physical Unclonable Functions: a review

This review examines the theoretical foundations, implementation challenges, and architectural evolution of Quantum Physical Unclonable Functions (QPUFs), distinguishing them from less robust variants while highlighting the critical role of information-theoretic analysis in advancing secure authentication despite remaining practical hurdles.

Original authors: Pol JuliÃ FarrÃ©, Vladlen Galetsky, Mohamed Belhassen, Gregor Pieplow, Kumar Nilesh, Holger Boche, Tim Schröder, Janis Nötzel, Christian Deppe

Published 2026-02-17

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Pol JuliÃ FarrÃ©, Vladlen Galetsky, Mohamed Belhassen, Gregor Pieplow, Kumar Nilesh, Holger Boche, Tim Schröder, Janis Nötzel, Christian Deppe

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to prove your identity to a very strict bouncer at an exclusive club. In the digital world, we usually use passwords or fingerprints. But what if someone could copy your fingerprint perfectly, or steal your password? That's where Physical Unclonable Functions (PUFs) come in.

Think of a PUF like a snowflake. No two snowflakes are exactly alike, and even if you tried to make a fake one, the microscopic imperfections would be different. In the classical world, these are tiny chips with unique physical "bumps and dents" that act as a fingerprint.

This review paper explores a new, super-advanced version: Quantum PUFs (QPUFs). Instead of using tiny bumps, these use the weird, magical rules of quantum mechanics (the physics of the very small) to create uncopyable identities.

Here is a simple breakdown of what the paper discusses, using everyday analogies:

1. The Goal: The Ultimate "Unfakeable" ID

The main goal is to create a security system that is mathematically impossible to hack.

The Analogy: Imagine a lock that doesn't just have a key; the lock is the key, and the key changes its shape every time you look at it, but in a way that is predictable only to the owner.
The Problem: Old digital locks (classical PUFs) are being cracked by smart computers (AI) that can learn the pattern. The authors say, "Let's go to the quantum realm where the rules are different."

2. The Two Main Contenders: The "Real Deal" vs. The "Good Enough"

The paper distinguishes between two types of quantum security, which is a bit like distinguishing between a Magic Wand and a Very Good Trick.

A. The Magic Wand: True Quantum PUFs (QPUFs)

How it works: You send a "quantum question" (a delicate state of light or particle) to the device. The device answers with a "quantum answer."
The Catch: To make this work perfectly, the device needs to be built using Haar Randomness.
- The Analogy: Imagine trying to bake a cake where the recipe requires you to pick a random grain of sand from every beach on Earth, mix them, and use that specific mix as flour. It's the "perfect" recipe for security, but it's impossible to do in real life right now. We don't have the technology to generate that level of randomness efficiently.
The Hurdle: These devices also need Quantum Memory.
- The Analogy: It's like trying to catch a soap bubble in a jar and keep it there for days without it popping. Currently, our "jars" (quantum memories) are too fragile; the bubbles pop (the data degrades) too quickly.

B. The Very Good Trick: Quantum Readout PUFs (QR-PUFs)

How it works: These are the "practical" cousins. They use quantum light to read a classical object (like a speckled pattern on a chip).
The Catch: They are easier to build and we have already tested them in labs. However, they rely on a Trusted Third Party (a "super-bouncer" who knows the secret).
- The Analogy: Instead of the lock proving itself, you have to call a friend who knows the secret code to vouch for you. If that friend is hacked or bribed, the whole system fails. Also, a super-smart hacker might eventually figure out the pattern if they ask enough questions.

3. The "Hybrid" Compromise: The Best of Both Worlds

The paper also looks at Hybrid PUFs (HPUFs).

The Analogy: Imagine you have a classical lock (a standard door lock) but you wrap it in a quantum forcefield. Even if a thief picks the lock, they can't get through the forcefield.
Why it's cool: It doesn't need the impossible "Magic Wand" ingredients (Haar randomness) or the fragile soap-bubble jars (long-term quantum memory). It's a bridge between what we have today and what we want tomorrow.

4. The "Noise" Problem

One of the biggest themes in the paper is Quantum Noise.

The Analogy: Imagine trying to have a whispering game in a hurricane. The wind (noise) distorts the message.
The Reality: In the real world, quantum systems are noisy. The paper discusses how we need "Error Correction" (like noise-canceling headphones for data) to make these systems work reliably. Currently, our noise-canceling tech isn't quite good enough for long-distance security.

5. The Big Picture: Where are we now?

The authors conclude that while the theory is beautiful and mathematically sound, the practice is still a work in progress.

The Timeline: We are currently in the "prototype" phase. We have built small models in labs, but we don't have a "Quantum PUF" you can buy at the store yet.
The Future: The paper suggests that instead of fighting quantum noise, we might need to learn to use it as a feature (like how a lighthouse uses fog to guide ships). We also need to create standard rules (like a "ISO standard") so that different quantum security devices can talk to each other.

Summary

This paper is a roadmap for the future of un-hackable security.

The Dream: A device that uses the laws of physics to prove who you are, which no computer (even a super-quantum one) can copy.
The Reality: We have the blueprints, but the materials (quantum memory, perfect randomness) are still too expensive or fragile to build the house yet.
The Solution: We are building "Hybrid" houses in the meantime—using a mix of old and new tech to stay safe until the perfect quantum tech arrives.

In short: Quantum PUFs are the "Holy Grail" of security, but we are still figuring out how to build the shovel to dig it up.

1. Problem Statement

The paper addresses the vulnerability of classical Physical Unclonable Functions (PUFs) to machine-learning-based attacks and the need for robust, mathematically grounded security guarantees in the quantum era. While classical PUFs rely on manufacturing variations to generate unique "fingerprints," they are increasingly susceptible to modeling attacks. The authors aim to review the emerging field of Quantum Physical Unclonable Functions (QPUFs), which leverage quantum mechanics (specifically the no-cloning theorem and unitary transformations) to provide information-theoretic security.

Key challenges identified include:

Definition Ambiguity: Confusion in literature between true QPUFs (accepting quantum challenges and producing quantum responses) and Quantum Readout PUFs (QR-PUFs), which often map quantum interactions to classical information known to a trusted verifier.
Experimental Feasibility: The theoretical requirements for QPUFs (e.g., Haar-random unitary generation, long-lived quantum memories) currently exceed the capabilities of near-term quantum hardware.
Noise and Robustness: The impact of quantum noise on the reliability (completeness) and security (soundness) of authentication protocols.

2. Methodology

The authors employ a co-citation-based selection method to trace the evolution of QPUF architectures.

Baseline Selection: Four foundational papers were selected as baselines: QR-PUF [101], the formal QPUF framework [18], Ideal/Measurement-Based QPUFs [26], and Hybrid PUFs (HPUFs) [17].
Similarity Metric: A modified Jaccard similarity was calculated between the reference lists of candidate articles and the union of references from the baseline articles. Articles exceeding a similarity threshold ( $l=0.1$ ) were included in the review.
Analytical Framework: The review categorizes the literature into four main sections:
1. Theoretical definitions and assumptions (Unclonability, Query-based models).
2. Experimental requirements (Quantum memories, photonics, error correction).
3. Historical evolution of protocols (QR-PUFs $\to$ QPUFs $\to$ HPUFs).
4. Information-theoretic analysis (Security bounds, key generation).

3. Key Contributions

A. Formal Definitions and Distinctions

The paper rigorously defines a QPUF based on the framework of Arapinis et al. [18], requiring:

$\delta_u$ -Uniqueness: Generated channels must be distinguishable from one another.
$\delta_r$ -Robustness: Indistinguishable challenges must yield indistinguishable responses.
$\delta_c$ -Collision Resistance: Distinguishable challenges must yield distinguishable responses.

Crucial Distinction: The authors clarify that QR-PUFs (e.g., [19, 20]) often fail the strict QPUF definition because the challenge-response mapping can be reduced to classical information known by a trusted third party. True QPUFs require the verifier to hold the quantum state or perform quantum operations without a trusted intermediary.

B. Theoretical Frameworks and Security Notions

The review details three levels of unforgeability for QPUF protocols:

Quantum Exponential Unforgeability: Secure against adversaries with exponential query capabilities.
Quantum Existential Unforgeability: Secure against polynomial adversaries (stronger).
Quantum Selective/Universal Unforgeability: Secure under constrained challenge selection.
The Haar-Randomness Problem: Theoretical proofs often assume the QPUF is generated via Haar-random unitaries. The paper highlights that generating such unitaries efficiently is currently impossible (exponential overhead), leading to proposals for Unitary t-designs [31] and Measurement-Based QPUFs (MB-QPUF) [26] to circumvent this requirement.

C. Experimental Realities and Hardware

The paper provides a comprehensive state-of-the-art review of quantum memory platforms required for QPUF tokens:

Platforms: Atomic ensembles (warm/cold), trapped ions, trapped neutral atoms, rare-earth ensembles, color centers, and fiber loops.
Limitations: Most platforms require cryogenic cooling (non-portable) or suffer from short coherence times. Only noble-gas memories offer long coherence (hours) but lack interfaces with flying qubits.
Error Correction: While Quantum Error Correction (QEC) has advanced (e.g., Google's distance-7 code), current logical error rates and storage times are insufficient for most QPUF authentication scenarios, limiting applications to short-distance or specialized use cases.

D. Hybrid PUFs (HPUFs)

The review introduces Hybrid PUFs as a pragmatic middle ground. These combine classical PUFs with quantum locks (using non-orthogonal states or entanglement) to prevent cloning even if the classical PUF is characterized. HPUFs do not require quantum memories or Haar randomness, making them more experimentally accessible, though they rely on heuristic security rather than strict information-theoretic proofs.

E. Information-Theoretic Analysis

The paper emphasizes that QPUF security is best analyzed using information theory rather than computational hardness.

Metrics: False Acceptance Rate (FAR) and False Rejection Rate (FRR).
Bounds: Theoretical limits (converse bounds) and achievable rates (achievability bounds) are derived for secret key generation and authentication.
Insight: High-entropy outputs from QPUFs can be distilled into secret keys with provable secrecy, provided privacy leakage is minimized.

4. Results and Findings

Evolution of Protocols: The field has evolved from early QR-PUFs (2010) to formal Unitary QPUFs (2019), and recently to Hybrid and Measurement-Based models (2021–2025) that attempt to relax the stringent hardware requirements.
Security vs. Practicality Trade-off:
- QPUFs: Offer the strongest theoretical security (information-theoretic) but face severe experimental hurdles (quantum memory, Haar randomness).
- QR-PUFs: Experimentally feasible but rely on trusted third parties and classical mappings, reducing their security against quantum-capable adversaries.
- HPUFs: Offer a balance, improving classical PUF security with quantum features, but lack the rigorous mathematical guarantees of pure QPUFs.
Noise Sensitivity: Protocols relying on the standard swap test are highly sensitive to noise; even minor noise causes the probability of true acceptance to drop exponentially. Generalized swap (gswap) tests mitigate this but do not eliminate the issue entirely.

5. Significance

Standardization Need: The paper highlights a critical lack of standardized metrics and certification criteria for QPUFs, hindering reproducibility and cross-platform comparison.
Clarification of Terminology: It resolves the "polysemy" in the field by clearly distinguishing between QR-PUFs and QPUFs, preventing the misclassification of less secure protocols as fully quantum-secure.
Future Roadmap: The authors argue that future research must focus on:
1. Developing noise-resilient QPUF schemes.
2. Creating portable quantum memories or hybrid systems.
3. Establishing architecture-agnostic standards for benchmarking.
4. Exploring quantum noise as a resource rather than a hindrance.

In conclusion, while QPUFs represent a promising path toward unbreakable authentication, the gap between theoretical ideals and experimental reality remains wide. The review serves as a comprehensive guide for researchers navigating the transition from theoretical proofs to practical, scalable quantum security hardware.