Related papers: Making Quantum Local Verifiers Simulable with Pote…
We present two verification protocols where the correctness of a "target" computation is checked by means of "trap" computations that can be efficiently simulated on a classical computer. Our protocols rely on a minimal set of noise-free…
We define the notion of a proof of knowledge in the setting where the verifier is classical, but the prover is quantum, and where the witness that the prover holds is in general a quantum state. We establish simple properties of our…
The problem of reliably certifying the outcome of a computation performed by a quantum device is rapidly gaining relevance. We present two protocols for a classical verifier to verifiably delegate a quantum computation to two…
We broadly generalise Mermin-type arguments on GHZ states, and we provide exact group-theoretic conditions for non-locality to be achieved. Our results are of interest in quantum foundations, where they yield a new hierarchy of…
We propose an application for near-term quantum devices: namely, generating cryptographically certified random bits, to use (for example) in proof-of-stake cryptocurrencies. Our protocol repurposes the existing "quantum supremacy"…
Device-independent (DI) tests allow to witness and quantify the quantum feature of a system, such as entanglement, without trusting the implementation devices. Although DI test is a powerful tool in many quantum information tasks, it…
We present a simple quantum interactive proof (QIP) protocol using the quantum state teleportation (QST) and quantum energy teleportation (QET) protocols. QET is a technique that allows a receiver at a distance to extract the local energy…
It is a widespread current belief that objective local models can not explain the quantum optics experiment of Pan et al. By presenting a model that operates on independent computers, we show that this belief is unfounded. Three remote…
Relativistic cryptography is a proposal for achieving unconditional security that exploits the fact that no information carrier can travel faster than the speed of light. It is based on space-time constraints but doesn't require quantum…
In this study, a distinctive feature of quantum computation (QC) is characterized. To this end, a seemingly-powerful classical computing model, called "stochastic ensemble machine (SEnM)," is considered. The SEnM runs with an ensemble…
Zero-Knowledge Proofs (ZKPs) are a cryptographic primitive that allows a prover to demonstrate knowledge of a secret value to a verifier without revealing anything about the secret itself. ZKPs have shown to be an extremely powerful tool,…
The Quantum Singular Value Transformation (QSVT) is a recent technique that gives a unified framework to describe most quantum algorithms discovered so far, and may lead to the development of novel quantum algorithms. In this paper we…
We investigate the existence of constant-round post-quantum black-box zero-knowledge protocols for $\mathbf{NP}$. As a main result, we show that there is no constant-round post-quantum black-box zero-knowledge argument for $\mathbf{NP}$…
Zero-knowledge (ZK) protocols enable software developers to provide proofs of their programs' correctness to other parties without revealing the programs themselves. Regular expressions are pervasive in real-world software, and…
A recent experiment testing the necessity of complex numbers in the standard formulation of quantum theory is recreated using IBM quantum computers. To motivate the experiment, we present a basic construction for real-valued quantum theory.…
While the amount of data produced and accumulated continues to advance at unprecedented rates, protection and concealment of data increase its prominence as a field of scientific study that requires more action. It is essential to protect…
Quotable signature schemes are digital signature schemes with the additional property that from the signature for a message, any party can extract signatures for (allowable) quotes from the message, without knowing the secret key or…
Quantum reinforcement learning (QRL) aims to use quantum effects to create sequential decision-making policies that achieve tasks more effectively than their classical counterparts. However, QRL policies face uncertainty from quantum…
A standard approach in the foundations of quantum mechanics studies local realism and hidden variables models exclusively in terms of violations of Bell-like inequalities. Thus quantum nonlocality is tied to the celebrated no-go theorems,…
The problem of quantum state classification asks how accurately one can identify an unknown quantum state that is promised to be drawn from a known set of pure states. In this work, we introduce the notion of $k$-learnability, which…