Exact Equivalence between Quantum Adiabatic Algorithm and Quantum Circuit Algorithm

We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of L gates we can construct a quantum adiabatic algorithm with time complexity of O（L）. Additionally, our construction shows that one may exponentially speed up some quantum adiabatic algorithms by properly choosing an evolution path.

The Numerical Scheme Development of a Simplified Frozen Soil Model

In almost all frozen soil models used currently, three variables of temperature, ice content and moisture content are used as prognostic variables and the rate term, accounting for the contribution of the phase change between water and ice, is shown explicitly in both the energy and mass balance equations. The models must be solved by a numerical method with an iterative process, and the rate term of the phase change needs to be pre-estimated at the beginning in each iteration step. Since the rate term of the phase change in the energy equation is closely related to the release or absorption of the great amount of fusion heat, a small error in the rate term estimation will introduce greater error in the energy balance, which will amplify the error in the temperature calculation and in turn, cause problems for the numerical solution convergence. In this work, in order to first reduce the trouble, the methodology of the variable transformation is applied to a simplified frozen soil model used currently, which leads to new frozen soil scheme used in this work. In the new scheme, the enthalpy and the total water equivalent are used as predictive variables in the governing equations to replace temperature, volumetric soil moisture and ice content used in many current models. By doing so, the rate terms of the phase change are not shown explicitly in both the mass and energy equations and its pre-estimation is avoided. Secondly, in order to solve this new scheme more functionally, the development of the numerical scheme to the new scheme is described and a numerical algorithm appropriate to the numerical scheme is developed. In order to evaluate the new scheme of the frozen soil model and its relevant algorithm, a series of model evaluations are conducted by comparing numerical results from the new model scheme with three observational data sets. The comparisons show that the results from the model are in good agreement with these data sets in both the change trend of variables and their magnitude values, and the new scheme, together with the algorithm, is more efficient and saves more computer time.

A Program Study of the Union of Semilattices on the Set of Subsets of Grids of Waterloo Language

The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of nondeterministic finite automata NFALib implemented by one of the authors in C#, as well as statistical methods for analyzing algorithms. The results are regularities obtained when considering semilattices on a set of subsets of grids of the Waterloo language. It follows from the results obtained that the minimum covering automaton equivalent to the Waterloo automaton can be obtained by adding one additional to the minimum covering set of grids. .