Computational advantage of quantum random sampling
D Hangleiter, J Eisert - Reviews of Modern Physics, 2023 - APS
Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …
advantage of quantum computers over classical computers. Recently the first large-scale …
Quantum computing: progress and prospects
M Horowitz, E Grumbling - 2019 - books.google.com
Quantum mechanics, the subfield of physics that describes the behavior of very small
(quantum) particles, provides the basis for a new paradigm of computing. First proposed in …
(quantum) particles, provides the basis for a new paradigm of computing. First proposed in …
[HTML][HTML] Quantum computing in the NISQ era and beyond
J Preskill - Quantum, 2018 - quantum-journal.org
Abstract Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near
future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass …
future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass …
Classical verification of quantum computations
U Mahadev - 2018 IEEE 59th Annual Symposium on …, 2018 - ieeexplore.ieee.org
We present the first protocol allowing a classical computer to interactively verify the result of
an efficient quantum computation. We achieve this by constructing a measurement protocol …
an efficient quantum computation. We achieve this by constructing a measurement protocol …
Interactive cryptographic proofs of quantumness using mid-circuit measurements
The ability to perform measurements in the middle of a quantum circuit is a powerful
resource. It underlies a wide range of applications, from remote state preparation to quantum …
resource. It underlies a wide range of applications, from remote state preparation to quantum …
Verifiable quantum advantage without structure
T Yamakawa, M Zhandry - Journal of the ACM, 2024 - dl.acm.org
We show the following hold, unconditionally unless otherwise stated, relative to a random
oracle:—There are NP search problems solvable by quantum polynomial-time (QPT) …
oracle:—There are NP search problems solvable by quantum polynomial-time (QPT) …
Classical homomorphic encryption for quantum circuits
U Mahadev - SIAM Journal on Computing, 2020 - SIAM
We present the first leveled fully homomorphic encryption scheme for quantum circuits with
classical keys. The scheme allows a classical client to blindly delegate a quantum …
classical keys. The scheme allows a classical client to blindly delegate a quantum …
Classically verifiable quantum advantage from a computational Bell test
Existing experimental demonstrations of quantum computational advantage have had the
limitation that verifying the correctness of the quantum device requires exponentially costly …
limitation that verifying the correctness of the quantum device requires exponentially costly …
Quantum lightning never strikes the same state twice. or: quantum money from cryptographic assumptions
M Zhandry - Journal of Cryptology, 2021 - Springer
Public key quantum money can be seen as a version of the quantum no-cloning theorem
that holds even when the quantum states can be verified by the adversary. In this work, we …
that holds even when the quantum states can be verified by the adversary. In this work, we …
Oblivious transfer is in MiniQCrypt
MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum
communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt …
communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt …