Related papers: Arbitrarily little knowledge can give a quantum ad…
Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…
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…
The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical…
Nonlocality is a key feature of quantum theory and is reflected in the violation of Bell inequalities for entangled systems. The experimental tests beyond the electromagnetism and massless quanta are of great importance for understanding…
Nonlocality, one of the most puzzling features of multipartite quantum correlation, has been identified as a useful resource for device-independent quantum information processing. Motivated by the resource theory of quantum entanglement…
Quantum networks connect systems at separate locations via quantum links, enabling a wide range of quantum information tasks between distant parties. Large-scale networks have the potential to enable global secure communication, distributed…
Phenomena induced by the existence of entanglement, such as nonlocal correlations, exhibit characteristic properties of quantum mechanics distinguishing from classical theories. When entanglement is accompanied by classical communication,…
Departing from the usual paradigm of local operations and classical communication adopted in entanglement theory, here we study the interconversion of quantum states by means of local operations and shared randomness. A set of necessary and…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Involving only the measurements of commuting observables - the problem-setting and the corresponding solution - quantum algorithms should be subject to classical logic. This would allow flanking their customary quantum description with a…
It is argued that the quantum correlations are not maximally nonlocal to make it possible to control local outcomes from outside spacetime, and quantum mechanics emerges from timeless nonlocality and biased local randomness. This rules out…
We derive expressions for the expectation values of the local energy and the local power transferred by an external electrical field to a many-particle system of interacting spinless electrons. In analogy with the definition of the (local)…
In a variant of communication complexity tasks, two or more separated parties cooperate to compute a function of their local data, using a limited amount of communication. It is known that communication of quantum systems and shared…
Simulating quantum nonlocality and steering requires augmenting pre-shared randomness with non-vanishing communication cost. This prompts the question of how one may provide such an operational characterization for the quantumness of…
In former work, we showed that a quantum algorithm is the sum over the histories of a classical algorithm that knows in advance 50% of the information about the solution of the problem - each history is a possible way of getting the…
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
The multipartite correlations derived from local measurements on some composite quantum systems are inconsistent with those reproduced classically. This inconsistency is known as quantum nonlocality and shows a milestone in the foundations…
Quantum correlations provide dramatic advantage over the corresponding classical resources in several communication tasks. However a broad class of probabilistic theories exists that attributes greater success than quantum theory in many of…
The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property 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…