arXiv subjects

Yuri Ozhigov

Publications and source records attributed to Yuri Ozhigov.

34 records · Page 2Linked to original sources

arXiv2006

Simulation of quantum dynamics via classical collective behavior

The simple algorithm for the simulation and visualization of non relativistic quantum dynamics is proposed that is based on a collective behavior of classical particles. Any quantum particle is represented as the swarm of its classical samples which interact by simple rules including emission and absorption of samples of tied photons. The quantum dynamics results from the collective behavior of such a swarm where the eigenstates are treated as the equilibrium states relatively to emission-absorption of photons. The entanglement is treated as a correlation between samples of the different swarms that is stored in the space-time part of the model inaccessible for a user. The amplitude is always grained. The Coulomb field between quantum particles is simulated, analogously to free flow of quantum package, by the point wise interaction between its samples and scalar photon samples which propagate by diffusion. It gives square root speedup in comparison to each-with-each method. This method obviously includes decoherence and admits the natural generalization on the QED of many particles with the linear computational cost.

quant-ph↗

arXiv2004

Algorithmic approach to quantum physics

Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the analysis, and a simulation gives a "film" which visualizes many particle quantum dynamics and is demonstrated to a user of the model. Restrictions following from the algorithm theory are considered on a level of fundamental physical laws. Born rule for the calculation of quantum probability as well as the decoherence is derived from the existence of a nonzero minimal value of amplitude module - a grain of amplitude. The limitation on the classical computational resources gives the unified description of quantum dynamics that is not divided to the unitary dynamics and measurements and does not depend on the existence of observer. It is proposed the description of states based on the nesting of particles in each other that permits to account the effects of all levels in the same model. Algorithmic approach admits the possibility of refutation, because it forbids the creation of a scalable quantum computer that is allowed in the conventional quantum formalism.

quant-ph↗

arXiv2003

Simulation of quantum interference by reactions of chemical type

A quantum unitary evolution alternated with measurements is simulated by a bubble filled with fictitious particles called amplitude quanta that move chaotically and can be transformed by the simple rules that look like chemical reactions. A basic state of simulated system is treated as a collision of the two corresponding amplitude quanta, that gives the quantum statistics of measurements. The movement of the external membrane of the bubble corresponds to the classical dynamics of the simulated system. Measurements are treated as the membrane perforations and they are completely determined by initial conditions. An identity of particles and an entanglement is simulated by the membranes touching. The required memory grows linearly where the number of particles increases, but entangled states of the big number of particles can be simulated. The method can be used for a visualization of quantum dynamics.

quant-ph↗

arXiv2002

Easy Control over Fermionic Computations

Quantum fermionic computations on occupation numbers proposed in quant-ph/0003137 are studied. It is shown that a control over external field and tunneling would suffice to fulfill all quantum computations without valuable slowdown in the framework of such model when an interaction of diagonal type is fixed and permanent. Substantiation is given through a reduction of some subset of this model to the conventional language of quantum computing and application of the construction from quant-ph/0202030.

quant-ph↗

arXiv2002

Quantum Computer with Fixed Interaction is Universal

It is proved that a quantum computer with fixed and permanent interaction of diagonal type between qubits proposed in the work quant-ph/0201132 is universal. Such computer is controlled only by one-qubit quick transformations, and this makes it feasible.

quant-ph↗

arXiv2002

Implementation of Quantum Fourier Transform and Simulation of Wave Functions by Fixed Interaction

We study a quantum computer with fixed and permanent interaction of diagonal type between qubits. It is controlled only by one-qubit quick transformations. It is shown how to implement Quantum Fourier Transform and to solve Shroedinger equations with linear and quadratic potentials by a quantum computer of such type. The method is adaptable to the wide range of interactions of diagonal form between qubits and to the case when different pairs of qubits interact variously.

quant-ph↗

arXiv2000

How behavior of systems with sparse spectrum can be predicted on a quantum computer

Call a spectrum of Hamiltonian sparse if each eigenvalue can be quickly restored with accuracy $ε$ from its rough approximation in within $ε_1$ by means of some classical algorithm. It is shown how a behavior of system with sparse spectrum up to time $T=\frac{1-ρ}{14ε}$ can be predicted with fidelity $ρ$ on quantum computer in time $t=\frac{4}{(1-ρ)ε_1}$ plus the time of classical algorithm. The quantum knowledge of Hamiltonian $H$ eigenvalues is considered as a wizard Hamiltonian $W_H$ which action on any eigenvector of $H$ gives the corresponding eigenvalue. Speedup of evolution for systems with sparse spectrum is possible because for such systems wizard Hamiltonians can be quickly simulated on a quantum computer. This simulation, generalizing Shor trick, is a part of presented algorithm. In general case the action of wizard Hamiltonian cannot be simulated in time smaller than the dimension of main space which is exponential of the size of quantum system. For an arbitrary system (even for classical) its behavior cannot be predicted on quantum computer even for one step ahead. This method can be used also for restoration of a state of an arbitrary primary system in time instant $-T$ in the past with the same fidelity which requires the same time.

quant-ph↗

arXiv1999

Speedup of iterated quantum search by parallel performance

Given a sequence $f_1 (x_1), f_2 (x_1, x_2), ..., f_k (x_1, ..., x_k)$ of Boolean functions, each of which $f_i$ takes the value 1 in a single point of the form $x_1^0, x_2^0, ..., x_i^0, i=1,2,..., k$. A length of all $x_i^0$ is $n, N=2^n$. It is shown how to find $x_k^0 (k\geq 2)$ using \frac{kπ\sqrt{N}}{4\sqrt{2}}$ simultaneous evaluations of functions of the form $f_i, f_{i+1}$ with an error probability of order $k/\sqrt{N}$ which is $\sqrt{2}$ times as fast as by the $k$ sequential applications of Grover algorithm for the quantum search. Evolutions of amplitudes in parallel quantum computations are approximated by systems of linear differential equations. Some advantage of simultaneous evaluations of all $f_1 ,... f_k$ are discussed.

quant-ph↗

arXiv1998

Lower Bounds of Quantum Search for Extreme Point

We show that Durr-Hoyer's quantum algorithm of searching for extreme point of integer function can not be sped up for functions chosen randomly. Any other algorithm acting in substantially shorter time $o(\sqrt{2^n})$ gives incorrect answer for the functions with the single point of maximum chosen randomly with probability converging to 1. The lower bound as $Ω(\sqrt{2^n /b})$ was established for the quantum search for solution of equations $f(x)=1$ where $f$ is a Boolean function with $b$ such solutions chosen at random with probability converging to 1.

quant-ph↗

arXiv1998

Fast quantum verification for the formulas of predicate calculus

Quantum algorithm is constructed which verifies the formulas of predicate calculus in time $O(\sqrt N)$ with bounded error probability, where $N$ is the time required for classical algorithms. This algorithm uses the polynomial number of simultaneous oracle queries. This is a modification of the result of Buhrman, Cleve and Wigderson quant-ph/9802040.

quant-ph↗

arXiv1998

Quantum Computers Speed Up Classical with Probability Zero

Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e >0$, and $f$ is chosen randomly then with probability 1 every quantum computer requires not less than $T$ evaluations of $f$ to obtain the result of classical computation. It means that the set of classical algorithms admitting quantum speeding up has probability measure zero. The second result is that for arbitrary classical time complexity $T$ and $f$ chosen randomly with probability 1 every quantum simulation of classical computation requires at least $Ω(\sqrt {T})$ evaluations of $f$.

quant-ph↗

arXiv1998

Lindenmayer systems as a model of computations

LS is a particular type of computational processes simulating living tissue. They use an unlimited branching process arising from the simultaneous substitutions of some words instead of letters in some initial word. This combines the properties of cellular automata and grammars. It is proved that 1) The set of languages, computed in a polynomial time on such LS that all replacing words are not empty, is exactly NP- languages. 2) The set of languages, computed in a polynomial time on arbitrary LS, contains the polynomial hierarchy. 3) The set of languages, computed in a polynomial time on a nondeterministic version of LS, strictly contains the set of languages, computed in a polynomial time on Turing Machines with a space complexity $n^a$, where $a$ is positive integer. In particular, the last two results mean that Lindenmayer systems may be even more powerful tool of computations than nondeterministic Turing Machine.

comp-gas↗

arXiv1998

Computations on Nondeterministic Cellular Automata

The work is concerned with the trade-offs between the dimension and the time and space complexity of computations on nondeterministic cellular automata. It is proved, that 1). Every NCA $\Cal A$ of dimension $r$, computing a predicate $P$ with time complexity T(n) and space complexity S(n) can be simulated by $r$-dimensional NCA with time and space complexity $O(T^{\frac{1}{r+1}} S^{\frac{r}{r+1}})$ and by $r+1$-dimensional NCA with time and space complexity $O(T^{1/2} +S)$. 2) For any predicate $P$ and integer $r>1$ if $\Cal A$ is a fastest $r$-dimensional NCA computing $P$ with time complexity T(n) and space complexity S(n), then $T= O(S)$. 3). If $T_{r,P}$ is time complexity of a fastest $r$-dimensional NCA computing predicate $P$ then $T_{r+1,P} &=O((T_{r,P})^{1-r/(r+1)^2})$, $T_{r-1,P} &=O((T_{r,P})^{1+2/r})$. Similar problems for deterministic CA are discussed.

comp-gas↗

arXiv1997

Quantum Computer Can Not Speed Up Iterated Applications of a Black Box

Let a classical algorithm be determined by sequential applications of a black box performing one step of this algorithm. If we consider this black box as an oracle which gives a value F(a) for any query a, we can compute T sequential applications of F on a classical computer relative to this oracle in time T. It is proved that if T=O(2^{n/7}), where n is the length of input, then the result of T sequential applications of F can not be computed on quantum computer with oracle for F for all possible F faster than in time Ω(T). This means that there is no general method of quantum speeding up of classical algorithms provided in such a general method a classical algorithm is regarded as iterated applications of a given black box. For an arbitrary time complexity T a lower bound for the time of quantum simulation was found to be Ω(T^{1/2}).

quant-ph↗

arXiv1997

Protection of information in quantum qatabases

The conventional protection of information by cryptographical keys makes no sense if a key can be quickly discovered by an unauthorized person. This way of penetration to the protected systems was made possible by a quantum computers in view of results of P.Shor and L.Grover. This work presents the method of protection of an information in a database from a spy even he knows all about its control system and has a quantum computer, whereas a database can not distinguish between operations of spy and legal user.

quant-ph↗

arXiv1997

About the quantum mechanical speeding up of classical algorithms

This work introduces a relative diffusion transformation (RDT) - a simple unitary transformation which acts in a subspace, localized by an oracle. Such a transformation can not be fulfilled on quantum Turing machines with this oracle in polynomial time in general case. It is proved, that every function computable in time T and space S on classical 1-dimensional cellular automaton, can be computed with certainty in time O(S \sqrt T) on quantum computer with RDTs over the parts of intermediate products of classical computation. This requires multiprocessor, which consists of \sqrt T quantum devices each of O(S) size, working in parallel-serial mode and interacting by classical lows.

quant-ph↗