SearcharxivSearch

arXiv subjects

Can Gokler

Publications and source records attributed to Can Gokler.

10 recordsLinked to original sources

A local phase space stochastic quantization?

I examine whether Nelson's stochastic formulation of Schrödinger equation could be derived from a phase space process through a colored noise smoothing. If this conjecture is true, it would yield a local stochastic hidden variable theory. I discuss how this does not necessarily contradict Bell type theorems as general local stochastic theories can violate local causality assumptions. I also discuss the generalization to quantization of fields and speculate about the gravitational origins of noise.

quant-ph

Equivalence of quantum harmonic oscillators and classical oscillators subject to random forces

We show that the Schrödinger equation for the quantum harmonic oscillator can be derived as an approximation to the Newtonian mechanics of a classical harmonic oscillator subject to a random force for time intervals $O( m / \hbar)$, when $\hbar / m \ll 1$. Conversely, every solution to the Schrödinger equation, including all the superposition states, arises this way. In other words, the quantum harmonic oscillator is approximately nothing but the classical harmonic oscillator, with the same mass and frequency as the quantum harmonic oscillator, subject to a random force. We generalize the result to multiple non-interacting oscillators. We show that the Schrödinger equation for $n$ non-interacting quantum harmonic oscillators with masses $m_1, ..., m_n$ and frequencies $ω_1, ..., ω_n$ can be derived as an approximation to the Newtonian mechanics of $n$ non-interacting classical harmonic oscillators, with the same set of masses and frequencies as the quantum oscillators, subject to random forces. This is valid for time intervals $O( \tilde{m} / \hbar)$, where $\tilde{m}$ is the mass of the minimum mass oscillator, when $\hbar/\tilde{m} \ll 1$. Conversely, every solution, including all the entangled states, to the Schrödinger equation arises this way. In other words, $n$ non-interacting quantum harmonic oscillators are approximately nothing but $n$ non-interacting classical harmonic oscillators, with the same set of masses and frequencies as the quantum oscillators, subject to random forces. This provides a local Newtonian model of entanglement of non-interacting quantum oscillators. The correlations required by entangled states are embedded in the phase space probability density of the classical oscillators.

quant-ph

Estimation theory and gravity

It is shown that if the Euclidean path integral measure of a minimally coupled free quantum scalar field on a classical metric background is interpreted as probability of observing the field configuration given the background metric then the maximum likelihood estimate of the metric satisfies Euclidean Einstein field equations with the stress-energy tensor of the 'observed' field as the source. In the case of a slowly varying metric the maximum likelihood estimate is very close to its actual value. Then by virtue of the asymptotic normality of the maximum likelihood estimate the fluctuations of the metric are Gaussian and governed by the Fisher information bi-tensor. Cramer-Rao bound can be interpreted as uncertainty relations between metric and stress-energy tensor. A plausible prior distribution for the metric fluctuations in a Bayesian framework is introduced. Using this distribution, we calculate the decoherence functional acting on the field by integrating out the metric fluctuations around flat space. Our approach can be interpreted as a formulation of Euclidean version of stochastic gravity in the language of estimation theory.

quant-ph

Quantum algorithm for nonlinear differential equations

Quantum computers are known to provide an exponential advantage over classical computers for the solution of linear differential equations in high-dimensional spaces. Here, we present a quantum algorithm for the solution of nonlinear differential equations. The quantum algorithm provides an exponential advantage over classical algorithms for solving nonlinear differential equations. Potential applications include the Navier-Stokes equation, plasma hydrodynamics, epidemiology, and more.

quant-ph

Quantum behavior of a classical particle subject to a random force

We give a partial answer to the question whether the Schrodinger equation can be derived from the Newtonian mechanics of a particle in a potential subject to a random force. We show that the fluctuations around the classical motion of a one dimensional harmonic oscillator subject to a random force can be described by the Schrodinger equation for a period of time depending on the frequency and the energy of the oscillator. We achieve this by deriving the postulates of Nelson's stochastic formulation of quantum mechanics for a random force depending on a small parameter. We show that the same result applies to small potential perturbations around the harmonic oscillator as long as the total potential preserves the periodicity of motion with a small shift in frequency. We also show that the noise spectrum can be chosen to obtain the result for all oscillator frequencies for fixed mass. We discuss heuristics to generalize the result for a particle in one dimension in a potential where the motion can be described using action-angle variables.

quant-ph

Mean field limit for many-particle interactions

We provide an error bound for approximating the time evolution of N bosons by a generalized nonlinear Hartree equation. The bosons are assumed to interact via permutation symmetric bounded many-particle potentials and the initial wave-function is a product state. We show that the error between the actual evolution of a single particle derived from tracing out the full N-particle Schrodinger equation and the solution to the mean field approximate generalized nonlinear Hartree equation scales as 1/N for all times. Our result is a generalization of rigorous error bounds previously given for the case of bounded 2-particle potentials

quant-ph

When is a bit worth much more than kT ln2?

Physical processes thatobtain, process, and erase information involve tradeoffs between information and energy. The fundamental energetic value of a bit of information exchanged with a reservoir at temperature T is kT ln2. This paper investigates the situation in which information is missing about just what physical process is about to take place. The fundamental energetic value of such information can be far greater than kT ln2 per bit.

cond-mat.stat-mech

Maximizing free energy gain

Maximizing the amount of work harvested from an environment is important for a wide variety of biological and technological processes, from energy-harvesting processes such as photosynthesisto energy storage systems such as fuels and batteries. Here we consider the maximization of free energy -- and by extension, the maximum extractable work -- that can be gained by a classical or quantum system that undergoes driving by its environment. We consider how the free energy gain depends on the initial state of the system, while also accounting for the cost of preparing the system. We provide simple necessary and sufficient conditions for increasing the gain of free energy by varying the initial state. We also derive simple formulae that relate the free energy gained using the optimal initial state rather than another suboptimal initial state. Finally, we demonstrate that the problem of finding the optimal initial state may have two distinct regimes, one easy and one difficult, depending on the temperatures used for preparation and work extraction. We illustrate our results on a simple model of an information engine.

cond-mat.stat-mech

Efficiently Controllable Graphs

We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in the sense that universal quantum computation can be performed using a control sequence polynomial in the size of the network while controlling a vanishingly small fraction of subsystems. We show that networks corresponding to finite-dimensional lattices are efficently controllable, and explore generalizations to percolation clusters and random graphs. We show that the classical computational complexity of estimating the ground state of Hamiltonians described by controllable graphs is polynomial in the number of subsystems/qubits.

quant-ph

Time Independent Universal Computing with Spin Chains: Quantum Plinko Machine

We present a scheme for universal quantum computing using XY Heisenberg spin chains. Information is encoded into packets propagating down these chains, and they interact with each other to perform universal quantum computation. A circuit using g gate blocks on m qubits can be encoded into chains of length $O(g^{3+δ} m^{3+δ})$ for all $δ>0$ with vanishingly small error.

quant-ph