相关论文: About the quantum mechanical speeding up of classi…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
A quantum cellular automaton (QCA) is an abstract model consisting of an array of finite-dimensional quantum systems that evolves in discrete time by local unitary operations. Here we propose a simple coarse-graining map, where the spatial…
Non-relativistic quantum mechanics is shown to emerge from classical mechanics through the requirement of a relativity principle based on special transformations acting on position and momentum uncertainties. These transformations keep the…
Quantum Fourier transform (QFT) is a key ingredient of many quantum algorithms where a considerable amount of ancilla qubits and gates are often needed to form a Hilbert space large enough for high-precision results. Qubit recycling reduces…
We simulate the nonlinear chaotic dynamics of Lorenz-type models for a classical two-dimensional thermal convection flow with 3 and 8 degrees of freedom by a hybrid quantum--classical reservoir computing model. The high-dimensional quantum…
We develop a hybrid classical-quantum algorithm to solve a type of linear reaction-diffusion equation, the neutron diffusion (generalized) k-eigenvalue problem that establishes nuclear criticality. The algorithm handles an equation with…
Quantum computers leverage the principles of quantum mechanics to do computation with a potential advantage over classical computers. While a single classical computer transforms one particular binary input into an output after applying one…
Quantum mechanics is widely regarded as a complete theory, yet we argue it is a tractable projection of a deeper, computationally-inaccessible classical variational structure. By analyzing the coupled partial differential equations of the…
We propose an efficient algorithm for the approximation of fractional integrals by using Runge--Kutta based convolution quadrature. The algorithm is based on a novel integral representation of the convolution weights and a special…
We study numerically quantum diffusion of a particle on small-world networks by integrating the time-dependent Schr\"odinger equation with a localized initial state. The participation ratio, which corresponds to the number of visited sites…
The numerical treatment of quantum mechanics in the semi-classical regime is known to be computationally demanding, due to the highly oscillatory behaviour of the wave function and its large spatial extension. A recently proposed…
In modelling complex processes, the potential past data that influence future expectations are immense. Models that track all this data are not only computationally wasteful but also shed little light on what past data most influence the…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
In a recent article [D. Suter, Phys. Rev. {\bf A 51}, 45 (1995)] Suter has claimed to present an optical implementation of the quantum time-translation machine which ``shows all the features that the general concept predicts and also…
Quantum algorithms for molecular electronic structure have been developed with lower computational scaling than their classical counterparts, but emerging quantum hardware is far from being capable of the coherence,connectivity and gate…
Quantum algorithms require less operations than classical algorithms. The exact reason of this has not been pinpointed until now. Our explanation is that quantum algorithms know in advance 50% of the solution of the problem they will find…
We study the thermodynamical properties of the quantum kicked rotator, coarsened by an external fluctuation with a weak intensity D, by means of the Tsallis entropy with a changing entropic index q. The genuine entropic index, corresponding…
Many quantum algorithms can be represented in a form of a classical circuit positioned between quantum Fourier transformations. Motivated by the search for new quantum algorithms, we turn to circuits where the latter transformation is…
We give an algorithm for the hidden subgroup problem for the dihedral group $D_N$, or equivalently the cyclic hidden shift problem, that supersedes our first algorithm and is suggested by Regev's algorithm. It runs in $\exp(O(\sqrt{\log…
It is shown that quantum computer can detect the existence of root of a function almost exponentially more efficient than the classical counterpart. It is also shown that a quantum computer can produce quantum state corresponding to the…