Related papers: Higher dimensional communication complexity proble…
Nonlocality and contextuality are at the root of conceptual puzzles in quantum mechanics, and are key resources for quantum advantage in information-processing tasks. Bell nonlocality is best understood as the incompatibility between…
The correlations in quantum networks have attracted strong interest with new types of violations of the locality. The standard Bell inequalities cannot characterize the multipartite correlations that are generated by multiple sources. The…
Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of…
Distributed quantum information processing seeks to overcome the scalability limitations of monolithic quantum devices by interconnecting multiple quantum processing nodes via classical and quantum communication. This approach extends the…
This work addresses two problems in the context of two-party communication complexity of functions. First, it concludes the line of research, which can be viewed as demonstrating qualitative advantage of quantum communication in the three…
We explore the link between two concepts: the level of violation of a Bell inequality by a quantum state and discrimination between two states by means of restricted classes of operations, such as local operations and classical…
Recent years have seen significant activity on the problem of using data for the purpose of learning properties of quantum systems or of processing classical or quantum data via quantum computing. As in classical learning, quantum learning…
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPR-pairs). Some lower bound techniques are available for qubit communication…
We address the following criterion for quantifying the quantum information resources: classically simulable {\it vs.} classically non-simulable information processing. This approach gives rise to existence of a deeper level of quantum…
Understanding the connections between different quantum information protocols has been proven fruitful for both theoretical insights and experimental applications. In this work, we explore the relationship between non-local and…
We define quantum-like probabilistic behaviour as behaviour which is impossible to describe by using the classical probability model. We discuss the conjecture that cognitive behaviour is quantum-like. There is presented the scheme for an…
Building large-scale quantum communication networks has its unique challenges. Here, we demonstrate that a network-wide synergistic usage of quantum memories distributed in a quantum communication network offers a fundamental advantage. We…
Efforts to construct deeper, realistic, level of physical description, in which individual systems have, like in classical physics, preexisting properties revealed by measurements are known as hidden-variable programs. Demonstrations that a…
Quantum mechanics and classical mechanics are two very different theories, but the correspondence principle states that quantum particles behave classically in the limit of high quantum number. In recent years much research has been done on…
We study the problem of decoding classical information encoded on quantum states at the output of a quantum channel, with particular focus on increasing the communication rates towards the maximum allowed by Quantum Mechanics. After a brief…
Quantum Correlations are studied extensively in quantum information domain. Entanglement Measures and Quantum Discord are good examples of these actively studied correlations. Detection of violation in Bell inequalities is also a widely…
Deviations from classical physics when distant quantum systems become correlated are interesting both fundamentally and operationally. There exist situations where the correlations enable collaborative tasks that are impossible within the…
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. In this work, we develop powerful…
Bell's theorem implies that the outcomes of local measurements on two maximally entangled systems cannot be simulated without classical communication between the parties. The communication cost is finite for n Bell states, but it grows…
The existence of a global causal order between events places constraints on the correlations that parties may share. Such "causal correlations" have been the focus of recent attention, driven by the realization that some extensions of…