Related papers: A Classically Impossible Task Done by Using Quantu…
Starting with a consideration of the implication of Bell inequalities in quantum mechanics, a new quantum postulate is suggested in order to restore classical locality and causality to quantum physics: only the relative coordinates between…
We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can…
We show that a classical fluid mechanical system can violate Bell's inequality because the fluid motion is correlated over large distances.
We propose Bell inequalities for discrete or continuous quantum systems which test the compatibility of quantum physics with an interpretation in terms of deterministic hidden-variable theories. The wave function collapse that occurs in a…
In constructing his theorem, Bell assumed that correlation functions among non-commuting variables are the same as those among commuting variables. However, in quantum mechanics, multiple data values exist simultaneously for commuting…
The extravagances of quantum mechanics never fail to enrich daily the debate around natural philosophy. Entanglement, non-locality, collapse, many worlds, many minds, and subjectivism have challenged generations of thinkers. Its approach…
It has been recently claimed that no protocol for measuring quantum work can satisfy standard required physical principles, casting doubts on the compatibility between quantum mechanics, thermodynamics, and the classical limit. In this…
We report two fundamental experiments on three-level quantum systems (qutrits). The first one tests the simplest task for which quantum mechanics provides an advantage with respect to classical physics. The quantum advantage is certified by…
It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to…
Understanding the limits of quantum theory in terms of uncertainty and correlation has always been a topic of foundational interest. Surprisingly this pursuit can also bear interesting applications such as device-independent quantum…
A specific instantiation of classical correlation from entangled quantum resources can be established at a distance through the use of local measurements without classical communication. It is thereby possible to, e.g., allow distant…
The method of using concepts and insight from quantum information theory in order to solve problems in reversible classical computing (introduced in Ref. [1]) have been generalized to irreversible classical computing. The method have been…
A class of unitary operations generated by idealized, semiclassical fields is studied. The operations implemented by sharp potential kicks are revisited and the possibility of performing them by softly varying external fields is examined.…
The characterization of quantum correlations in terms of information-theoretic resource has been a fruitful approach to understand the power of quantum correlations as a resource. While bipartite entanglement and Bell inequality violation…
A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…
Bell inequalities are mathematical constructs that demarcate the boundary between quantum and classical physics. A new class of multiplicative Bell inequalities originating from a volume maximization game (based on products of correlators…
We present an idiosyncratic view of the race for quantum computational supremacy. Google's approach and IBM challenge are examined. An unexpected side-effect of the race is the significant progress in designing fast classical algorithms.…
Standard quantum mechanics employs complex Hilbert spaces, but whether complex numbers are fundamental or merely convenient has long been debated. For decades, real-valued equivalents were considered mathematically possible but cumbersome.…
We demonstrate that a classical emulation of quantum gate operations, here represented by an actual analog electronic device, can be modeled accurately as a quantum operation in terms of a universal set of Pauli operators. This observation…
It has been shown that the apparent advantage of some quantum machine learning algorithms may be efficiently replicated using classical algorithms with suitable data access -- a process known as dequantization. Existing works on…