Related papers: Simplest bipartite perfect quantum strategies

Typical quantum communication schemes are such that to achieve perfect decoding the receiver must share a reference frame with the sender. Indeed, if the receiver only possesses a bounded-size quantum token of the sender's reference frame,…

In this article, we revisit the century-old question of the minimal set of observables needed to identify a quantum state: here, we replace the natural coincidences in their spectra by effective ones, induced by an imperfect measurement. We…

One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…

We initially consider a quantum system consisting of two qubits, which can be in one of two nonorthogonal states, \Psi_0 or \Psi_1. We distribute the qubits to two parties, Alice and Bob. They each measure their qubit and then compare their…

In bipartite matching problems, agents on two sides of a graph want to be paired according to their preferences. The stability of a matching depends on these preferences, which in uncertain environments also reflect agents' beliefs about…

A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…

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…

As a consequence of Bell's theorem, the statistics of measurements on some entangled states cannot be simulated with local hidden variables alone. The amount of communication that must be supplied is an intuitive quantifier of…

Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the client's privacy. Generally, many-qubit…

We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the…

In this thesis, we study two approaches to achieve device-independent quantum key distribution: in the first approach, the adversary can distribute any system to the honest parties that cannot be used to communicate between the three of…

A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…

We consider the problem of determining the state of an unknown quantum sequence without error. The elements of the given sequence are drawn with equal probability from a known set of linearly independent pure quantum states with the…

Belief propagation with quantum messages (BPQM) provides a low-complexity alternative to collective measurements for communication over classical--quantum channels. Prior BPQM constructions and density-evolution (DE) analyses have focused…

Persuasion studies how an informed principal may influence the behavior of agents by the strategic provision of payoff-relevant information. We focus on the fundamental multi-receiver model by Arieli and Babichenko (2019), in which there…

We address the problem of optimal pumping strategies in quantum networks. These networks enable secure communication by distributing entangled photon pairs to user (or node) pairs. Quantum Key Distribution (QKD) protocols, like BBM92,…

We can uniquely calculate almost all entangled state vectors of tripartite systems ABC if we know the reduced states of any two bipartite subsystems, e.g., of AB and of BC. We construct the explicit solution.

Quantum state targeting is a quantum game which results from combining traditional quantum state estimation with additional classical information. We consider a particular version of the game and show how it can be played with maximally…

The guesswork of a quantum ensemble quantifies the minimum number of guesses needed in average to correctly guess the state of the ensemble, when only one state can be queried at a time. Here, we derive analytical solutions of the guesswork…

Blind quantum computation (BQC) enables a client without enough quantum power to delegate his quantum computation to a quantum server, while keeping the input data, the algorithm and the result unknown to the server. In the studies of…