Classically-Verifiable Quantum Advantage from a Computational Bell Test

We propose and analyze a novel interactive protocol for demonstrating quantum computational advantage, which is efficiently classically verifiable. Our protocol relies upon the cryptographic hardness of trapdoor claw-free functions (TCFs). Through a surprising connection to Bell's inequality, our protocol avoids the need for an adaptive hardcore bit, with essentially no increase in the quantum circuit complexity and no extra cryptographic assumptions. Crucially, this expands the set of compatible TCFs, and we propose two new constructions: one based upon the decisional Diffie-Hellman problem and the other based upon Rabin's function, x^2 N. We also describe two unique features of our interactive protocol: (i) it allows one to discard so-called "garbage bits", thereby removing the need for reversibility in the quantum circuits, and (ii) there exists a natural post-selection scheme, which significantly reduces the fidelity needed to demonstrate quantum advantage. Finally, we design several efficient circuits for x^2 N and describe a blueprint for their implementation on a Rydberg-atom-based quantum computer.


page 1

page 2

page 3

page 4


Post-Quantum κ-to-1 Trapdoor Claw-free Functions from Extrapolated Dihedral Cosets

Noisy Trapdoor Claw-free functions (NTCF) as powerful post-quantum crypt...

Indistinguishability Obfuscation of Null Quantum Circuits and Applications

We study the notion of indistinguishability obfuscation for null quantum...

Simpler Proofs of Quantumness

A proof of quantumness is a method for provably demonstrating (to a clas...

Quantum Meets the Minimum Circuit Size Problem

In this work, we initiate the study of the Minimum Circuit Size Problem ...

Quantum Depth in the Random Oracle Model

We give a comprehensive characterization of the computational power of s...

On the Connection Between Quantum Pseudorandomness and Quantum Hardware Assumptions

This paper, for the first time, addresses the questions related to the c...

Quantum Period Finding with a Single Output Qubit -- Factoring n-bit RSA with n/2 Qubits

We study quantum period finding algorithms such as Simon, Shor, and Eker...

Please sign up or login with your details

Forgot password? Click here to reset