相关论文: Multiparty Quantum Communication Complexity
A set of $n$ pure quantum states is called antidististinguishable if there exists an $n$-outcome measurement that never outputs the outcome `$k$' on the $k$-th quantum state. We describe sets of quantum states for which any subset of three…
We discuss the communication complexity of establishing a shared reference frame, in particular examining the case of aligning spatial axes via the exchange of spin-1/2 particles. Unlike previous work we allow for multiple rounds of…
Bell inequality violating entangled states are the working horse for many potential quantum information processing applications, including secret sharing, cryptographic key distribution and communication complexity reduction in distributed…
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…
Communication complexity, which quantifies the minimum communication required for distributed computation, offers a natural setting for investigating the capabilities and limitations of quantum mechanics in information processing. We…
In communication complexity, a number of distant parties have the task of calculating a distributed function of their inputs, while minimizing the amount of communication between them. It is known that with quantum resources, such as…
Quantum complexity measures the difficulty of obtaining a given state starting from a typically unentangled state. In this work, we show that complexity, when defined through the minimization of a Riemannian cost functional over the…
Communication complexity is a fundamental aspect of information science, concerned with the amount of communication required to solve a problem distributed among multiple parties. The standard quantification of one-way communication…
In this paper we show that sufficient multi-partite quantum entanglement helps in fair and unbiased election of a leader in a distributed network of processors with only linear classical communication complexity. We show that a total of…
Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary…
A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how…
A key goal of quantum communication is to determine the maximum number of bits shared between two quantum systems. An important example of this is in entanglement based quantum key distribution (QKD) schemes. A realistic treatment of this…
In this work we revisit the Boolean Hidden Matching communication problem, which was the first communication problem in the one-way model to demonstrate an exponential classical-quantum communication separation. In this problem, Alice's…
A two-party quantum communication process with classical inputs and outcomes can be simulated by replacing the quantum channel with a classical one. The minimal amount of classical communication required to reproduce the statistics of the…
Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate in existing…
We investigate the amount of communication that must augment classical local hidden variable models in order to simulate the behaviour of entangled quantum systems. We consider the scenario where a bipartite measurement is given from a set…
Entanglement appears under two different forms in quantum theory, namely as a property of states of joint systems and as a property of measurement eigenstates in joint measurements. By combining these two aspects of entanglement, it is…
We present an efficient quantum entanglement distribution over an arbitrary collective-noise channel. The basic idea in the present scheme is that two parties in quantum communication first transmit the entangled states in the frequency…
Entanglement based quantum communication offers an increased level of security in practical secret shared key distribution. One of the fundamental principles enabling this security -- the fact that interfering with one photon will destroy…
We investigate two senders and one receiver multiparty communication scenario. Following Phys.Rev.A83, 062112 and arXiv : 2506.07699, we study multiparty communication bounded by dimension and distinguishability. We provide an explicit…