On the Connection Between Quantum Pseudorandomness and Quantum Hardware
Assumptions
- URL: http://arxiv.org/abs/2110.11724v2
- Date: Wed, 30 Mar 2022 17:01:37 GMT
- Title: On the Connection Between Quantum Pseudorandomness and Quantum Hardware
Assumptions
- Authors: Mina Doosti, Niraj Kumar, Elham Kashefi, and Kaushik Chakraborty
- Abstract summary: This paper addresses the questions related to the connections between the quantum pseudorandomness and quantum hardware assumptions.
We show that the efficient pseudorandom quantum states (PRS) are sufficient to construct the challenge set for the universally unforgeable qPUF.
As an application of our results, we show that the efficiency of an existing qPUF-based client-server identification protocol can be improved without losing the security requirements.
- Score: 1.4174475093445233
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper, for the first time, addresses the questions related to the
connections between the quantum pseudorandomness and quantum hardware
assumptions, specifically quantum physical unclonable functions (qPUFs). Our
results show that the efficient pseudorandom quantum states (PRS) are
sufficient to construct the challenge set for the universally unforgeable qPUF,
improving the previous existing constructions that are based on the Haar-random
states. We also show that both the qPUFs and the quantum pseudorandom unitaries
(PRUs) can be constructed from each other, providing new ways to obtain PRS
from the hardware assumptions. Moreover, we provide a sufficient condition (in
terms of the diamond norm) that a set of unitaries should have to be a PRU in
order to construct a universally unforgeable qPUF, giving yet another novel
insight into the properties of the PRUs. Later, as an application of our
results, we show that the efficiency of an existing qPUF-based client-server
identification protocol can be improved without losing the security
requirements of the protocol.
Related papers
- 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.
Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.
We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries.
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) - Guarantees on the structure of experimental quantum networks [105.13377158844727]
Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing.
As these networks grow in size, certification tools will be required to answer questions regarding their properties.
We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
arXiv Detail & Related papers (2024-03-04T19:00:00Z) - Pseudorandom unitaries are neither real nor sparse nor noise-robust [0.0]
Pseudorandom quantum states (PRSs) and pseudorandom unitaries (PRUs) possess the dual nature of being efficiently constructible while appearing completely random to any efficient quantum algorithm.
We show that PRSs and PRUs exist only when the probability that an error occurs is negligible, ruling out their generation on noisy intermediate-scale and early fault-tolerant quantum computers.
arXiv Detail & Related papers (2023-06-20T16:54:27Z) - 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) - Pseudorandom (Function-Like) Quantum State Generators: New Definitions
and Applications [7.2051162210119495]
We explore new definitions, new properties and applications of pseudorandom states.
Pseudorandom quantum states (PRS) are efficiently constructible states that are computationally indistinguishable from being Haar-random.
We show that PRS generators with logarithmic output length imply commitment and encryption schemes with classical communication.
arXiv Detail & Related papers (2022-11-02T19:24:55Z) - 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) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - 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) - Efficient Construction of Quantum Physical Unclonable Functions with
Unitary t-designs [1.7403133838762446]
We study the noise-resilience of QPUF_t against specific types of noise, unitary noise, and show that some resilience can be achieved.
To make the noise-resilience more realistic and meaningful, we conclude that some notion of error mitigation or correction should be introduced.
arXiv Detail & Related papers (2021-01-14T16:14:03Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
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.