SearcharxivSearch

arXiv subjects

Boris Pavlov

Publications and source records attributed to Boris Pavlov.

3 recordsLinked to original sources

A resonance interaction of seismogravitational modes on tectonic plates

This paper discusses resonance effects to advance a classical earthquake model, namely the celebrated M8 global test algorithm. This algorithmgives high confidence levels for prediction of Time Intervals of Increased Probability (TIP) of an earthquake. It is based on observation that almost 80\% of earthquakes occur due to the stress accumulated from previous earthquakes at the location and stored in form of displacements against gravity and static elastic deformations of the plates. Nevertheless the M8 global test algorithm fails to predict some powerful earthquakes. In this paper we suggest the additional possibility of considering the dynamical storage of the elastic energy on the tectonic plates due to resonance beats of seismo-gravitational oscillations (SGO) modes of the plates. We make sure that the tangential compression in the middle plane of an "active zone" of a tectonic plate may tune its SGO modes to the resonance condition of coincidence the frequencies of the corresponding localized modes with the delocalized SGO modes of the complement. We also consider the beats arising between the modes under a small perturbations of the plates, and, assuming that the discord between the perturbed and unperturbed resonance modes is strongly dominated by the discord between the non-resonance modes estimate the energy transfer coefficient.

math.SP

Modelling of Quantum Networks

We develop the analytic perturbation technique on the absolutely continuous spectrum and calculate the Scattering matrix for the Schrödinger operator on the Quantum Network based on the Dirichlet-to Neumann map of an Intermediate operator.

math-ph

Coins, Quantum Measurements, and Turing's Barrier

Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is {\it negative}. This paper re-opens the case: we will discuss solutions to a few simple problems which suggest that {\it quantum computing is {\it theoretically} capable of computing uncomputable functions}. In this paper a mathematical quantum "device" (with sensitivity $ε$) is constructed to solve the Halting Problem. The "device" works on a randomly chosen test-vector for $T$ units of time. If the "device" produces a click, then the program halts. If it does not produce a click, then either the program does not halt or the test-vector has been chosen from an {\it undistinguishable set of vectors} ${\IF}_{ε, T}$. The last case is not dangerous as our main result proves: {\it the Wiener measure of} ${\IF}_{ε, T}$ {\it constructively tends to zero when} $T$ {\it tends to infinity}. The "device", working in time $T$, appropriately computed, will determine with a pre-established precision whether an arbitrary program halts or not. {\it Building the "halting machine" is mathematically possible.}

quant-ph