Search results for "A* algorithm"
showing 10 items of 2538 documents
Quantum correlations in generalized spin star system
2006
The problem of detecting quantum signatures in the correlations formed in dynamical evolution of quantum bipartite systems receives a lot of attention in current literature. Generally speaking, the occurrence of correlations between two observables of a system does not necessarily reflect nonclassical behaviour. In this paper, the exact dynamics of a pair of uncoupled spins 1/2 interacting with a common spin 1/2 bath is investigated. Starting from a separable initial condition, the ability of the system to develop purely quantum correlations is brought to light. Physical interpretation of the concurrence function as well as a suggestion on how to measure it are given.
Phase transition shifts in films
1991
Abstract We present a Monte Carlo computer simulation study of phase transitions in a three-dimensional Ising/lattice gas model with nearest neighbor attractive coupling and confined to a slit-like capillary with absorbing walls. Data are generated for thicknesses D ⩽ 40 and are used to study the shift of the phase boundaries due to finite wall separation.
Phase Transitions in the Multicomponent Widom-Rowlinson Model and in Hard Cubes on the BCC--Lattice
1997
We use Monte Carlo techniques and analytical methods to study the phase diagram of the M--component Widom-Rowlinson model on the bcc-lattice: there are M species all with the same fugacity z and a nearest neighbor hard core exclusion between unlike particles. Simulations show that for M greater or equal 3 there is a ``crystal phase'' for z lying between z_c(M) and z_d(M) while for z > z_d(M) there are M demixed phases each consisting mostly of one species. For M=2 there is a direct second order transition from the gas phase to the demixed phase while for M greater or equal 3 the transition at z_d(M) appears to be first order putting it in the Potts model universality class. For M large, …
Quantum Walk Search with Time-Reversal Symmetry Breaking
2015
We formulate Grover's unstructured search algorithm as a chiral quantum walk, where transitioning in one direction has a phase conjugate to transitioning in the opposite direction. For small phases, this breaking of time-reversal symmetry is too small to significantly affect the evolution: the system still approximately evolves in its ground and first excited states, rotating to the marked vertex in time $\pi \sqrt{N} / 2$. Increasing the phase does not change the runtime, but rather changes the support for the 2D subspace, so the system evolves in its first and second excited states, or its second and third excited states, and so forth. Apart from the critical phases corresponding to these…
Doubling the success of quantum walk search using internal-state measurements
2015
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it doubles the success probability of many quantum spatial search algorithms. For example, this allows Grover's unstructured search problem to be solved with certainty, rather than with probability 1/2 if only the walker's position is measured, so the additional measurement yields a search algorithm that is twice as fast as without it, on average. Thus the internal state of discrete-time quantum walks holds valuable information that can be utilized to improve a…
An Operator-Based Exact Treatment of Open Quantum Systems
2005
"Quantum mechanics must be regarded as open systems. On one hand, this is due to the fact that, like in classical physics, any realistic system is subjected to a coupling to an uncontrollable environment which influences it in a non-negligible way. The theory of open quantum systems thus plays a major role in many applications of quantum physics since perfect isolation of quantum system is not possible and since a complete microscopic description or control of the environment degrees of freedom is not feasible or only partially so" [1]. Practical considerations therefore force one to seek for a simpler, effectively probabilistic description in terms of an open system. There is a close physi…
Bayesian hierarchical models in manufacturing bulk service queues
2006
In this paper, Queueing Theory and Bayesian statistical tools are used to analyze the congestion of various manufacturing bulk service queues with the same characteristics that are working independently of one another and in equilibrium. Hierarchical models are discussed in order to develop the whole inferential process for the parameters governing the system. Markov Chain Monte Carlo methods and numerical inversion of transforms are addressed to compute the posterior predictive distributions of the usual measures of performance in practice.
An approximation to maximum likelihood estimates in reduced models
1990
SUMMARY An approximation to the maximum likelihood estimates of the parameters in a model can be obtained from the corresponding estimates and information matrices in an extended model, i.e. a model with additional parameters. The approximation is close provided that the data are consistent with the first model. Applications are described to log linear models for discrete data, to models for multivariate normal distributions with special covariance matrices and to mixed discrete-continuous models.
An Adaptive Parallel Tempering Algorithm
2013
Parallel tempering is a generic Markov chainMonteCarlo samplingmethod which allows good mixing with multimodal target distributions, where conventionalMetropolis- Hastings algorithms often fail. The mixing properties of the sampler depend strongly on the choice of tuning parameters, such as the temperature schedule and the proposal distribution used for local exploration. We propose an adaptive algorithm with fixed number of temperatures which tunes both the temperature schedule and the parameters of the random-walk Metropolis kernel automatically. We prove the convergence of the adaptation and a strong law of large numbers for the algorithm under general conditions. We also prove as a side…
The Power of Word-Frequency Based Alignment-Free Functions: a Comprehensive Large-Scale Experimental Analysis
2021
Abstract Motivation Alignment-free (AF) distance/similarity functions are a key tool for sequence analysis. Experimental studies on real datasets abound and, to some extent, there are also studies regarding their control of false positive rate (Type I error). However, assessment of their power, i.e. their ability to identify true similarity, has been limited to some members of the D2 family. The corresponding experimental studies have concentrated on short sequences, a scenario no longer adequate for current applications, where sequence lengths may vary considerably. Such a State of the Art is methodologically problematic, since information regarding a key feature such as power is either mi…