Building Trust in the Quantum Cloud with Physical Unclonable Functions

• URL: http://arxiv.org/abs/2311.07094v2
• Date: Tue, 09 Sep 2025 16:03:00 GMT
• Title: Building Trust in the Quantum Cloud with Physical Unclonable Functions
• Authors: Behnam Tonekaboni, Pranav Gokhale, Kaitlin N. Smith,
• Abstract summary: We present an authentication protocol that leverages quantum device properties to construct Quantum Physical Unclonable Functions (Q-PUFs)<n>We prototype our approach on IBM quantum devices with both real and simulated data.<n>Our work lays the groundwork for secure, hardware-rooted authentication in hybrid quantum-classical systems.
• Score: 1.9903304028630213
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As cloud-based quantum computing expands, securing access to quantum hardware is increasingly critical. We present an authentication protocol that leverages intrinsic quantum device properties to construct Quantum Physical Unclonable Functions (Q-PUFs). Using frequency fingerprints from fixed-frequency transmon qubits, we prototype our approach on IBM quantum devices with both real and simulated data. We employ fuzzy extractors to generate stable cryptographic keys that tolerate measurement noise and conceal raw hardware data. To support scalability, we introduce q tuples (qubit subsets) that enable challenge response generation for strong PUF behavior. We also outline extensions to neutral atom platforms and propose future directions including logical Q-PUFs. Our work lays the groundwork for secure, hardware-rooted authentication in hybrid quantum-classical systems.

Related papers

• Implementation Challenges in Quantum Key Distribution [0.0]
  This study focuses on implementing and comparing two well-known QKD protocols, namely BB84 and E91, within an actual quantum computing environment.<n>By leveraging the properties of quantum superposition and quantum entanglement, the study illustrates how communicating parties can securely obtain a shared secret.
  arXiv  Detail & Related papers  (2026-02-02T00:30:44Z)
• The Hardness of Learning Quantum Circuits and its Cryptographic Applications [1.2116854758481395]
  We show that concrete hardness assumptions about learning or cloning the output state of a random quantum circuit can be used as the foundation for secure quantum cryptography.<n>We construct secure one-way state generators (OWSGs), digital signature schemes, quantum bit commitments, and private key encryption schemes.
  arXiv  Detail & Related papers  (2025-04-21T18:00:03Z)
• Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer [56.435136806763055]
  IQM Quantum Computers is described covering both the QPU and the rest of the full-stack quantum computer. The focus is on a 20-qubit quantum computer featuring the Garnet QPU and its architecture, which we will scale up to 150 qubits. We present QPU and system-level benchmarks, including a median 2-qubit gate fidelity of 99.5% and genuinely entangling all 20 qubits in a Greenberger-Horne-Zeilinger (GHZ) state.
  arXiv  Detail & Related papers  (2024-08-22T14:26:10Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• PristiQ: A Co-Design Framework for Preserving Data Security of Quantum Learning in the Cloud [7.87660609586004]
  Cloud computing poses a high risk of data leakage in quantum machine learning (QML) We propose a co-design framework for preserving the data security of QML with the Q paradigm, namely PristiQ.
  arXiv  Detail & Related papers  (2024-04-20T22:03:32Z)
• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
  Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs.<n>Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.<n>We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries.<n>We introduce a second model where the QPUF functions as a nonunitary quantum channel, which guarantees existential unforgeability.
  arXiv  Detail & Related papers  (2024-04-17T12:16:41Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• QKSAN: A Quantum Kernel Self-Attention Network [53.96779043113156]
  A Quantum Kernel Self-Attention Mechanism (QKSAM) is introduced to combine the data representation merit of Quantum Kernel Methods (QKM) with the efficient information extraction capability of SAM. A Quantum Kernel Self-Attention Network (QKSAN) framework is proposed based on QKSAM, which ingeniously incorporates the Deferred Measurement Principle (DMP) and conditional measurement techniques. Four QKSAN sub-models are deployed on PennyLane and IBM Qiskit platforms to perform binary classification on MNIST and Fashion MNIST.
  arXiv  Detail & Related papers  (2023-08-25T15:08:19Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Simulation of Networked Quantum Computing on Encrypted Data [0.0]
  cryptographic techniques must be developed for secure remote use of quantum computing power. I present a simulation of such a protocol, tested classically on the simulation platform LIQ$Ui|rangle.
  arXiv  Detail & Related papers  (2022-12-25T20:02:53Z)
• Comparison of Quantum PUF models [9.650153007075703]
  Physical unclonable functions (PUFs) are hardware structures in a physical system (e.g. semiconductor, crystals etc.) that are used to enable unique identification of the semiconductor or to secure keys for cryptographic processes. We introduce the requirements for QTOKSim, a quantum token based authentication simulator testing its performance on a multi-factor authentication protocol.
  arXiv  Detail & Related papers  (2022-08-22T21:14:16Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• Open Source Variational Quantum Eigensolver Extension of the Quantum Learning Machine (QLM) for Quantum Chemistry [0.0]
  We introduce a novel open-source QC package, denoted Open-VQE, providing tools for using and developing chemically-inspired adaptive methods. It is able to use the Atos Quantum Learning Machine (QLM), a general programming framework enabling to write, optimize simulate computing programs. Along with OpenVQE, we introduce myQLMFermion, a new open-source module (that includes the key QLM ressources that are important for QC developments)
  arXiv  Detail & Related papers  (2022-06-17T14:24:22Z)
• Learning Classical Readout Quantum PUFs based on single-qubit gates [9.669942356088377]
  We formalize the class of Classical Readout Quantum PUFs (CR-QPUFs) using the statistical query (SQ) model. We show insufficient security for CR-QPUFs based on singlebit rotation gates, when adversary has SQ access to the CR-QPUF. We demonstrate how a malicious party can learn CR-QPUF characteristics and forge the signature of a quantum device.
  arXiv  Detail & Related papers  (2021-12-13T13:29:22Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.