Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1911.08417

Physical Unclonable Functions with Boson Sampling

Juan Carlos García-Escartín

Published Nov 19, 2019• 0 citations
arXivHTMLPDF

Abstract

Boson sampling is a problem for which quantum devices could prove to go beyond classical computing using only linear optics and photon preparation and counting. While theoretically important, there is a lack of practical applications for this task. This paper presents a way to turn any boson sampling device for which there are certain fabrication limits into a physically unclonable function which could be used in identification systems and other security protocols. For a minimum fabrication error, there are scenarios for which the photon distribution at the output of two different devices has a minimum distance and they can be told apart. When compared to classical PUFs these linear optical tokens have the advantage that, for the right choice of parameters, there is a computational guarantee that no classical computer can simulate the output. The paper describes the basic limitations of boson sampling which allow these results and gives a possible choice for a challenge-response identification protocol. This gives a direct application of boson sampling which could be simpler than solving the general problem.

DOI
10.48550/arxiv.1911.08417

Related papers

Photonic implementation of boson sampling: a review

Daniel J. Brod, Ernesto F. Galvão, Andrea Crespi +3 more

Boson sampling is a computational problem that has recently been proposed as a candidate to obtain an unequivocal quantum computational advantage. The problem consists in sampling from the output distribution of indistinguishable bosons in a linear interferometer. There is strong evidence that such an experiment is hard to classically simulate, but it is naturally solved by dedicated photonic quantum hardware, comprising single photons, linear evolution, and photodetection. This prospect has stimulated much effort resulting in the experimental implementation of progressively larger devices. We review recent advances in photonic boson sampling, describing both the technological improvements achieved and the future challenges. We also discuss recent proposals and implementations of variants of the original problem, theoretical issues occurring when imperfections are considered, and advances in the development of suitable techniques for validation of boson sampling experiments. We conclude by discussing the future application of photonic boson sampling devices beyond the original theoretical scope.

Advanced Photonics•May 9, 2019•172 citations

Quantum readout of Physical Unclonable Functions

Boris Škorić

Physical unclonable functions (PUFs) are physical structures that are hard to clone and have a unique challenge-response behavior. The term PUF was coined by Pappu et al. in 2001. That work triggered a lot of interest, and since then a substantial number of papers has been written about the use of a wide variety of physical structures for different security purposes such as identification, authentication, read-proof key storage, key distribution, tamper evidence, anti-counterfeiting, software-to-hardware binding and trusted computing. In this paper we propose a new security primitive: the quantum-readout PUF (QR-PUF). This is a classical PUF, without internal quantum degrees of freedom, which is challenged using a quantum state, e.g. a single-photon state, and whose response is also a quantum state. By the no-cloning property of unknown quantum states, attackers cannot intercept challenges or responses without noticeably disturbing the readout process. Thus, a verifier who sends quantum states as challenges and receives the correct quantum states back can be certain that he is probing a specific QR-PUF without disturbances, even if the QR-PUF is far away "in the field" and under hostile control. For PUFs whose information content is not exceedingly large, all currently known PUF-based authentication and anti-counterfeiting schemes require trusted readout devices in the field. Our quantum readout scheme has no such requirement. Furthermore, we show how the QR-PUF authentication scheme can be interwoven with quantum key exchange (QKE), leading to an authenticated QKE protocol between two parties. This protocol has the special property that it requires no a priori secret shared by the two parties, and that the quantum channel is the authenticated channel, allowing for an unauthenticated classical channel. We provide security proofs for a limited class of attacks. The proofs depend on the physical unclonability of PUFs and on the practical infeasibility of building a quantum computer.

International Journal of Quantum Information•Feb 1, 2012•63 citations

Theoretical framework for physical unclonable functions, including quantum readout

Giulio Gianfelici, Hermann Kampermann, Dagmar Bruß

We propose a theoretical framework to quantitatively describe physical unclonable functions (PUFs), including extensions to quantum protocols, so-called quantum readout PUFs (QR-PUFs). (QR-) PUFs are physical systems with challenge-response behavior intended to be hard to clone or simulate. Their use has been proposed in several cryptographic protocols, with particular emphasis on authentication. Here, we provide theoretical assumptions and definitions behind the intuitive ideas of (QR-) PUFs. This allows us to quantitatively characterize the security of such devices in cryptographic protocols. First, by generalizing previous ideas, we design a general authentication scheme which is applicable to different physical implementations of both classical PUFs and (QR-) PUFs. Then, we define the robustness and the unclonability, which allows us to derive security thresholds for (QR-) PUF authentication and paves the way to develop further new authentication protocols.

arXiv:1911.04981•Physical Review A•Apr 29, 2020•27 citations

Scalability and performance metrics for boson sampling devices

Dong-Gil Im, Chung-Hyun Lee, Joonsuk Huh +1 more

Linear-optical platforms provide a promising route to demonstrate quantum computational advantage, particularly through the boson sampling problem. While a boson sampling system should be large enough to show the quantum advantage, the size of the boson sampling problem is often restricted by experimental constraints. In particular, as a boson sampling system is scaled up, experimental constraints can limit its effective problem size to permit efficient classical simulation. In this paper, we investigate the theoretical scalability bounds for boson sampling systems under practical experimental conditions, including photon loss, mode mismatch, and input state error. We employ non-negativity conditions for phase-space quasiprobability distribution functions to analyze these effects. In addition, we introduce two device-level metrics, the boson sampling score which measures the usable capacity of a given device and the boson sampling volume which provides a common hardware-level benchmark for comparing different platforms and assessing their access to an advantage-relevant problem size regime. Our results provide fundamental insights into the performance of boson sampling systems under realistic experimental conditions and offer practical guidelines for scaling up boson sampling systems.

quant-pharXiv:2610.14602•Oct 13, 2026•0 citations

Quantum simulation of partially distinguishable boson sampling

Alexandra E. Moylett, Peter S. Turner

Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational complexity conjectures, in general the problem is difficult to solve classically, motivating optical experiments aimed at demonstrating quantum computational ``supremacy.'' There are a number of challenges faced by such experiments, including the generation of indistinguishable single photons. We provide a quantum circuit that simulates Boson Sampling with arbitrarily distinguishable particles. This makes clear how distinguishabililty leads to decoherence in the standard quantum circuit model, allowing insight to be gained. At the heart of the circuit is the quantum Schur transform, which follows from a representation theoretic approach to the physics of distinguishable particles in first quantization. The techniques are quite general and have application beyond Boson Sampling.

arXiv:1803.03657•Physical Review A•Jun 20, 2018•24 citations

Non-linear Boson Sampling

Nicolò Spagnolo, Daniel J. Brod, Ernesto F. Galvão +1 more

Abstract Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the last few years, with demonstrations of small- and medium-scale devices, as well as implementations of variants such as Gaussian Boson Sampling. Besides the relevance of this class of computational models in the quest for unambiguous experimental demonstrations of quantum advantage, recent results have also proposed the first applications for hybrid quantum computing. Here, we introduce the adoption of non-linear photon–photon interactions in the Boson Sampling framework, and analyze the enhancement in complexity via an explicit linear-optical simulation scheme. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities for this class of quantum devices. Hence, our results are expected to lead to new applications of near-term, restricted photonic quantum computers.

arXiv:2110.13788•npj Quantum Information•Jan 9, 2023•33 citations
Boson sampling is a problem for which quantum devices could prove to go beyond classical computing using only linear optics and photon preparation and counting. While theoretically important, there is a lack of practical applications for this task. This paper presents a way to turn any boson sampling device for which there are certain fabrication limits into a physically unclonable function which could be used in identification systems and other security protocols. For a minimum fabrication error, there are scenarios for which the photon distribution at the output of two different devices has a minimum distance and they can be told apart. When compared to classical PUFs these linear optical tokens have the advantage that, for the right choice of parameters, there is a computational guarantee that no classical computer can simulate the output. The paper describes the basic limitations of boson sampling which allow these results and gives a possible choice for a challenge-response identification protocol. This gives a direct application of boson sampling which could be simpler than solving the general problem.
Boson sampling is a computational problem that has recently been proposed as a candidate to obtain an unequivocal quantum computational advantage. The problem consists in sampling from the output distribution of indistinguishable bosons in a linear interferometer. There is strong evidence that such an experiment is hard to classically simulate, but it is naturally solved by dedicated photonic quantum hardware, comprising single photons, linear evolution, and photodetection. This prospect has stimulated much effort resulting in the experimental implementation of progressively larger devices. We review recent advances in photonic boson sampling, describing both the technological improvements achieved and the future challenges. We also discuss recent proposals and implementations of variants of the original problem, theoretical issues occurring when imperfections are considered, and advances in the development of suitable techniques for validation of boson sampling experiments. We conclude by discussing the future application of photonic boson sampling devices beyond the original theoretical scope.
Physical unclonable functions (PUFs) are physical structures that are hard to clone and have a unique challenge-response behavior. The term PUF was coined by Pappu et al. in 2001. That work triggered a lot of interest, and since then a substantial number of papers has been written about the use of a wide variety of physical structures for different security purposes such as identification, authentication, read-proof key storage, key distribution, tamper evidence, anti-counterfeiting, software-to-hardware binding and trusted computing. In this paper we propose a new security primitive: the quantum-readout PUF (QR-PUF). This is a classical PUF, without internal quantum degrees of freedom, which is challenged using a quantum state, e.g. a single-photon state, and whose response is also a quantum state. By the no-cloning property of unknown quantum states, attackers cannot intercept challenges or responses without noticeably disturbing the readout process. Thus, a verifier who sends quantum states as challenges and receives the correct quantum states back can be certain that he is probing a specific QR-PUF without disturbances, even if the QR-PUF is far away "in the field" and under hostile control. For PUFs whose information content is not exceedingly large, all currently known PUF-based authentication and anti-counterfeiting schemes require trusted readout devices in the field. Our quantum readout scheme has no such requirement. Furthermore, we show how the QR-PUF authentication scheme can be interwoven with quantum key exchange (QKE), leading to an authenticated QKE protocol between two parties. This protocol has the special property that it requires no a priori secret shared by the two parties, and that the quantum channel is the authenticated channel, allowing for an unauthenticated classical channel. We provide security proofs for a limited class of attacks. The proofs depend on the physical unclonability of PUFs and on the practical infeasibility of building a quantum computer.
We propose a theoretical framework to quantitatively describe physical unclonable functions (PUFs), including extensions to quantum protocols, so-called quantum readout PUFs (QR-PUFs). (QR-) PUFs are physical systems with challenge-response behavior intended to be hard to clone or simulate. Their use has been proposed in several cryptographic protocols, with particular emphasis on authentication. Here, we provide theoretical assumptions and definitions behind the intuitive ideas of (QR-) PUFs. This allows us to quantitatively characterize the security of such devices in cryptographic protocols. First, by generalizing previous ideas, we design a general authentication scheme which is applicable to different physical implementations of both classical PUFs and (QR-) PUFs. Then, we define the robustness and the unclonability, which allows us to derive security thresholds for (QR-) PUF authentication and paves the way to develop further new authentication protocols.
Linear-optical platforms provide a promising route to demonstrate quantum computational advantage, particularly through the boson sampling problem. While a boson sampling system should be large enough to show the quantum advantage, the size of the boson sampling problem is often restricted by experimental constraints. In particular, as a boson sampling system is scaled up, experimental constraints can limit its effective problem size to permit efficient classical simulation. In this paper, we investigate the theoretical scalability bounds for boson sampling systems under practical experimental conditions, including photon loss, mode mismatch, and input state error. We employ non-negativity conditions for phase-space quasiprobability distribution functions to analyze these effects. In addition, we introduce two device-level metrics, the boson sampling score which measures the usable capacity of a given device and the boson sampling volume which provides a common hardware-level benchmark for comparing different platforms and assessing their access to an advantage-relevant problem size regime. Our results provide fundamental insights into the performance of boson sampling systems under realistic experimental conditions and offer practical guidelines for scaling up boson sampling systems.
Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational complexity conjectures, in general the problem is difficult to solve classically, motivating optical experiments aimed at demonstrating quantum computational ``supremacy.'' There are a number of challenges faced by such experiments, including the generation of indistinguishable single photons. We provide a quantum circuit that simulates Boson Sampling with arbitrarily distinguishable particles. This makes clear how distinguishabililty leads to decoherence in the standard quantum circuit model, allowing insight to be gained. At the heart of the circuit is the quantum Schur transform, which follows from a representation theoretic approach to the physics of distinguishable particles in first quantization. The techniques are quite general and have application beyond Boson Sampling.
Abstract Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the last few years, with demonstrations of small- and medium-scale devices, as well as implementations of variants such as Gaussian Boson Sampling. Besides the relevance of this class of computational models in the quest for unambiguous experimental demonstrations of quantum advantage, recent results have also proposed the first applications for hybrid quantum computing. Here, we introduce the adoption of non-linear photon–photon interactions in the Boson Sampling framework, and analyze the enhancement in complexity via an explicit linear-optical simulation scheme. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities for this class of quantum devices. Hence, our results are expected to lead to new applications of near-term, restricted photonic quantum computers.