Related papers: Arbitrarily little knowledge can give a quantum ad…
We experimentally demonstrate the superior discrimination of separated, unentangled two-qubit correlated states using nonlocal measurements, when compared with measurements based on local operations and classical communications. When…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…
We show that any two different unitary operations acting on an arbitrary multipartite quantum system can be perfectly distinguishable by local operations and classical communication when a finite number of runs is allowed. We then directly…
Two of the most intriguing features of quantum physics are the uncertainty principle and the occurrence of nonlocal correlations. The uncertainty principle states that there exist pairs of incompatible measurements on quantum systems such…
Quantum resources, such as entanglement or quantum communication, offer significant communication advantages in information processing. We develop an operational framework for realizing these communication advantages in resource-constrained…
The use of the so-called entropic inequalities is revisited in the light of new quantum correlation measures, specially nonlocality. We introduce the concept of {\it classicality} as the non-violation of these classical inequalities by…
Bell non-locality is a fundamental feature of quantum mechanics whereby measurements performed on "spatially separated" quantum systems can exhibit correlations that cannot be understood as revealing predetermined values. This is a special…
We consider classical and quantum algorithms which have a duality property: roughly, either the algorithm provides some nontrivial improvement over random or there exist many solutions which are significantly worse than random. This enables…
Interesting connection has been established between two apparently unrelated concepts, namely, quantum nonlocality and Bayesian game theory. It has been shown that nonlocal correlations in the form of advice can outperform classical…
Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…
Two distant systems can exhibit quantum nonlocality even though the correlations between them admit a local model. This nonlocality can be revealed by testing extra correlations between successive measurements on one of the systems which do…
Learning about physical systems from quantum-enhanced experiments, relying on a quantum memory and quantum processing, can outperform learning from experiments in which only classical memory and processing are available. Whereas quantum…
We will show for undergraduate and graduate students of physics that Quantum Mechanics is an incomplete and non-local theory. The problem of non-locality is discussed by analyzing the Bell's theorem where are considered correlations between…
Quantum theory promises computational speed-ups over classical approaches. The celebrated Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of "magic" states -- the secret sauce to…
Quantum algorithms based on quantum kernel methods have been investigated previously [1]. A quantum advantage is derived from the fact that it is possible to construct a family of datasets for which, only quantum processing can recognise…
If Nature allowed nonlocal correlations other than those predicted by quantum mechanics, would that contradict some physical principle? Various approaches have been put forward in the past two decades in an attempt to single out quantum…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
We investigate how much quantum distributed algorithms can outperform classical distributed algorithms with respect to the message complexity (the overall amount of communication used by the algorithm). Recently, Dufoulon, Magniez and…
For certain restricted computational tasks, quantum mechanics provides a provable advantage over any possible classical implementation. Several of these results have been proven using the framework of measurement-based quantum computation…