English
Related papers

Related papers: The Turing machine of a harmonic oscillator: from …

200 papers

Oscillator based Ising machines are non-von-Neumann machines ideally suited for solving combinatorial problems otherwise intractable on classic stored-program digital computers due to their run-time complexity. Possible future applications…

Emerging Technologies · Computer Science 2024-10-02 Bernd Ulmann , Shrish Roy

We aim at an understanding of the dynamical properties of a periodically driven damped harmonic oscillator coupled to a Random Field Ising Model (RFIM) at zero temperature, which is capable to show complex hysteresis. The system is a…

Chaotic Dynamics · Physics 2020-06-25 Paul Zech , Andreas Otto , Günter Radons

In this chapter we treat the quantum damped harmonic oscillator, and study mathematical structure of the model, and construct general solution with any initial condition, and give a quantum counterpart in the case of taking coherent state…

Quantum Physics · Physics 2012-09-10 Kazuyuki Fujii

In this paper we introduce a method for finding a time independent Hamiltonian of a given dynamical system by canonoid transformation. We also find a condition that the system should satisfy to have an equivalent time independent…

Classical Physics · Physics 2008-11-26 Michal Dobrski

Turing computability is the standard computability paradigm which captures the computational power of digital computers. To understand whether one can create physically realistic devices which have super-Turing power, one needs to…

Logic · Mathematics 2021-10-01 Daniel S. Graça , Ning Zhong

Constrained Hamiltonian dynamics of a quantum system of nonlinear oscillators is used to provide the mathematical formulation of a coarse-grained description of the quantum system. It is seen that the evolution of the coarse-grained system…

Quantum Physics · Physics 2015-05-28 Milan Radonjić , Slobodan Prvanović , Nikola Burić

We present an implementation of a recently proposed procedure for defining time, based on the description of the evolving system and its clock as non-interacting, entangled systems, according to the Page and Wootters approach. We study how…

Quantum Physics · Physics 2024-05-13 Alessandro Coppo , Alessandro Cuccoli , Paola Verrucchi

Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a…

Quantum Physics · Physics 2007-05-23 Willem Fouché , Johannes Heidema , Glyn Jones , Petrus H. Potgieter

The standard quantum mechanical harmonic oscillator has an exact, dual relationship with a completely classical system: a classical particle running along a circle. Duality here means that there is a one-to-one relation between all…

Quantum Physics · Physics 2024-10-30 Gerard t Hooft

We describe a magnetically driven torsional oscillator that is well suited for teaching the physics of simple harmonic motion using a collection of hands-on, quantitative experiments. The mechanical Q of the system can be tuned using…

Physics Education · Physics 2026-03-31 Kenneth G. Libbrecht

We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…

Quantum Physics · Physics 2007-05-23 Stephen D. Bartlett , Barry C. Sanders , Samuel L. Braunstein , Kae Nemoto

Efforts at understanding the computational processes in the brain have met with limited success, despite their importance and potential uses in building intelligent machines. We propose a simple new model which draws on recent findings in…

Neural and Evolutionary Computing · Computer Science 2016-09-14 Eric Laukien , Richard Crowder , Fergal Byrne

This paper introduces a new computing model based on the cooperation among Turing machines called orchestrated machines. Like universal Turing machines, orchestrated machines are also designed to simulate Turing machines but they can also…

Artificial Intelligence · Computer Science 2015-03-13 Norbert Bátfai

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…

Computational Complexity · Computer Science 2012-03-16 Yaroslav D. Sergeyev , Alfredo Garro

Dynamical systems are abstract models of interaction between space and time. They are often used in fields such as physics and engineering to understand complex processes, but due to their general nature, they have found applications for…

Logic · Mathematics 2023-06-01 David Fernández-Duque , Yoàv Montacute

A set of coupled complex Ginzburg-landau type amplitude equations which operates near a Hopf-Turing instability boundary is analytically investigated to show localized oscillatory patterns. The spatial structure of those patterns are the…

Pattern Formation and Solitons · Physics 2007-05-23 A. Bhattacharyay

Here we prove that the classical (respectively, quantum) system, consisting of a particle moving in a static electromagnetic field, is canonically (respectively, unitarily) equivalent to a harmonic oscillator perturbed by a spatially…

Quantum Physics · Physics 2023-06-27 Henryk Gzyl

Computation plays a key role in predicting and analyzing natural phenomena. There are two fundamental barriers to our ability to computationally understand the long-term behavior of a dynamical system that describes a natural process. The…

Computational Complexity · Computer Science 2017-02-15 Mark Braverman , Alexander Grigo , Cristobal Rojas

In this paper, we describe a numerical continuation method that enables harmonic analysis of nonlinear periodic oscillators. This method is formulated as a boundary value problem that can be readily implemented by resorting to a standard…

Dynamical Systems · Mathematics 2015-05-19 Federico Bizzarri , Daniele Linaro , Bart Oldeman , Marco Storace

This paper discusses how to implement certain classes of quantum computer algorithms using classical discrete switching networks that are amenable to implementation in main stream CMOS transistor IC technology. The methods differ from other…

Computational Complexity · Computer Science 2009-05-14 John S. Hamel