Related papers: Information and communication in polygon theories

It is known that there is no possibility of transmitting information without a certain amount of energy. This is arbitrarily small in Classical Physics, due to the continuous nature of the energy parameter, while one cannot reduce that…

Quantum state preparation is a fundamental primitive in quantum algorithms for encoding classical data into quantum amplitudes. We compare the cost of preparing general $n$-qubit states with real amplitudes using two common paradigms:…

In quantum superdense coding, two parties previously sharing entanglement can communicate a two bit message by sending a single qubit. We study this feature in the broader framework of general probabilistic theories. We consider a…

We study the simultaneous message passing (SMP) model of communication complexity, for the case where one party is quantum and the other is classical. We show that in an SMP protocol that computes some function with the first party sending…

Quantum systems are known to offer advantages over their classical counterpart in communication complexity protocols, where the aim is to minimize the amount of information exchange between distant parties to compute global functions of…

The scheme for probabilistic teleportation of an N-particle state of general form is proposed. As the special cases we construct efficient quantum logic networks for implementing probabilistic teleportation of a two-particle state, a…

A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Such a correspondence, however, does not exist even for pure quantum states in the multipartite domain.…

We introduce the framework of general probabilistic theories (GPTs for short). GPTs are a class of operational theories that generalize both finite-dimensional classical and quantum theory, but they also include other, more exotic theories,…

Quantum communication leads to strong correlations, that can outperform classical ones. Complementary to previous works in this area, we investigate correlations in prepare-and-measure scenarios assuming a bound on the information content…

In research concerning quantum networks, it is often assumed that the parties can classically communicate with each other. However, classical communication might introduce a substantial delay to the network, especially if it is large. As…

We propose an extended quantum theory, in which the number K of parameters necessary to characterize a quantum state behaves as fourth power of the number N of distinguishable states. As the simplex of classical N-point probability…

We study the advantages of quantum communication models over classical communication models that are equipped with a limited number of qubits of entanglement. In this direction, we give explicit partial functions on $n$ bits for which…

Traditional power theories and one of their most important concepts --apparent power-- are still a source of debate and, as shown in the literature, they present several flaws that misinterpret the power-transfer phenomena under distorted…

In some scenarios there are ways of conveying information with many fewer, even exponentially fewer, qubits than possible classically. Moreover, some of these methods have a very simple structure--they involve only few message exchanges…

The standard postulates of quantum theory can be divided into two groups: the first one characterizes the structure and dynamics of pure states, while the second one specifies the structure of measurements and the corresponding…

In this paper, we study the question of how efficiently a collection of interconnected nodes can perform a global computation in the widely studied GOSSIP model of communication. In this model, nodes do not know the global topology of the…

We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical…

We present a protocol to simulate the quantum correlations of an arbitrary bipartite state, when the parties perform a measurement according to two traceless binary observables. We show that $\log(d)$ bits of classical communication is…

In quantum computation the target fidelity of the qubit gates is very high, with the admissible error being in the range from $10^{-3}$ to $10^{-4}$ and even less, depending on the protocol. The direct experimental determination of such an…

We show that every tripartite quantum correlation generated with a Schmidt state (in particular every correlation generated with the GHZ state) can be simulated with the sending of two bits of classical communication from Alice to Bob and…