相关论文: Quantitative quantum soundness for all multipartit…
We explore the link between two concepts: the level of violation of a Bell inequality by a quantum state and discrimination between two states by means of restricted classes of operations, such as local operations and classical…
Among certification techniques, those based on the violation of Bell inequalities are appealing because they do not require assumptions on the underlying Hilbert space dimension and on the accuracy of calibration methods. Such…
Quantum incompatibility, referred as the phenomenon that some quantum measurements cannot be performed simultaneously, is necessary for various quantum information processing tasks, such as nonlocality and steering. When these applications…
We introduce a protocol between a classical polynomial-time verifier and a quantum polynomial-time prover that allows the verifier to securely delegate to the prover the preparation of certain single-qubit quantum states. The protocol…
Using the simulation paradigm in information theory, we define notions of quantum hypergraph homomorphisms and quantum hypergraph isomorphisms, and show that they constitute partial orders and equivalence relations, respectively.…
Bell nonlocality as a resource for device independent certification schemes has been studied extensively in recent years. The strongest form of device independent certification is referred to as self-testing, which given a device certifies…
Learning problems involving quantum data are natural candidates for demonstrating an advantage in quantum machine learning. Recent results indicate that, for certain tasks and under noiseless conditions, coherent processing of quantum data…
The generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion…
We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement. Two applications of this fact to the study of multi-prover quantum interactive proof…
The relation between entanglement and nonlocality is discussed in the case of multipartite quantum systems. We show that, for any number of parties, there exist genuinely multipartite entangled states which admit a fully local hidden…
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expects quantum advantage. In this work, we present a highly…
We provide multi-player quantum data hiding based on nonlocal quantum state ensembles arising from multi-party quantum state discrimination. Using bounds on local minimum-error discrimination of multi-party quantum states, we construct a…
Quantum state verification (QSV) is the task of relying on local measurements only to verify that a given quantum device does produce the desired target state. Up to now, certain types of entangled states can be verified efficiently or even…
With the advent of quantum cloud computing, the security of delegated quantum computation has become of utmost importance. While multiple statistically secure blind verification schemes in the prepare-and-send model have been proposed, none…
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and…
We construct a succinct classical argument system for QMA, the quantum analogue of NP, from generic and standard cryptographic assumptions. Previously, building on the prior work of Mahadev (FOCS '18), Bartusek et al. (CRYPTO '22) also…
Nonlocality exhibited by ensembles of composite quantum states, wherein local operations and classical communication (LOCC) yield suboptimal discrimination probabilities compared to global strategies, is one of the striking nonclassical…
Here we consider the task of device-independent certification of the quantum state distributed in a network when some of the nodes in this network may collude and act dishonestly. We introduce the paradigm of self-testing with dishonest…
We present a family of quantum money schemes with classical verification which display a number of benefits over previous proposals. Our schemes are based on hidden matching quantum retrieval games and they tolerate noise up to 23%, which…
Continuous-variable quantum cryptographic systems, including random number generation and key distribution, are often based on coherent detection. The essence of the security analysis lies in the randomness quantification. Previous analyses…