相关论文: Classical simulators of quantum computers and no-g…
Product states do not violate Bell inequalities. In this work, we investigate the quantumness of product states by violating a certain classical algebraic models. Thus even for product states, statistical predictions of quantum mechanics…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
We argue that it is the assumption of counterfactual definiteness and not locality or realism that results in Bell inequality violations. Furthermore, this assumption of counterfactual definiteness is not supported in classical mechanics.…
The "measurement problem" of quantum mechanics, and the "hard problem" of cognitive science are the most profound open problems of the two research fields, and certainly among the deepest of all unsettled conundrums in contemporary science…
Simulation tasks are insightful tools to compare information-theoretic resources. Considering a generalization of usual Bell scenarios where external quantum inputs are provided to the parties, we show that any entangled quantum state…
Nyquist-Shannon sampling theorem, instrumental in classical telecommunication technologies, is extended to quantum systems supporting a unitary representation of a finite group $G$. Two main ideas from the classical theory having natural…
We propose a new no-go theorem by proving the impossibility of constructing a deterministic quantum circuit that iterates a unitary oracle by calling it only once. Different schemes are provided to bypass this result and to approximately…
Hidden variables theories for quantum mechanics are usually assumed to satisfy the KS condition. The Bell-Kochen-Specker theorem then shows that these theories are necessarily contextual. But the KS condition can be criticized from an…
In this paper dedicated to the memory of Walter Philipp, we formalize the rules of classical$\to$ quantum correspondence and perform a rigorous mathematical analysis of the assumptions in Bell's NO-GO arguments.
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical…
Quantum computers are believed to surpass the classical ones. Moreover, it is claimed that this belief reaches the level of a mathematically proven fact within the oracle model of computation. Here we impair the whole class of the so-called…
This paper compares quantum computing simulators running on a single CPU or GPU-based HPC node using the Quantum Volume benchmark commonly proposed for comparing NISQ systems. As simulators do not suffer from noise, the metric used in the…
One of the essential building blocks of classical computer programs is the "if" clause, which executes a subroutine depending on the value of a control variable. Similarly, several quantum algorithms rely on applying a unitary operation…
Quantum mechanics can emerge from classical statistics. A typical quantum system describes an isolated subsystem of a classical statistical ensemble with infinitely many classical states. The state of this subsystem can be characterized by…
Stochastic models are highly relevant tools in science, engineering, and society. Recent work suggests emerging quantum computing technologies can substantially decrease the memory requirements for simulating stochastic models. Here we show…
The machinery of quantum mechanics is fully capable of describing a single realistic world. Here we discuss the converse: in spite of appearances, and indeed numerous claims to the contrary, any quantum mechanical model can be mimicked, up…
In a previous article [H. Bergeron, J. Math. Phys. 42, 3983 (2001)], we presented a method to obtain a continuous transition from classical to quantum mechanics starting from the usual phase space formulation of classical mechanics. This…
Investigating the classical simulability of quantum circuits provides a promising avenue towards understanding the computational power of quantum systems. Whether a class of quantum circuits can be efficiently simulated with a probabilistic…
The Kochen-Specker theorem theoretically shows evidence of the incompatibility of noncontextual hidden variable theories with quantum mechanics. Quantum contextuality is a more general concept than quantum non-locality which is quite well…
Quantum Mechanics is generally considered to be the ultimate theory capable of explaining the emergence of randomness by virtue of the quantum measurement process. Therefore, Quantum Mechanics can be thought of as God's wonderfully…