Physical unclonable functions(PUFs) provide a unique fingerprint to a physical entity by exploiting the inherent physical randomness. Gao et al. discussed the vulnerability of most current-day PUFs to sophisticated machine learning-based attacks. We address this problem by integrating classical PUFs and existing quantum communication technology. Specifically, this paper proposes a generic design of provably secure PUFs, called hybrid locked PUFs(HLPUFs), providing a practical solution for securing classical PUFs. An HLPUF uses a classical PUF(CPUF), and encodes the output into non-orthogonal quantum states to hide the outcomes of the underlying CPUF from any adversary. Here we introduce a quantum lock to protect the HLPUFs from any general adversaries. The indistinguishability property of the non-orthogonal quantum states, together with the quantum lockdown technique prevents the adversary from accessing the outcome of the CPUFs. Moreover, we show that by exploiting non-classical properties of quantum states, the HLPUF allows the server to reuse the challenge-response pairs for further client authentication. This result provides an efficient solution for running PUF-based client authentication for an extended period while maintaining a small-sized challenge-response pairs database on the server side. Later, we support our theoretical contributions by instantiating the HLPUFs design using accessible real-world CPUFs. We use the optimal classical machine-learning attacks to forge both the CPUFs and HLPUFs, and we certify the security gap in our numerical simulation for construction which is ready for implementation.
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed, but not proven, that quantum computing provides exponential speed-up for a range of problems, such as factoring. Here we address a computational scenario of "randomness processing" in which quantum theory provably yields, not only resource reduction over classical stochastic physics, but a strictly larger class of problems which can be solved. Beyond new fo…
Non-local games are widely studied as a model to investigate the properties of quantum mechanics as opposed to classical mechanics. In this paper, we consider a subset of non-local games: symmetric XOR games of $n$ players with 0-1 valued questions. For this class of games, each player receives an input bit and responds with an output bit without communicating to the other players. The winning condition only depends on XOR of output bits and is constant w.r.t. permutation of players. We prove that for almost any $n$-player symmetric XOR game the entangled value of the game is $Θ(\frac{\sqrt{\l…
Entanglement-induced provable and robust quantum learning advantages
Center for Quantum Information, IIIS, Tsinghua University, Beijing 100084, China（清华大学信息科学与技术研究院量子信息中心）；Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA 91125, USA（加州理工学院量子信息与物质研究所）；Hefei National Laboratory, Hefei 230088, PR China（合肥国家实验室）；Shanghai Qi Zhi Institute, Shanghai 200232, China（上海启智研究所）
In modelling complex processes, the potential past data that influence future expectations are immense. Models that track all this data are not only computationally wasteful but also shed little light on what past data most influence the future. There is thus enormous interest in dimensional reduction-finding automated means to reduce the memory dimension of our models while minimizing its impact on its predictive accuracy. Here we construct dimensionally reduced quantum models by machine learning methods that can achieve greater accuracy than provably optimal classical counterparts. We demons…
A locking protocol between two parties is as follows: Alice gives an encrypted classical message to Bob which she does not want Bob to be able to read until she gives him the key. If Alice is using classical resources, and she wants to approach unconditional security, then the key and the message must have comparable sizes. But if Alice prepares a quantum state, the size of the key can be comparatively negligible. This effect is called quantum locking. Entanglement does not play a role in this quantum advantage. We show that, in this scenario, the quantum discord quantifies the advantage of th…
A provable quantum advantage for approximate optimization via decoded quantum interferometry
Freie Universität Berlin（柏林自由大学）；Fraunhofer Heinrich Hertz Institute（弗劳恩霍夫海因里希赫兹研究所）；Helmholtz-Zentrum Berlin für Materialien und Energie（柏林亥姆霍兹材料与能源中心）
Simulating the stochastic evolution of real quantities on a digital computer requires a trade-off between the precision to which these quantities are approximated, and the memory required to store them. The statistical accuracy of the simulation is thus generally limited by the internal memory available to the simulator. Here, using tools from computational mechanics, we show that quantum processors with a fixed finite memory can simulate stochastic processes of real variables to arbitrarily high precision. This demonstrates a provable, unbounded memory advantage that a quantum simulator can e…
Dynamical simulation via quantum machine learning with provable generalization
AWE；Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）；Technical University of Munich（慕尼黑工业大学）；Munich Center for Quantum Science and Technology (MCQST)（慕尼黑量子科学与技术中心）；Freie Universität Berlin（柏林自由大学）；University of Southern California（南加州大学）；Theoretical Division, Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室理论部）
The performance of a neural network for a given task is largely determined by the initial calibration of the network parameters. Yet, it has been shown that the calibration, also referred to as training, is generally NP-complete. This includes networks with binary weights, an important class of networks due to their practical hardware implementations. We therefore suggest an alternative approach to training binary neural networks. It utilizes a quantum superposition of weight configurations. We show that the quantum training guarantees with high probability convergence towards the globally opt…
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction games became the first explicitly defined class of zero-sum combinatorial games with provable separation between quantum and classical complexity of solving them. For a narrower subset of Subtraction games, an exact quantum sublinear algorithm is known that surpasses all deterministic algorithms for finding solutions with probability $1$. Typically, both Nim …
Provable Quantum-Classical Separation for Continuous Gibbs Sampling
Irréversible Inc.（不可逆公司）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）；Department of Physics and Astronomy, University of Waterloo（滑铁卢大学物理与天文学系）；Perimeter Institute for Theoretical Physics（圆周理论物理研究所）；National Research Council Canada（加拿大国家研究委员会）
Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic Resources
Indian Statistical Institute（印度统计研究所）；S. N. Bose National Centre for Basic Sciences（S.N. 玻色基础科学国家中心）；HUN-REN Institute for Nuclear Research（匈牙利研究与教育网络核物理研究所）；Harish-Chandra Research Institute, A CI of Homi Bhabha National Institute（哈瑞斯昌德拉研究所，霍米·巴巴国立学院成员机构）；Okinawa Institute of Science and Technology Graduate University（冲绳科学技术大学院大学）；Indian Institute of Technology Goa（果阿印度理工学院）
Provable quantum thermalization without statistical averages
JILA and Center for Theory of Quantum Matter, Department of Physics, University of Colorado（科罗拉多大学物理系量子物质理论中心及JILA）；University of Colorado, Boulder（科罗拉多大学博尔德分校）
Quantum computations promise the ability to solve problems intractable in the classical setting. Restricting the types of computations considered often allows to establish a provable theoretical advantage by quantum computations, and later demonstrate it experimentally. In this paper, we consider space-restricted computations, where input is a read-only memory and only one (qu)bit can be computed on. We show that $n$-bit symmetric Boolean functions can be implemented exactly through the use of quantum signal processing as restricted space quantum computations using $O(n^2)$ gates, but some of …
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It is known that this quantum-controlled ordering of gates can reduce the query complexity in deciding a property of black-box unitaries with respect to the best algorithm in which the gates are applied in a fixed order. However, all tasks explicitly found so far require unitaries that either act on unbounded dimensional quantum systems in the asymptotic limit…
Generative quantum advantage for classical and quantum problems
Google Quantum AI（谷歌量子AI）；Department of Physics, California Institute of Technology（加州理工学院物理系）；Department of Physics（物理系）；Astronomy, Purdue University（天文学，普渡大学）
High-dimensional quantum states have already settled their advantages in different quantum technology applications. However, their reliable transmission in fiber links remains an open challenge that must be addressed to boost their application, e.g. in the future quantum internet. Here, we prove how path encoded high-dimensional quantum states can be reliably transmitted over a 2 km long multicore fiber, taking advantage of a phase-locked loop system guaranteeing a stable interferometric detection.
Advantage of Quantum Neural Networks as Quantum Information Decoders
Massachusetts Institute of Technology（麻省理工学院）；IBM Quantum（IBM量子）；MIT-IBM Watson AI lab（MIT-IBM沃森人工智能实验室）；Institute for Advanced Study（普林斯顿高等研究院）；IBM Research（IBM研究院）；Google Quantum AI（谷歌量子人工智能）
Finding exponential separation between quantum and classical information tasks is like striking gold in quantum information research. Such an advantage is believed to hold for quantum computing but is proven for quantum communication complexity. Recently, a novel quantum resource called the quantum switch---which creates a coherent superposition of the causal order of events, known as quantum causality---has been harnessed theoretically in a new protocol providing provable exponential separation. We experimentally demonstrate such an advantage by realizing a superposition of communication dire…
Spectroscopy is an important tool for probing the properties of materials, chemicals and biological samples. We design a practical transmitter-receiver system that exploits entanglement to achieve a provable quantum advantage over all spectroscopic schemes based on classical sources. To probe the absorption spectra, modelled as pattern of transmissivities among different frequency modes, we employ broad-band signal-idler pairs in two-mode squeezed vacuum states. At the receiver side, we apply photodetection after optical parametric amplification. Finally, we perform a maximal-likehihood decisi…
Amgen（安进公司）；IBM Quantum（IBM量子）；IBM Switzerland Ltd（IBM瑞士有限公司）；IBM Thomas J. Watson Research Center（IBM托马斯·J·沃森研究中心）
In recent years, research on near-term quantum machine learning has explored how classical machine learning algorithms endowed with access to quantum kernels (similarity measures) can outperform their purely classical counterparts. Although theoretical work has shown provable advantage on synthetic data sets, no work done to date has studied empirically whether quantum advantage is attainable and with what kind of data set. In this paper, we report the first systematic investigation of empirical quantum advantage (EQA) in healthcare and life sciences and propose an end-to-end framework to stud…
Does provable absence of barren plateaus imply classical simulability?
Information Sciences, Los Alamos National Laboratory（信息科学，洛斯阿拉莫斯国家实验室）；Quantum Science Center, Oak Ridge（量子科学中心，奥克兰岭）；Theoretical Division, Los Alamos National Laboratory（理论部，洛斯阿拉莫斯国家实验室）；Center for Nonlinear Studies, Los Alamos National Laboratory（非线性研究中心，洛斯阿拉莫斯国家实验室）；University of Strathclyde（斯特拉斯克莱德大学）；Institute of Physics, Ecole Polytechnique Fédérale de Lausanne (EPFL)（物理研究所，洛桑联邦理工学院（EPFL））；Donostia International Physics Center（多斯通国际物理中心）；Department of Physics and Astronomy, University of Waterloo（物理与天文学系，滑铁卢大学）；Vector Institute, MaRS Centre（向量研究所，马尔伯里中心）；Complex Systems, Department of Physics, Faculty of Science, Chulalongkorn University（复杂系统，物理系，科学学院，朱拉隆梭大学）；Walter Burke Institute for Theoretical Physics, Caltech（沃尔特·伯克理论物理研究所，加州理工学院）
