The Argument Against Quantum Computers

Kalai, Gil

doi:10.1007/978-3-030-34316-3_18

Cited by 13 publications

(7 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If one wants to take a very pessimistic stance to quantum computing, fundamentally, according to Kalai (2020) and others, due to the excessive noise in NISQ devices, the complexity of these devices does not exceed the class of low-degree polynomials at all. This means that NISQ machines are computationally not stronger than classical computers and classical computers are in theory able to simulate calculations on NISQ devices.…”

Section: Discussionmentioning

confidence: 99%

“…Additionally, we discuss the security of CR-QPUFs in the contrarian views of the power of NISQ devices, i.e. whether output distributions of NISQ devices can in general be modelled using low-degree polynomials or not Kalai (2020). Finally, we propose future work and possible next steps for investigating CR-QPUFs that are secure against machine learning attacks.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Learning classical readout quantum PUFs based on single-qubit gates

Pirnay

Pappa

Seifert

2022

Quantum Mach. Intell.

View full text Add to dashboard Cite

Physical unclonable functions (PUFs) have been proposed as a way to identify and authenticate electronic devices. Recently, several ideas have been presented to that aim to achieve the same for quantum devices. Some of these constructions apply single-qubit gates in order to provide a secure fingerprint of the quantum device. In this work, we formalize the class of classical readout quantum PUFs (CR-QPUFs) using the statistical query (SQ) model and explicitly show insufficient security for CR-QPUFs based on single-qubit rotation gates, when the adversary has SQ access to the CR-QPUF. We demonstrate how a malicious party can learn the CR-QPUF characteristics and forge the signature of a quantum device through a modelling attack using a simple regression of low-degree polynomials. The proposed modelling attack was successfully implemented in a real-world scenario on real IBM Q quantum machines. We thoroughly discuss the prospects and problems of CR-QPUFs where quantum device imperfections are used as a secure fingerprint.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Learning classical readout quantum PUFs based on single-qubit gates

Pirnay

Pappa

Seifert

2022

Quantum Mach. Intell.

View full text Add to dashboard Cite

show abstract

“…If one wants to take a very pessimistic stance to quantum computing, fundamentally, according to Kalai (2020) and others, due to the excessive noise in NISQ devices, the complexity of these devices does not exceed the class of lowdegree polynomials at all. This means that NISQ machines are computationally not stronger than classical computers and classical computers are in theory able to simulate calculations on NISQ devices.…”

Section: Discussionmentioning

confidence: 99%

Learning Classical Readout Quantum PUFs based on single-qubit gates

Pirnay,

Pappa,

Seifert

2021

Preprint

View full text Add to dashboard Cite

Physical Unclonable Functions (PUFs) have been proposed as a way to identify and authenticate electronic devices. Recently, several ideas have been presented that aim to achieve the same for quantum devices. Some of these constructions apply single-qubit gates in order to provide a secure fingerprint of the quantum device. In this work, we formalize the class of Classical Readout Quantum PUFs (CR-QPUFs) using the statistical query (SQ) model and explicitly show insufficient security for CR-QPUFs based on single qubit rotation gates, when the adversary has SQ access to the CR-QPUF. We demonstrate how a malicious party can learn the CR-QPUF characteristics and forge the signature of a quantum device through a modelling attack using a simple regression of low-degree polynomials. The proposed modelling attack was successfully implemented in a realworld scenario on real IBM Q quantum machines. We thoroughly discuss the prospects and problems of CR-QPUFs where quantum device imperfections are used as a secure fingerprint.

show abstract

“…These concerns are primarily related to the concept of decoherence, where quantum systems interact with their environment and lose their quantum properties (superposition, entanglement, and, interference) over time affecting the outcome of quantum circuits. A controlled quantum environment has led to debates about achieving reliable quantum computers [16]. It also suggests that quantum computers can outperform classical if certain conditions are met [17].…”

Section: B Noisy Intermediate-scale Quantum (Nisq)mentioning

confidence: 99%

Quantum Computing: Circuits, Algorithms, and Applications

Shafique,

Munir,

Latif

2024

IEEE Access

View full text Add to dashboard Cite

Quantum computing, a transformative field that emerged from quantum mechanics and computer science, has gained immense attention for its potential to revolutionize computation. This paper aims to address the fundamentals of quantum computing and provide a comprehensive guide for both novices and experts in the field of quantum computing. Beginning with the foundational principles of quantum computing, we introduce readers to the fundamental concepts of qubits, superposition, entanglement, interference, and noise. We explore quantum hardware, quantum gates, and basic quantum circuits. This study offers insight into the current phase of quantum computing, including the noisy intermediatescale quantum (NISQ) era and its potential for solving real-world problems. Furthermore, we discuss the development of quantum algorithms and their applications, with a focus on famous algorithms like Shor's algorithm and Grover's algorithm. We also touch upon quantum computing's impact on various industries, such as cryptography, optimization, machine learning, and material science. By the end of this paper, readers will have a solid understanding of quantum computing's principles, applications, and the steps involved in developing quantum circuits. Our goal is to provide a valuable resource for those eager to embark on their quantum computing journey and for researchers looking to stay updated on this rapidly evolving field.

show abstract

The Argument Against Quantum Computers

Cited by 13 publications

References 29 publications

Learning classical readout quantum PUFs based on single-qubit gates

Learning classical readout quantum PUFs based on single-qubit gates

Learning Classical Readout Quantum PUFs based on single-qubit gates

Quantum Computing: Circuits, Algorithms, and Applications

Contact Info

Product

Resources

About