Related papers: A New Rule for Quantization that Resolves All Prob…
We describe a scheme for constructing quantum mechanics in which a quantum system is considered as a collection of open classical subsystems. This allows using the formal classical logic and classical probability theory in quantum…
This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of…
The so-called classical limit of quantum mechanics is generally studied in terms of the decoherence of the state operator that characterizes a system. This is not the only possible approach to decoherence. In previous works we have…
Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Since quantum systems produce counter-intuitive patterns believed not to be efficiently…
We develop a new master equation as a unified description of the effects of both quantum noise (system-bath interaction) and classical noise on a system's dynamics, using a two-dimensional series expansion method. When quantum and classical…
Quantum theory revolutionised physics by introducing a new fundamental constant and a new mathematical framework to describe the observed phenomena at the atomic scale. These new concepts run counter to our familiar notions of classical…
Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two…
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…
These notes discuss the quantum algorithms we know of that can solve problems significantly faster than the corresponding classical algorithms. So far, we have only discovered a few techniques which can produce speed up versus classical…
An analysis using classical stochastic processes is used to construct a consistent system of quantum counterfactual reasoning. When applied to a counterfactual version of Hardy's paradox, it shows that the probabilistic character of quantum…
The quantization rules recently proposed by M. Navarro (and independently I.V. Kanatchikov) for a finite-dimensional formulation of quantum field theory are applied to the Klein-Gordon and the Dirac fields to obtain the quantum equations of…
An integrable anharmonic oscillator is presumably simulable by a classical computer and therefore by a quantum computer. An integrable anharmonic oscillator whose Hamiltonian is of normal type and quartic in the canonical coordinates is not…
We discuss the deformation quantization approach for the teaching of quantum mechanics. This approach has certain conceptual advantages which make its consideration worthwhile. In particular, it sheds new light on the relation between…
Quantum computers are considered as a part of the family of the reversible, lineary-extended, dynamical systems (Quanputers). For classical problems an operational reformulation is given. A universal algorithm for the solving of classical…
There are several regimes in chaotic inflationary cosmology where some part of the system is classical and some other quantum. I describe how to deal with such systems and how to disentangle their dynamics into classical behaviour and…
A quantization procedure, which has recently been introduced for the analysis of Painlev\'e equations, is applied to a general time-independent potential of a Newton equation. This analysis shows that the quantization procedure preserves…
An improved criterion for distinguishing conditions in which classical or quantum behavior occurs is developed by comparing classical and quantum mechanical measures of size while incorporating spatial and temporal restrictions on wave…
Doubts are raised concerning the usual interpretation of the alleged failure, by quantum mechanics, of the distributive law of classical logic. The difficulty raised by incompatible sets of observables is overcome within an epistemic…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
We give a short, critical review of the issue of decoherence. We establish the most general framework in which decoherence can be discussed, how it can be quantified and how it can be measured. We focus on environment induced decoherence…