Related papers: Quantum mechanics for military officers
An approximation method which combines the perturbation theory with the variational calculation is constructed for quantum mechanical problems. Using the anharmonic oscillator and the He atom as examples, we show that the present method…
The additivity of classical probabilities is only the first in a hierarchy of possible sum-rules, each of which implies its successor. The first and most restrictive sum-rule of the hierarchy yields measure-theory in the Kolmogorov sense,…
The guesswork of a quantum ensemble quantifies the minimum number of guesses needed in average to correctly guess the state of the ensemble, when only one state can be queried at a time. Here, we derive analytical solutions of the guesswork…
Consider the problem of estimating the median of N items to a precision epsilon, i.e., the estimate should be such that, with a high probability, the number of items, with values both smaller than and larger than this estimate, is less than…
The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their…
In this paper we review a proposed geometrical formulation of quantum mechanics. We argue that this geometrization makes available mathematical methods from classical mechanics to the quantum frame work. We apply this formulation to the…
Several concrete examples in quantum information are discussed to demonstrate the importance of proper modeling that relates the mathematical description to real-world applications. In particular, it is shown that some commonly accepted…
A physical picture for Quantum Mechanics which permits to conciliate it with the usual common sense is proposed. The picture agrees with the canonical Copenhagen interpretation making more clear its statements.
We attempt to contribute some novel points of view to the "foundations of quantum mechanics", using mathematical tools from "quantum probability theory" (such as the theory of operator algebras). We first introduce an abstract algebraic…
In this paper we discuss and analyse the idea of trying to see (non-relativistic) quantum mechanics as a ``space-time statistical mechanics'', by using the classical statistical mechanical method on objective microscopic space-time…
It is shown that the statistical conception of quantum mechanics is dynamical but not probabilistic, i.e. the statistical description in quantum mechanics is founded on dynamics. A use of the probability theory, when it takes place, is…
This article introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.
We present a quantum algorithm for efficiently sampling transformed Gaussian random fields on $d$-dimensional domains, based on an enhanced version of the classical moving average method. Pointwise transformations enforcing boundedness are…
In this work, we present a case study in implementing a variational quantum algorithm for solving the Poisson equation, which is a commonly encountered partial differential equation in science and engineering. We highlight the practical…
We show that the principles of a ''complete physical theory'' and the conclusions of the standard quantum mechanics do not irreconcilably contradict each other as is commonly believed. In the algebraic approach, we formulate axioms that…
These notes provide an introduction to standard topics on quantum computation and communication for those who already have a basic knowledge of quantum mechanics. The main target audience are professional physicists as well as advanced…
The basics of the Wigner formulation of Quantum-Mechanics and few related interpretational issues are presented in a simple language. This formulation has extensive applications in Quantum Optics and in Mixed Quantum-Classical formulations.
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…
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average…
We discuss a general quantum theoretical example of quantum cohomology and show that various mathematical aspects of quantum cohomology have quantum mechanical and also observable significance.