Related papers: Characterization-free classification and identific…
Open quantum systems and study of decoherence are important for our fundamental understanding of quantum physical phenomena. For practical purposes, there exists a large number of quantum protocols exploiting quantum resources, e.g.…
Recently, a protocol for quantum state discrimination (QSD) in a multi-party scenario has been introduced [Phys. Rev. Lett. 111, 100501 (2013)]. In this protocol, Alice generates a quantum system in one of two pre-defined non-orthogonal…
We develop a semidefinite programming method for the optimization of quantum networks, including both causal networks and networks with indefinite causal structure. Our method applies to a broad class of performance measures, defined…
We show within the framework of relativistic quantum tasks that the doability of any task is fully determined by a small subset of its parameters that we call its "coarse causal structure", as well as the distributed computation it aims to…
We give a causal inference scheme using quantum observations alone for a case with both temporal and spatial correlations: a bipartite quantum system with measurements at two times. The protocol determines compatibility with 5 causal…
We introduce a guessing game involving a quantum channel, three parties - the sender, the receiver and an eavesdropper, Eve - and a quantum public side channel. We prove that a necessary and sufficient condition for the quantum channel to…
We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the…
We provide an interesting two-party parity oblivious communication game whose success probability is solely determined by the Bell expression. The parity-oblivious condition in an operational quantum theory implies the preparation…
Based on an EPR pair of qubits and allowing asymptotically secure key distribution, a secure communication protocol is presented. Bob sends either of the EPR pair qubits to Alice. Alice receives the travel qubit. Then she can encode…
The whitespace-discovery problem describes two parties, Alice and Bob, trying to establish a communication channel over one of a given large segment of whitespace channels. Subsets of the channels are occupied in each of the local…
Communication games are one of the widely used tools that are designed to demonstrate quantum supremacy over classical resources. In that, two or more parties collaborate to perform an information processing task to achieve the highest…
Secure two-party computation considers the problem of two parties computing a joint function of their private inputs without revealing anything beyond the output. In this work, we consider the setting where the two parties (a classical…
Many fundamental and key objects in quantum mechanics are linear mappings between particular affine/linear spaces. This structure includes basic quantum elements such as states, measurements, channels, instruments, non-signalling channels…
Alice and Bob receive a bipartite state (possibly entangled) from some finite collection or from some subspace. Alice sends a message to Bob through a noisy quantum channel such that Bob may determine the initial state, with zero chance of…
We report an experimental certification of indefinite causal order that relies only on the characterization of the operations of a single party. We do so in the semi-device-independent scenario with the fewest possible assumptions of…
Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm with polynomial query complexity with respect to the number of systems. We model the causal order with quantum…
Blind quantum computation is a new secure quantum computing protocol which enables Alice who does not have sufficient quantum technology to delegate her quantum computation to Bob who has a fully-fledged quantum computer in such a way that…
The parity-oblivious random-access-code (PORAC) is a class of communication games involving a sender (Alice) and a receiver (Bob). In such games, Alice's amount of communication to Bob is constraint by the parity-oblivious (PO) conditions,…
Randomized experiments, or "A/B" tests, remain the gold standard for evaluating the causal effect of a policy intervention or product change. However, experimental settings, such as social networks, where users are interacting and…
We give a proof that entanglement purification, even with noisy apparatus, is sufficient to disentangle an eavesdropper (Eve) from the communication channel. In the security regime, the purification process factorises the overall initial…