Papers › Ensemble-Based Quantum-Token Protocol Benchmarked on IBM Quantum Processors
Ensemble-Based Quantum-Token Protocol Benchmarked on IBM Quantum Processors
Lucas Tsunaki, Bernd Bauerhenne, Malwin Xibraku, Martin E. Garcia, Kilian Singer, Boris Naydenov
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Quantum tokens envision to store unclonable quantum states in a physical device, with the goal of being used for personal authentication protocols, as required by banks. Still, the experimental realization of such devices faces many technical challenges, which can be partially mitigated using ensembles instead of single qubits. In this work, we thus propose an ensemble-based quantum token protocol, describing it through a simple yet general model based on a quantum mechanical observable. The protocol is benchmarked on five IBM quantum processors and a general hacker attack scenario is analyzed, in which the attacker attempts to read the bank token and forge a fake one, based on the information gained from this measurement. We experimentally demonstrate that the probability that the bank erroneously accepts a forged coin composed of multiple tokens can reach values below 10⁻²², while the probability that the bank accepts its own coin is above 0.999. The overall security of the protocol is therefore demonstrated within a hardware-agnostic framework, confirming the practical viability of the protocol in arbitrary quantum systems and thus paving the way for future applications with different ensembles of qubits, such as color center defects in solids.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections