Search results for "deterministic"
showing 10 items of 141 documents
On the observability of Bell's inequality violation in the two-atoms optical Stern-Gerlach model
2005
Using the optical Stern-Gerlach model, we have recently shown that the non-local correlations between the internal variables of two atoms that successively interact with the field of an ideal cavity in proximity of a nodal region are affected by the atomic translational dynamics. As a consequence, there can be some difficulties in observing violation of the Bell's inequality for the atomic internal variables. These difficulties persist even if the atoms travel an antinodal region, except when the spatial wave packets are exactly centered in an antinodal point.
The Deterministic Annealing Filter: A new clustering method for gamma-ray tracking algorithms
2010
A new method of clustering for forward-tracking algorithms has been developed to reconstruct the tracks of gamma-rays in high-resolution detector systems such as AGATA (Advanced GAmma Tracking Array). This technique, called Deterministic Annealing Filter (DAF), comes from statistical physics and is used in high-energy physics. After a description of the DAF method and of the forward-tracking algorithm, the performance of this clustering method is discussed in terms of photopeak efficiency and peak-to-total ratio obtained with GEANT4 simulations for the AGATA geometry. A comparison with the standard so-called "cone clustering method" shows similar performances with a better photopeak efficie…
Teleportation of atomic states via position measurements
2007
We present a scheme for conditionally teleporting an unknown atomic state in cavity QED, which requires two atoms and one cavity mode. The translational degrees of freedom of the atoms are taken into account using the optical Stern-Gerlach model. We show that successful teleportation with probability 1/2 can be achieved through local measurements of the cavity photon number and atomic positions. Neither direct projection onto highly entangled states nor holonomous interaction-time constraints are required.
On the Size Complexity of Deterministic Frequency Automata
2013
Austinat, Diekert, Hertrampf, and Petersen [2] proved that every language L that is (m,n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are considered, where a language L′ is called an approximation of a language L if L′ differs from L in only a finite number of strings. We prove that if a deterministic frequency automaton has k states and (m,n)-recognizes a language L, where m > n/2, then there is a language L′ approximating L such that L′ c…
Codes and automata
2006
Properties and application of nondeterministic quantum query algorithms
2006
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, zero-error, bounded-error and even nondeterministic. In this paper, we study the latter class of algorithms. We introduce a fresh notion in addition to already studied nondeterministic algorithms and introduce dual nondeterministic quantum query algorithms. We examine properties of such algorithms and prove relations with exact and nondeterministic quantum query algorithm complexity. As a result and as an example of the application of discovered properties, we…
Influence of deterministic fluctuations on the 8-state Potts model
1999
We study a layered 8-state Potts model with an aperiodic modulation of the exchange couplings. Depending on its geometric properties, the aperiodic sequence may induce a 2nd order phase transition.
Some Remarks on Automata Minimality
2011
It is well known that the minimization problem of deterministic finite automata (DFAs) is related to the indistinguishability notion of states (cf. [HMU00]). Indeed, a well known technique to minimize a DFA, essentially, consists in finding pairs of states that are equivalent (or indistinguishable), namely pairs of states (p,q) such that it is impossible to assert the difference between p and q only by starting in each of the two states and asking whether or not a given input string leads to a final state. Since, in the testing states equivalence, the notion of initial state is irrelevant, some of the main techniques for the minimization of automata, such as Moore’s algorithm [Moo56] and Ho…
Internal Time and Innovation
2003
Consider a physical system that may be observed through time-varying quantities x t , where t stands for time that may be discrete or continuous. The set x t may be a realization of a deterministic system, e.g. a unique solution of a differential equation, or a stochastic process. In the latter case each x t is a random variable. We are interested in the global evolution of the system, not particular realizations x t , from the point of view of innovation. We call the evolution innovative if the dynamics of the system is such that there is a gain of information about the system as time increases. Our purpose is to associate the concept of internal time with such systems. The internal time w…