Related papers: Operational protocols cannot certify classicality
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In…
Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate…
It is shown that with the use of entanglement a specific two party communication task can be done with a systematically smaller expected error than any possible classical protocol could do. The example utilises the very tight correlation…
Due to the importance of entanglement for quantum information purposes, a framework has been developed for its characterization and quantification as a resource based on the following operational principle: entanglement among $N$ parties…
Niels Bohr famously insisted on the indispensability of what he termed "classical concepts." In the context of the decoherence program, on the other hand, it has become fashionable to talk about the "dynamical emergence of classicality"…
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, which enables a classical verifier to use a quantum…
We study when a physical operation can produce entanglement between two systems initially disentangled. The formalism we develop allows to show that one can perform certain non-local operations with unit probability by performing local…
Teleportation is the most widely discussed application of the basic principles of quantum mechanics. Fundamentally, this process describes the transmission of information, which involves transport of neither matter nor energy. The implicit…
We propose a general framework to allow: (a) specifying the operational semantics of a programming language; and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal…
In early days of quantum theory it was believed that the results of measurements performed on two distant physical systems should be uncorrelated thus their quantum state should be separable it means described by a simple tensor product of…
The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…
The formalism of classical and quantum mechanics on phase space leads to symplectic and Heisenberg group representations, respectively. The Wigner functions give a representation of the quantum system using classical variables. The…
Classical systems can be entangled. Entanglement is defined by coincidence correlations. Quantum entanglement experiments can be mimicked by a mechanical system with a single conserved variable and 77.8% conditional efficiency. Experiments…
We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the…
We present a new type system with support for proofs of programs in a call-by-value language with control operators. The proof mechanism relies on observational equivalence of (untyped) programs. It appears in two type constructors, which…
We propose a general argument to show that if a physical system can mediate locally the generation of entanglement between two quantum systems, then it itself must be non-classical. Remarkably, we do not assume any classical or quantum…
Coherent superposition and entanglement are two fundamental aspects of non-classicality. Here we provide a quantitative connection between the two on the level of operations by showing that the dynamical coherence of an operation upper…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
For systems consisting of distinguishable particles, there exists an agreed upon notion of entanglement which is fundamentally based on the possibility of addressing individually each one of the constituent parties. Instead, the…
The emerging field of entanglement or nonseparability in classical optics is reviewed, and its similarities with and differences from quantum entanglement clearly pointed out through a recapitulation of Hilbert spaces in general, the…