Related papers: On the Relativistic Zero Knowledge Quantum Proofs …
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al.,…
Previous studies in quantum information have recognized that specific types of noise can encode information in certain applications. However, the role of noise in Quantum Hypothesis Testing (QHT), traditionally assumed to undermine…
Information-theoretic key agreement is impossible to achieve from scratch and must be based on some - ultimately physical - premise. In 2005, Barrett, Hardy, and Kent showed that unconditional security can be obtained in principle based on…
We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a composable (quantum) oblivious transfer (OT) protocol, mostly lifting the round-complexity properties and security guarantees…
Quantum noise constitutes a fundamental obstacle to realizing practical quantum technologies. To address the pivotal challenge of identifying quantum systems least affected by noise, we introduce the purest quantum state identification,…
Uncertainty relations express the fundamental incompatibility of certain observables in quantum mechanics. Far from just being puzzling constraints on our ability to know the state of a quantum system, uncertainty relations are at the heart…
In a previous paper, we introduced a semi-device-independent scheme consisting of an untrusted source sending quantum states to an untrusted measuring device, with the sole assumption that the average energy of the states emitted by the…
Using unreliable or noisy components for reliable communication requires error correction. But which noise processes can support information transmission, and which are too destructive? For classical systems any channel whose output depends…
Zero-knowledge proofs (ZKPs) are widely applied in digital economies, such as cryptocurrencies and smart contracts, for establishing trust and ensuring privacy between untrusted parties. However, almost all ZKPs rely on unproven…
In this work we consider the following problem: in a Multi-Prover environment, how close can we get to prove the validity of an NP statement in Zero-Knowledge ? We exhibit a set of two novel Zero-Knowledge protocols for the 3-COLorability…
We initiate the study of non-interactive zero-knowledge (NIZK) arguments for languages in QMA. Our first main result is the following: if Learning With Errors (LWE) is hard for quantum computers, then any language in QMA has an NIZK…
Quantum error correction protects quantum information against environmental noise. When using qubits, a measure of quality of a code is the maximum number of errors that it is able to correct. We show that a suitable notion of ``number of…
Quantum dynamics can be driven by measurement. By constructing measurements that gain no information, effective unitary evolution can be induced on a quantum system, for example in ancilla driven quantum computation. In the non-ideal case…
We use techniques for lower bounds on communication to derive necessary conditions in terms of detector efficiency or amount of super-luminal communication for being able to reproduce with classical local hidden-variable theories the…
Recursive techniques have recently been introduced into quantum programming so that a variety of large quantum circuits and algorithms can be elegantly and economically programmed. In this paper, we present a proof system for formal…
Quantum error correcting codes have been shown to have the ability of making quantum information resilient against noise. Here we show that we can use quantum error correcting codes as diagnostics to characterise noise. The experiment is…
Watrous had presented the first proof of zero-knowledge property of a proof system against a quantum verifier. The key of the proof is the construction of a quantum simulator. In the construction, the 'failure state' is rotated to the…
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the…
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…
Information-theoretic uncertainty relations formulate the joint immeasurability of two non-commuting observables in terms of information entropies. The trade-off of the accuracy in the outcome of two successive measurements manifests in…