Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning
NASA Technical Reports Server (NTRS)
Smelyanskiy, V. N.; Toussaint, U. V.; Timucin, D. A.
2002-01-01
We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.
Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning
NASA Technical Reports Server (NTRS)
Smelyanskiy, Vadius; vonToussaint, Udo V.; Timucin, Dogan A.; Clancy, Daniel (Technical Monitor)
2002-01-01
We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.
Random Matrix Approach to Quantum Adiabatic Evolution Algorithms
NASA Technical Reports Server (NTRS)
Boulatov, Alexei; Smelyanskiy, Vadier N.
2004-01-01
We analyze the power of quantum adiabatic evolution algorithms (Q-QA) for solving random NP-hard optimization problems within a theoretical framework based on the random matrix theory (RMT). We present two types of the driven RMT models. In the first model, the driving Hamiltonian is represented by Brownian motion in the matrix space. We use the Brownian motion model to obtain a description of multiple avoided crossing phenomena. We show that the failure mechanism of the QAA is due to the interaction of the ground state with the "cloud" formed by all the excited states, confirming that in the driven RMT models. the Landau-Zener mechanism of dissipation is not important. We show that the QAEA has a finite probability of success in a certain range of parameters. implying the polynomial complexity of the algorithm. The second model corresponds to the standard QAEA with the problem Hamiltonian taken from the Gaussian Unitary RMT ensemble (GUE). We show that the level dynamics in this model can be mapped onto the dynamics in the Brownian motion model. However, the driven RMT model always leads to the exponential complexity of the algorithm due to the presence of the long-range intertemporal correlations of the eigenvalues. Our results indicate that the weakness of effective transitions is the leading effect that can make the Markovian type QAEA successful.
Random matrix approach to quantum adiabatic evolution algorithms
Boulatov, A.; Smelyanskiy, V.N.
2005-05-15
We analyze the power of the quantum adiabatic evolution algorithm (QAA) for solving random computationally hard optimization problems within a theoretical framework based on random matrix theory (RMT). We present two types of driven RMT models. In the first model, the driving Hamiltonian is represented by Brownian motion in the matrix space. We use the Brownian motion model to obtain a description of multiple avoided crossing phenomena. We show that nonadiabatic corrections in the QAA are due to the interaction of the ground state with the 'cloud' formed by most of the excited states, confirming that in driven RMT models, the Landau-Zener scenario of pairwise level repulsions is not relevant for the description of nonadiabatic corrections. We show that the QAA has a finite probability of success in a certain range of parameters, implying a polynomial complexity of the algorithm. The second model corresponds to the standard QAA with the problem Hamiltonian taken from the RMT Gaussian unitary ensemble (GUE). We show that the level dynamics in this model can be mapped onto the dynamics in the Brownian motion model. For this reason, the driven GUE model can also lead to polynomial complexity of the QAA. The main contribution to the failure probability of the QAA comes from the nonadiabatic corrections to the eigenstates, which only depend on the absolute values of the transition amplitudes. Due to the mapping between the two models, these absolute values are the same in both cases. Our results indicate that this 'phase irrelevance' is the leading effect that can make both the Markovian- and GUE-type QAAs successful.
Transitionless driving on adiabatic search algorithm
Oh, Sangchul; Kais, Sabre
2014-12-14
We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics.
Transitionless driving on adiabatic search algorithm
NASA Astrophysics Data System (ADS)
Oh, Sangchul; Kais, Sabre
2014-12-01
We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics.
Transitionless driving on adiabatic search algorithm.
Oh, Sangchul; Kais, Sabre
2014-12-14
We study quantum dynamics of the adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolution is studied and visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for the short running time to inverse-square decay in asymptotic running time. The scaling of the critical running time is expressed in terms of the Lambert W function. We derive the transitionless driving Hamiltonian for the adiabatic search algorithm, which makes a quantum state follow the adiabatic path. We demonstrate that a uniform transitionless driving Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with the running time. This may open up a new but simple way of speeding up adiabatic quantum dynamics. PMID:25494733
On a Nonlinear Model in Adiabatic Evolutions
NASA Astrophysics Data System (ADS)
Sun, Jie; Lu, Song-Feng
2016-08-01
In this paper, we study a kind of nonlinear model of adiabatic evolution in quantum search problem. As will be seen here, for this problem, there always exists a possibility that this nonlinear model can successfully solve the problem, while the linear model can not. Also in the same setting, when the overlap between the initial state and the final stare is sufficiently large, a simple linear adiabatic evolution can achieve O(1) time efficiency, but infinite time complexity for the nonlinear model of adiabatic evolution is needed. This tells us, it is not always a wise choice to use nonlinear interpolations in adiabatic algorithms. Sometimes, simple linear adiabatic evolutions may be sufficient for using. Supported by the National Natural Science Foundation of China under Grant Nos. 61402188 and 61173050. The first author also gratefully acknowledges the support from the China Postdoctoral Science Foundation under Grant No. 2014M552041
Quantum gates with controlled adiabatic evolutions
NASA Astrophysics Data System (ADS)
Hen, Itay
2015-02-01
We introduce a class of quantum adiabatic evolutions that we claim may be interpreted as the equivalents of the unitary gates of the quantum gate model. We argue that these gates form a universal set and may therefore be used as building blocks in the construction of arbitrary "adiabatic circuits," analogously to the manner in which gates are used in the circuit model. One implication of the above construction is that arbitrary classical boolean circuits as well as gate model circuits may be directly translated to adiabatic algorithms with no additional resources or complexities. We show that while these adiabatic algorithms fail to exhibit certain aspects of the inherent fault tolerance of traditional quantum adiabatic algorithms, they may have certain other experimental advantages acting as quantum gates.
Quantum Adiabatic Algorithms and Large Spin Tunnelling
NASA Technical Reports Server (NTRS)
Boulatov, A.; Smelyanskiy, V. N.
2003-01-01
We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in this paper. The algorithm is applied to a random binary optimization problem (a version of the 3-Satisfiability problem) where the n-bit cost function is symmetric with respect to the permutation of individual bits. The evolution paths are produced, using the generic control Hamiltonians H (r) that preserve the bit symmetry of the underlying optimization problem. In the case where the ground state of H(0) coincides with the totally-symmetric state of an n-qubit system the algorithm dynamics is completely described in terms of the motion of a spin-n/2. We show that different control Hamiltonians can be parameterized by a set of independent parameters that are expansion coefficients of H (r) in a certain universal set of operators. Only one of these operators can be responsible for avoiding the tunnelling in the spin-n/2 system during the quantum adiabatic algorithm. We show that it is possible to select a coefficient for this operator that guarantees a polynomial complexity of the algorithm for all problem instances. We show that a successful evolution path of the algorithm always corresponds to the trajectory of a classical spin-n/2 and provide a complete characterization of such paths.
On the Role of Prior Probability in Adiabatic Quantum Algorithms
NASA Astrophysics Data System (ADS)
Sun, Jie; Lu, Songfeng; Yang, Liping
2016-03-01
In this paper, we study the role of prior probability on the efficiency of quantum local adiabatic search algorithm. The following aspects for prior probability are found here: firstly, only the probabilities of marked states affect the running time of the adiabatic evolution; secondly, the prior probability can be used for improving the efficiency of the adiabatic algorithm; thirdly, like the usual quantum adiabatic evolution, the running time for the case of multiple solution states where the number of marked elements are smaller enough than the size of the set assigned that contains them can be significantly bigger than that of the case where the assigned set only contains all the marked states.
Complexity of the Quantum Adiabatic Algorithm
NASA Technical Reports Server (NTRS)
Hen, Itay
2013-01-01
The Quantum Adiabatic Algorithm (QAA) has been proposed as a mechanism for efficiently solving optimization problems on a quantum computer. Since adiabatic computation is analog in nature and does not require the design and use of quantum gates, it can be thought of as a simpler and perhaps more profound method for performing quantum computations that might also be easier to implement experimentally. While these features have generated substantial research in QAA, to date there is still a lack of solid evidence that the algorithm can outperform classical optimization algorithms.
General conditions for quantum adiabatic evolution
Comparat, Daniel
2009-07-15
Adiabaticity occurs when, during its evolution, a physical system remains in the instantaneous eigenstate of the Hamiltonian. Unfortunately, existing results, such as the quantum adiabatic theorem based on a slow down evolution [H({epsilon}t),{epsilon}{yields}0], are insufficient to describe an evolution driven by the Hamiltonian H(t) itself. Here we derive general criteria and exact bounds, for the state and its phase, ensuring an adiabatic evolution for any Hamiltonian H(t). As a corollary, we demonstrate that the commonly used condition of a slow Hamiltonian variation rate, compared to the spectral gap, is indeed sufficient to ensure adiabaticity but only when the Hamiltonian is real and nonoscillating (for instance, containing exponential or polynomial but no sinusoidal functions)
Adiabatic evolution of plasma equilibrium
Grad, H.; Hu, P. N.; Stevens, D. C.
1975-01-01
A new theory of plasma equilibrium is introduced in which adiabatic constraints are specified. This leads to a mathematically nonstandard structure, as compared to the usual equilibrium theory, in which prescription of pressure and current profiles leads to an elliptic partial differential equation. Topologically complex configurations require further generalization of the concept of adiabaticity to allow irreversible mixing of plasma and magnetic flux among islands. Matching conditions across a boundary layer at the separatrix are obtained from appropriate conservation laws. Applications are made to configurations with planned islands (as in Doublet) and accidental islands (as in Tokamaks). Two-dimensional, axially symmetric, helically symmetric, and closed line equilibria are included. PMID:16578729
NMR implementation of adiabatic SAT algorithm using strongly modulated pulses.
Mitra, Avik; Mahesh, T S; Kumar, Anil
2008-03-28
NMR implementation of adiabatic algorithms face severe problems in homonuclear spin systems since the qubit selective pulses are long and during this period, evolution under the Hamiltonian and decoherence cause errors. The decoherence destroys the answer as it causes the final state to evolve to mixed state and in homonuclear systems, evolution under the internal Hamiltonian causes phase errors preventing the initial state to converge to the solution state. The resolution of these issues is necessary before one can proceed to implement an adiabatic algorithm in a large system where homonuclear coupled spins will become a necessity. In the present work, we demonstrate that by using "strongly modulated pulses" (SMPs) for the creation of interpolating Hamiltonian, one can circumvent both the problems and successfully implement the adiabatic SAT algorithm in a homonuclear three qubit system. This work also demonstrates that the SMPs tremendously reduce the time taken for the implementation of the algorithm, can overcome problems associated with decoherence, and will be the modality in future implementation of quantum information processing by NMR. PMID:18376911
NMR implementation of adiabatic SAT algorithm using strongly modulated pulses
NASA Astrophysics Data System (ADS)
Mitra, Avik; Mahesh, T. S.; Kumar, Anil
2008-03-01
NMR implementation of adiabatic algorithms face severe problems in homonuclear spin systems since the qubit selective pulses are long and during this period, evolution under the Hamiltonian and decoherence cause errors. The decoherence destroys the answer as it causes the final state to evolve to mixed state and in homonuclear systems, evolution under the internal Hamiltonian causes phase errors preventing the initial state to converge to the solution state. The resolution of these issues is necessary before one can proceed to implement an adiabatic algorithm in a large system where homonuclear coupled spins will become a necessity. In the present work, we demonstrate that by using "strongly modulated pulses" (SMPs) for the creation of interpolating Hamiltonian, one can circumvent both the problems and successfully implement the adiabatic SAT algorithm in a homonuclear three qubit system. This work also demonstrates that the SMPs tremendously reduce the time taken for the implementation of the algorithm, can overcome problems associated with decoherence, and will be the modality in future implementation of quantum information processing by NMR.
Quantum adiabatic algorithm for factorization and its experimental implementation.
Peng, Xinhua; Liao, Zeyang; Xu, Nanyang; Qin, Gan; Zhou, Xianyi; Suter, Dieter; Du, Jiangfeng
2008-11-28
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in a NMR quantum information processor and experimentally factorize the number 21. In the range that our classical computer could simulate, the quantum adiabatic algorithm works well, providing evidence that the running time of this algorithm scales polynomially with the problem size. PMID:19113467
Quantum adiabatic evolution with energy degeneracy levels
NASA Astrophysics Data System (ADS)
Zhang, Qi
2016-01-01
A classical-kind phase-space formalism is developed to address the tiny intrinsic dynamical deviation from what is predicted by Wilczek-Zee theorem during quantum adiabatic evolution on degeneracy levels. In this formalism, the Hilbert space and the aggregate of degenerate eigenstates become the classical-kind phase space and a high-dimensional subspace in the phase space, respectively. Compared with the previous analogous study by a different method, the current result is qualitatively different in that the first-order deviation derived here is always perpendicular to the degeneracy subspace. A tripod-scheme Hamiltonian with two degenerate dark states is employed to illustrate the adiabatic deviation with degeneracy levels.
Adiabatic Quantum Algorithm for Search Engine Ranking
NASA Astrophysics Data System (ADS)
Garnerone, Silvano; Zanardi, Paolo; Lidar, Daniel A.
2012-06-01
We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web pages. We argue that the main topological feature of the underlying web graph allowing for such a scaling is the out-degree distribution. The top-ranked log(n) entries of the quantum PageRank state can then be estimated with a polynomial quantum speed-up. Moreover, the quantum PageRank state can be used in “q-sampling” protocols for testing properties of distributions, which require exponentially fewer measurements than all classical schemes designed for the same task. This can be used to decide whether to run a classical update of the PageRank.
Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
Wang, Hefeng; Wu, Lian-Ao
2016-01-01
An adiabatic quantum algorithm may lose quantumness such as quantum coherence entirely in its long runtime, and consequently the expected quantum speedup of the algorithm does not show up. Here we present a general ultrafast adiabatic quantum algorithm. We show that by applying a sequence of fast random or regular signals during evolution, the runtime can be reduced substantially, whereas advantages of the adiabatic algorithm remain intact. We also propose a randomized Trotter formula and show that the driving Hamiltonian and the proposed sequence of fast signals can be implemented simultaneously. We illustrate the algorithm by solving the NP-complete 3-bit exact cover problem (EC3), where NP stands for nondeterministic polynomial time, and put forward an approach to implementing the problem with trapped ions. PMID:26923834
Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem.
Wang, Hefeng; Wu, Lian-Ao
2016-01-01
An adiabatic quantum algorithm may lose quantumness such as quantum coherence entirely in its long runtime, and consequently the expected quantum speedup of the algorithm does not show up. Here we present a general ultrafast adiabatic quantum algorithm. We show that by applying a sequence of fast random or regular signals during evolution, the runtime can be reduced substantially, whereas advantages of the adiabatic algorithm remain intact. We also propose a randomized Trotter formula and show that the driving Hamiltonian and the proposed sequence of fast signals can be implemented simultaneously. We illustrate the algorithm by solving the NP-complete 3-bit exact cover problem (EC3), where NP stands for nondeterministic polynomial time, and put forward an approach to implementing the problem with trapped ions. PMID:26923834
Non Adiabatic Evolution of Elliptical Galaxies by Dynamical Friction
NASA Astrophysics Data System (ADS)
Arena, S. E.; Bertin, G.; Liseikina, T.; Pegoraro, F.
2007-05-01
Many astrophysical problems, ranging from structure formation in cosmology to dynamics of elliptical galaxies, refer to slow processes of evolution of essentially collisionless self-gravitating systems. In order to determine the relevant quasi-equilibrium configuration at time t from given initial conditions, it is often argued that such slow evolution may be approximated in terms of adiabatic evolution, for the calculation of which efficient semi--analytical techniques are available. Here we focus on the slow process of evolution, induced by dynamical friction of a host stellar system on a minority component of "satellites", to determine to what extent an adiabatic description might be applied. The study is realized by means of N--body simulations of the evolution of the total system (the stellar system plus the minority component), in a controlled numerical environment. In particular, we compare the evolution from initial to final configurations of the system subject to dynamical friction with that of the same system evolved adiabatically (in the absence of dynamical friction). We consider two classes of galaxy models characterized by significantly different density and pressure anisotropy profiles. We demonstrate that, for the examined process, the evolution driven by dynamical friction is significantly different from the adiabatic case, not only quantitatively, but also qualitatively. The two classes of galaxy models considered in this investigation exhibit generally similar trends in evolution, with one exception: concentrated models reach a final total density profile, in the internal region, shallower than the initial one, while galaxy models with a broad core show the opposite behaviour. The evolution of elliptical galaxies induced by dynamical friction is a slow process but it is not adiabatic. The results of our investigation should be taken as a warning against the indiscriminate use of adiabatic growth prescriptions in studies of the structure of
Phase avalanches in near-adiabatic evolutions
Vertesi, T.; Englman, R.
2006-02-15
In the course of slow, nearly adiabatic motion of a system, relative changes in the slowness can cause abrupt and high magnitude phase changes, ''phase avalanches,'' superimposed on the ordinary geometric phases. The generality of this effect is examined for arbitrary Hamiltonians and multicomponent (>2) wave packets and is found to be connected (through the Blaschke term in the theory of analytic signals) to amplitude zeros in the lower half of the complex time plane. Motion on a nonmaximal circle on the Poincare-sphere suppresses the effect. A spectroscopic transition experiment can independently verify the phase-avalanche magnitudes.
Entanglement and adiabatic quantum computation
NASA Astrophysics Data System (ADS)
Ahrensmeier, D.
2006-06-01
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a resource is discussed.
Necessary and sufficient condition for quantum adiabatic evolution by unitary control fields
NASA Astrophysics Data System (ADS)
Wang, Zhen-Yu; Plenio, Martin B.
2016-05-01
We decompose the quantum adiabatic evolution as the products of gauge invariant unitary operators and obtain the exact nonadiabatic correction in the adiabatic approximation. A necessary and sufficient condition that leads to adiabatic evolution with geometric phases is provided, and we determine that in the adiabatic evolution, while the eigenstates are slowly varying, the eigenenergies and degeneracy of the Hamiltonian can change rapidly. We exemplify this result by the example of the adiabatic evolution driven by parametrized pulse sequences. For driving fields that are rotating slowly with the same average energy and evolution path, fast modulation fields can have smaller nonadiabatic errors than obtained under the traditional approach with a constant amplitude.
Geometric Phase for Adiabatic Evolutions of General Quantum States
Wu, Biao; Liu, Jie; Niu, Qian; Singh, David J
2005-01-01
The concept of a geometric phase (Berry's phase) is generalized to the case of noneigenstates, which is applicable to both linear and nonlinear quantum systems. This is particularly important to nonlinear quantum systems, where, due to the lack of the superposition principle, the adiabatic evolution of a general state cannot be described in terms of eigenstates. For linear quantum systems, our new geometric phase reduces to a statistical average of Berry's phases. Our results are demonstrated with a nonlinear two-level model.
Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiability
Znidaric, Marko
2005-06-15
We numerically study the quantum adiabatic algorithm for propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows exponentially with their size. The worst case complexity of the quantum adiabatic algorithm therefore seems to be exponential.
Algorithms, games, and evolution
Chastain, Erick; Livnat, Adi; Papadimitriou, Christos; Vazirani, Umesh
2014-01-01
Even the most seasoned students of evolution, starting with Darwin himself, have occasionally expressed amazement that the mechanism of natural selection has produced the whole of Life as we see it around us. There is a computational way to articulate the same amazement: “What algorithm could possibly achieve all this in a mere three and a half billion years?” In this paper we propose an answer: We demonstrate that in the regime of weak selection, the standard equations of population genetics describing natural selection in the presence of sex become identical to those of a repeated game between genes played according to multiplicative weight updates (MWUA), an algorithm known in computer science to be surprisingly powerful and versatile. MWUA maximizes a tradeoff between cumulative performance and entropy, which suggests a new view on the maintenance of diversity in evolution. PMID:24979793
Adiabatic evolution of an irreversible two level system
Kvitsinsky, A.; Putterman, S. )
1991-05-01
The adiabatic dynamics of a two level atom with spontaneous decay is studied. The existence of a complex adiabatic phase shift is established: The real part being the usual Berry's phase. A closed-form expression for this phase and the adiabatic transition amplitudes is obtained. Incorporation of a finite preparation time for the initial state yields a new asymptotic form for the adiabatic transition amplitudes which is significantly different from the standard Landau--Zener--Dykhne formula.
Evolution of f{sub NL} to the adiabatic limit
Elliston, Joseph; Mulryne, David J.; Tavakol, Reza; Seery, David E-mail: D.Mulryne@qmul.ac.uk E-mail: R.Tavakol@qmul.ac.uk
2011-11-01
We study inflationary perturbations in multiple-field models, for which ζ typically evolves until all isocurvature modes decay — the {sup a}diabatic limit{sup .} We use numerical methods to explore the sensitivity of the local-shape bispectrum to the process by which this limit is achieved, finding an appreciable dependence on model-specific data such as the time at which slow-roll breaks down or the timescale of reheating. In models with a sum-separable potential where the isocurvature modes decay before the end of the slow-roll phase we give an analytic criterion for the asymptotic value of f{sub NL} to be large. Other examples can be constructed using a waterfall field to terminate inflation while f{sub NL} is transiently large, caused by descent from a ridge or convergence into a valley. We show that these two types of evolution are distinguished by the sign of the bispectrum, and give approximate expressions for the peak f{sub NL}.
Slow evolution of elliptical galaxies induced by dynamical friction. II. Non-adiabatic effects
NASA Astrophysics Data System (ADS)
Arena, S. E.; Bertin, G.; Liseikina, T.; Pegoraro, F.
2006-07-01
Context: .Many astrophysical problems, ranging from structure formation in cosmology to dynamics of elliptical galaxies, refer to slow processes of evolution of essentially collisionless self-gravitating systems. In order to determine the relevant quasi-equilibrium configuration at time t from given initial conditions, it is often argued that such slow evolution may be approximated in terms of adiabatic evolution, for the calculation of which efficient semi-analytical techniques are available. Aims: .Here we focus on the slow process of evolution, induced by dynamical friction of a host stellar system on a minority component of "satellites", that we have investigated in a previous paper, to determine to what extent an adiabatic description might be applied. Methods: .The study is realized by comparing directly N-body simulations of the stellar system evolution (in two significantly different models) from initial to final conditions in a controlled numerical environment. Results: .We demonstrate that for the examined process the adiabatic description is going to provide incorrect answers, not only quantitatively, but also qualitatively. The two classes of models considered exhibit generally similar trends in evolution, with one exception noted in relation to the evolution of the total density profile. Conclusions: .This simple conclusion should be taken as a warning against the indiscriminate use of adiabatic growth prescriptions in studies of structure of galaxies.
Implementation of a quantum adiabatic algorithm for factorization on two qudits
Zobov, V. E. Ermilov, A. S.
2012-06-15
Implementation of an adiabatic quantum algorithm for factorization on two qudits with the number of levels d{sub 1} and d{sub 2} is considered. A method is proposed for obtaining a time-dependent effective Hamiltonian by means of a sequence of rotation operators that are selective with respect to the transitions between neighboring levels of a qudit. A sequence of RF magnetic field pulses is obtained, and a factorization of the numbers 35, 21, and 15 is numerically simulated on two quadrupole nuclei with spins 3/2 (d{sub 1} = 4) and 1 (d{sub 2} = 3).
A general design algorithm for low optical loss adiabatic connections in waveguides.
Chen, Tong; Lee, Hansuek; Li, Jiang; Vahala, Kerry J
2012-09-24
Single-mode waveguide designs frequently support higher order transverse modes, usually as a consequence of process limitations such as lithography. In these systems, it is important to minimize coupling to higher-order modes so that the system nonetheless behaves single mode. We propose a variational approach to design adiabatic waveguide connections with minimal intermodal coupling. An application of this algorithm in designing the "S-bend" of a whispering-gallery spiral waveguide is demonstrated with approximately 0.05 dB insertion loss. Compared to other approaches, our algorithm requires less fabrication resolution and is able to minimize the transition loss over a broadband spectrum. The method can be applied to a wide range of turns and connections and has the advantage of handling connections with arbitrary boundary conditions. PMID:23037432
Effect of Strain on Microstructure Evolution of 1Cr18Ni9Ti Stainless Steel During Adiabatic Shearing
NASA Astrophysics Data System (ADS)
Yang, Y.; Jiang, L. H.; Luo, S. H.; Hu, H. B.; Tang, T. G.; Zhang, Q. M.
2016-01-01
Dynamic shear test was conducted on the hat-shaped specimen of the thermo-mechanical-processed 1Cr18Ni9Ti stainless steel by using the split Hopkinson pressure bar at ambient temperature. The effect of the shear strain on the microstructure evolution was investigated during adiabatic shearing. The results revealed that the development of adiabatic shear localization went through three stages, including the incubation period, the development stage, and the maturity period. TEM observations showed that the grains in the shear region were elongated, and the elongated grains were gradually evolved into equiaxed nano-grains of 100 nm as shear strain increased. The rotational dynamic recrystallization kinetics calculation showed that subgrains had sufficient time to generate an equiaxed microcrystalline structure by rotation within the deformation time. Based on the observation of the evolution of dislocations and sub-grains in the adiabatic shear region, a model of the microstructure evolution was established during the adiabatic shearing.
Meyers, Joel; Sivanandam, Navin
2011-05-15
We explore the superhorizon generation of large f{sub NL} of the local form in two-field inflation. We calculate the two- and three-point observables in a general class of potentials which allow for an analytic treatment using the {delta}N formalism. Motivated by the conservation of the curvature perturbation outside the horizon in the adiabatic mode and also by the observed adiabaticity of the power spectrum, we follow the evolution of f{sub NL}{sup local} until it is driven into the adiabatic solution by passing through a phase of effectively single-field inflation. We find that, although large f{sub NL}{sup local} may be generated during inflation, such nongaussianities are transitory and will be exponentially damped as the cosmological fluctuations approach adiabaticity.
NASA Astrophysics Data System (ADS)
Song, Xue-Ke; Zhang, Hao; Ai, Qing; Qiu, Jing; Deng, Fu-Guo
2016-02-01
By using transitionless quantum driving algorithm (TQDA), we present an efficient scheme for the shortcuts to the holonomic quantum computation (HQC). It works in decoherence-free subspace (DFS) and the adiabatic process can be speeded up in the shortest possible time. More interestingly, we give a physical implementation for our shortcuts to HQC with nitrogen-vacancy centers in diamonds dispersively coupled to a whispering-gallery mode microsphere cavity. It can be efficiently realized by controlling appropriately the frequencies of the external laser pulses. Also, our scheme has good scalability with more qubits. Different from previous works, we first use TQDA to realize a universal HQC in DFS, including not only two noncommuting accelerated single-qubit holonomic gates but also a accelerated two-qubit holonomic controlled-phase gate, which provides the necessary shortcuts for the complete set of gates required for universal quantum computation. Moreover, our experimentally realizable shortcuts require only two-body interactions, not four-body ones, and they work in the dispersive regime, which relax greatly the difficulty of their physical implementation in experiment. Our numerical calculations show that the present scheme is robust against decoherence with current experimental parameters.
Adiabatic invariants in stellar dynamics, 3: Application to globular cluster evolution
NASA Technical Reports Server (NTRS)
Weinberg, Martin D.
1994-01-01
The previous two companion papers demonstrate that slowly varying perturbations may not result in adiabatic cutoffs and provide a formalism for computing the long-term effects of time-dependent perturbations on stellar systems. Here, the theory is implemented in a Fokker-Planck code and a suite of runs illustrating the effects of shock heating on globular cluster evolution are described. Shock heating alone results in considerable mass loss for clusters with R(sub g) less than or approximately 8 kpc: a concentration c = 1.5 cluster with R(sub g) kpc loses up to 95% of its initial mass in 15 Gyr. Only those with concentration c greater than or approximately 1.3 survive disk shocks inside of this radius. Other effects, such as mass loss by stellar evolution, will decrease this survival bound. Loss of the initial halo together with mass segregation leads to mass spectral indices, x, which may be considerably larger than their initial values.
Generalization of the cavity method for adiabatic evolution of Gibbs states
NASA Astrophysics Data System (ADS)
Zdeborová, Lenka; Krzakala, Florent
2010-06-01
Mean-field glassy systems have a complicated energy landscape and an enormous number of different Gibbs states. In this paper, we introduce a generalization of the cavity method in order to describe the adiabatic evolution of these glassy Gibbs states as an external parameter, such as the temperature, is tuned. We give a general derivation of the method and describe in details the solution of the resulting equations for the fully connected p -spin model, the XOR-satisfiability (SAT) problem and the antiferromagnetic Potts glass (coloring problem). As direct results of the states following method we present a study of very slow Monte Carlo annealings, the demonstration of the presence of temperature chaos in these systems and the identification of an easy/hard transition for simulated annealing in constraint optimization problems. We also discuss the relation between our approach and the Franz-Parisi potential, as well as with the reconstruction problem on trees in computer science. A mapping between the states following method and the physics on the Nishimori line is also presented.
Algorithm evolution for signal understanding
Teller, A.
1996-12-31
Automated program evolution has existed in some form for over thirty years. Signal understanding (e.g., signal classification) has been a scientific concern for even longer than that. Interest in generating, through machine learning techniques, a general signal understanding system is a newer topic, but has recently attracted considerable attention. First, I have proposed to define and create a machine learning mechanism for generating signal understanding systems independent of the signal`s type and size. Second, I have proposed to do this through an evolutionary strategy that is an extension of genetic programming. Third, I have proposed to introduce a suite of sub-mechanisms that not only contribute to the power of the thesis mechanism, but are also contributions to the understanding of the learning technique developed.
Graph isomorphism and adiabatic quantum computing
NASA Astrophysics Data System (ADS)
Gaitan, Frank; Clark, Lane
2014-02-01
In the graph isomorphism (GI) problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G →G'. If yes, then G and G' are said to be isomorphic; otherwise they are nonisomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficulty to integer factorization. In this paper we present a quantum algorithm that solves arbitrary instances of GI and which also provides an approach to determining all automorphisms of a given graph. We show how the GI problem can be converted to a combinatorial optimization problem that can be solved using adiabatic quantum evolution. We numerically simulate the algorithm's quantum dynamics and show that it correctly (i) distinguishes nonisomorphic graphs; (ii) recognizes isomorphic graphs and determines the permutation(s) that connect them; and (iii) finds the automorphism group of a given graph G. We then discuss the GI quantum algorithm's experimental implementation, and close by showing how it can be leveraged to give a quantum algorithm that solves arbitrary instances of the NP-complete subgraph isomorphism problem. The computational complexity of an adiabatic quantum algorithm is largely determined by the minimum energy gap Δ (N) separating the ground and first-excited states in the limit of large problem size N ≫1. Calculating Δ (N) in this limit is a fundamental open problem in adiabatic quantum computing, and so it is not possible to determine the computational complexity of adiabatic quantum algorithms in general, nor consequently, of the specific adiabatic quantum algorithms presented here. Adiabatic quantum computing has been shown to be equivalent to the circuit model of quantum computing, and so development of adiabatic quantum algorithms continues to be of great interest.
Theoretical study of mode evolution properties in a 3×1 adiabatic tapered single-mode fiber combiner
NASA Astrophysics Data System (ADS)
Zhou, Xuanfeng; Chen, Zilun; Zhou, Hang; Hou, Jing
2015-02-01
We study the mode evolution properties in a 3 x 1 adiabatic tapered single-mode fiber combiner (ATSMFC) in theory. The fabrication of the combiner for single mode fibers based on adiabatic tapered fused bundle (TFB) technique with the assistant of low index glass capillary is introduced. The whole taper region can be seen as three phase: single-mode fibers, multi-core fiber and multi-mode fiber. Supermodes of three-core fiber with scalar mode results are derived based on coupling mode theory. The analysis is verified with numerical examples by fully vectorial finite element mode solver (Cosmol Multiphysics). Simulation results show that the three input core modes in single-mode fibers gradually evolve into three supermodes in three-core fiber and then evolve into three low-order modes in the multi-core fiber. Effective indices for different modes are calculated which can depict the evolution process vividly. The results may be useful for practical high power fiber laser systems.
Power-law scaling for the adiabatic algorithm for search-engine ranking
NASA Astrophysics Data System (ADS)
Frees, Adam; Gamble, John King; Rudinger, Kenneth; Bach, Eric; Friesen, Mark; Joynt, Robert; Coppersmith, S. N.
2013-09-01
An important method for search engine result ranking works by finding the principal eigenvector of the “Google matrix.” Recently, a quantum algorithm for generating this eigenvector as a quantum state was presented, with evidence of an exponential speedup of this process for some scale-free networks. Here we show that the run time depends on features of the graphs other than the degree distribution, and can be altered sufficiently to rule out a general exponential speedup. According to our simulations, for a sample of graphs with degree distributions that are scale-free, with parameters thought to closely resemble the Web, the proposed algorithm for eigenvector preparation does not appear to run exponentially faster than the classical case.
Power law scaling for the adiabatic algorithm for search engine ranking
NASA Astrophysics Data System (ADS)
Frees, Adam; King Gamble, John; Rudinger, Kenneth; Bach, Eric; Friesen, Mark; Joynt, Robert; Coppersmith, S. N.
2013-03-01
An important method for search engine result ranking works by finding the principal eigenvector of the ``Google matrix.'' Recently, a quantum algorithm for this problem and evidence of an exponential speedup for some scale-free networks were presented. Here, we show that the run-time depends on features of the graphs other than the degree distribution, and can be altered sufficiently to rule out a general exponential speedup. For a sample of graphs with degree distributions that more closely resemble the Web than in the previous work, the proposed algorithm does not appear to run exponentially faster than the classical one. This work was supported in part by ARO, DOD (W911NF-09-1-0439) and NSF (CCR-0635355, DMR 0906951). A.F. acknowledges support from the NSF REU program (PHY-PIF-1104660)
Fundamental mode evolution in long, large-core (>100 μm) adiabatic tapers
NASA Astrophysics Data System (ADS)
Kerttula, Juho; Filippov, Valery; Chamorovskii, Yuri; Ustimchik, Vasily; Okhotnikov, Oleg G.
2013-03-01
We have experimentally investigated fundamental mode propagation in few-meter-long adiabatic step-index tapers with high numerical aperture, core diameter up to 117μm (V=38), and tapering ratio up to 18. We confirmed single fundamental mode guiding in tapers with uniform core index profile by several experiments. We observed an annular near field distribution and degraded beam quality for large output core diameters, found to occur due to intrinsic mechanical stress in the fibers. We expect that eliminating the stress would prevent the mode deformation and allow constructing single-mode, diffraction-limited tapered large-mode-area amplifiers with a good beam shape.
Evolution of music score watermarking algorithm
NASA Astrophysics Data System (ADS)
Busch, Christoph; Nesi, Paolo; Schmucker, Martin; Spinu, Marius B.
2002-04-01
Content protection for multimedia data is widely recognized especially for data types that are frequently distributed, sold or shared using the Internet. Particularly music industry dealing with audio files realized the necessity for content protection. Distribution of music sheets will face the same problems. Digital watermarking techniques provide a certain level of protection for these music sheets. But classical raster-oriented watermarking algorithms for images suffer several drawbacks when directly applied to image representations of music sheets. Therefore new solutions have been developed which are designed regarding the content of the music sheets. In Comparison to other media types the development for watermarking of music scores is a rather young art. The paper reviews the evolution of the early approaches and describes the current state of the art in the field.
A Unified Differential Evolution Algorithm for Global Optimization
Qiang, Ji; Mitchell, Chad
2014-06-24
Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.
NASA Astrophysics Data System (ADS)
Charpinet, S.; Fontaine, G.; Brassard, P.; Dorman, Ben
2002-06-01
We present the final results of a large, systematic survey of the adiabatic oscillation properties of models of subdwarf B (sdB) stars. This survey is aimed at providing the minimal theoretical background with which to understand the asteroseismological characteristics of the recently discovered class of pulsating sdB stars (the EC 14026 objects). In this paper, the last of a series of three, we consider the effects of stellar evolution on the pulsation eigenmodes of sdB star models. We specifically analyze the adiabatic properties of 149 equilibrium models culled from seven distinct extreme horizontal branch evolutionary sequences. Those have been chosen in order to span fully the region of parameter space where real sdB stars are found. We primarily focus on the evolution of the pulsation periods (P) and the rates of period change (dP/dt), which are both a priori observable quantities. Both the acoustic and gravity branches of stellar oscillations are considered. In light of the results derived in the first two papers of this series, we discuss how the values of P and dP/dt relate to the various structural adjustments that sdB stars undergo during evolution. We find that the acoustic modes react primarily to the secular variations of the surface gravity. In contrast, we identify three main factors that regulate the period evolution of gravity modes: these are the variations brought about by evolution in both the surface gravity and the effective temperature, as well as the onset and growth of a chemical discontinuity between the C-O-enriched nucleus and the helium-rich mantle. We also find, as expected from our previous results, that the period evolution of the pulsation modes in sdB stars is further complicated by trapping effects (microtrapping in the case of p-modes) and by avoided crossings between modes. The latter occur preferentially in certain regions of parameter space. We provide our final results in the form of extensive tabular data in the appendices
Comparison of the Asynchronous Differential Evolution and JADE Minimization Algorithms
NASA Astrophysics Data System (ADS)
Zhabitsky, Mikhail
2016-02-01
Differential Evolution (DE) is an efficient evolutionary algorithm to solve global optimization problems. In this work we compare performance of the recently proposed Asynchronous Differential Evolution with Adaptive Correlation Matrix (ADEACM) to the widely used JADE algorithm, a DE variant with adaptive control parameters.
Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
NASA Astrophysics Data System (ADS)
Liu, Kunqi; Zhang, Jingmin; Liu, Gang; Kang, Lishan
Satisfiability (SAT) problem is an NP-complete problem. Based on the analysis about it, SAT problem is translated equally into an optimization problem on the minimum of objective function. A hybrid differential evolution algorithm is proposed to solve the Satisfiability problem. It makes full use of strong local search capacity of hill-climbing algorithm and strong global search capability of differential evolution algorithm, which makes up their disadvantages, improves the efficiency of algorithm and avoids the stagnation phenomenon. The experiment results show that the hybrid algorithm is efficient in solving SAT problem.
An Adaptive Unified Differential Evolution Algorithm for Global Optimization
Qiang, Ji; Mitchell, Chad
2014-11-03
In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.
Spectral evolution of gamma-rays from adiabatically expanding sources in dense clouds
NASA Technical Reports Server (NTRS)
Stephens, S. A.
1985-01-01
The excess of antiprotons (P) observed in cosmic ray was attributed to their production in supernova (SN) envelopes expanding in dense clouds. While creating P, gamma rays are also produced and these clouds would shine as gamma-ray sources. The evolution of the gamma-ray spectrum is calculated for clouds of r sub H = 10.000 and 100.000/cu cm.
Adiabatically implementing quantum gates
Sun, Jie; Lu, Songfeng Liu, Fang
2014-06-14
We show that, through the approach of quantum adiabatic evolution, all of the usual quantum gates can be implemented efficiently, yielding running time of order O(1). This may be considered as a useful alternative to the standard quantum computing approach, which involves quantum gates transforming quantum states during the computing process.
Shape Optimization of Rubber Bushing Using Differential Evolution Algorithm
2014-01-01
The objective of this study is to design rubber bushing at desired level of stiffness characteristics in order to achieve the ride quality of the vehicle. A differential evolution algorithm based approach is developed to optimize the rubber bushing through integrating a finite element code running in batch mode to compute the objective function values for each generation. Two case studies were given to illustrate the application of proposed approach. Optimum shape parameters of 2D bushing model were determined by shape optimization using differential evolution algorithm. PMID:25276848
PSEMA: An Algorithm for Pattern Stimulated Evolution of Music
NASA Astrophysics Data System (ADS)
Mavrogianni, A. N.; Vlachos, D. S.; Harvalias, G.
2008-11-01
An algorithm for pattern stimulating evolution of music is presented in this work (PSEMA). The system combines a pattern with a genetic algorithm for automatic music composition in order to create a musical phrase uniquely characterizing the pattern. As an example a musical portrait is presented. The initialization of the musical phrases is done with a Markov Chain process. The evolution is dominated by an arbitrary correspondence between the pattern (feature extraction of the pattern may be used in this step) and the esthetic result of the musical phrase.
Parallelizable adiabatic gate teleportation
NASA Astrophysics Data System (ADS)
Nakago, Kosuke; Hajdušek, Michal; Nakayama, Shojun; Murao, Mio
2015-12-01
To investigate how a temporally ordered gate sequence can be parallelized in adiabatic implementations of quantum computation, we modify adiabatic gate teleportation, a model of quantum computation proposed by Bacon and Flammia [Phys. Rev. Lett. 103, 120504 (2009), 10.1103/PhysRevLett.103.120504], to a form deterministically simulating parallelized gate teleportation, which is achievable only by postselection. We introduce a twisted Heisenberg-type interaction Hamiltonian, a Heisenberg-type spin interaction where the coordinates of the second qubit are twisted according to a unitary gate. We develop parallelizable adiabatic gate teleportation (PAGT) where a sequence of unitary gates is performed in a single step of the adiabatic process. In PAGT, numeric calculations suggest the necessary time for the adiabatic evolution implementing a sequence of L unitary gates increases at most as O (L5) . However, we show that it has the interesting property that it can map the temporal order of gates to the spatial order of interactions specified by the final Hamiltonian. Using this property, we present a controlled-PAGT scheme to manipulate the order of gates by a control qubit. In the controlled-PAGT scheme, two differently ordered sequential unitary gates F G and G F are coherently performed depending on the state of a control qubit by simultaneously applying the twisted Heisenberg-type interaction Hamiltonians implementing unitary gates F and G . We investigate why the twisted Heisenberg-type interaction Hamiltonian allows PAGT. We show that the twisted Heisenberg-type interaction Hamiltonian has an ability to perform a transposed unitary gate by just modifying the space ordering of the final Hamiltonian implementing a unitary gate in adiabatic gate teleportation. The dynamics generated by the time-reversed Hamiltonian represented by the transposed unitary gate enables deterministic simulation of a postselected event of parallelized gate teleportation in adiabatic
Number Partitioning via Quantum Adiabatic Computation
NASA Technical Reports Server (NTRS)
Smelyanskiy, Vadim N.; Toussaint, Udo; Clancy, Daniel (Technical Monitor)
2002-01-01
We study both analytically and numerically the complexity of the adiabatic quantum evolution algorithm applied to random instances of combinatorial optimization problems. We use as an example the NP-complete set partition problem and obtain an asymptotic expression for the minimal gap separating the ground and exited states of a system during the execution of the algorithm. We show that for computationally hard problem instances the size of the minimal gap scales exponentially with the problem size. This result is in qualitative agreement with the direct numerical simulation of the algorithm for small instances of the set partition problem. We describe the statistical properties of the optimization problem that are responsible for the exponential behavior of the algorithm.
Differential Evolution algorithm applied to FSW model calibration
NASA Astrophysics Data System (ADS)
Idagawa, H. S.; Santos, T. F. A.; Ramirez, A. J.
2014-03-01
Friction Stir Welding (FSW) is a solid state welding process that can be modelled using a Computational Fluid Dynamics (CFD) approach. These models use adjustable parameters to control the heat transfer and the heat input to the weld. These parameters are used to calibrate the model and they are generally determined using the conventional trial and error approach. Since this method is not very efficient, we used the Differential Evolution (DE) algorithm to successfully determine these parameters. In order to improve the success rate and to reduce the computational cost of the method, this work studied different characteristics of the DE algorithm, such as the evolution strategy, the objective function, the mutation scaling factor and the crossover rate. The DE algorithm was tested using a friction stir weld performed on a UNS S32205 Duplex Stainless Steel.
Irreconcilable difference between quantum walks and adiabatic quantum computing
NASA Astrophysics Data System (ADS)
Wong, Thomas G.; Meyer, David A.
2016-06-01
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schrödinger's equation. In the former, the Hamiltonian is fixed, while in the latter, the Hamiltonian varies with time. As a result, their formulations of Grover's algorithm evolve differently through Hilbert space. We show that this difference is fundamental; they cannot be made to evolve along each other's path without introducing structure more powerful than the standard oracle for unstructured search. For an adiabatic quantum evolution to evolve like the quantum walk search algorithm, it must interpolate between three fixed Hamiltonians, one of which is complex and introduces structure that is stronger than the oracle for unstructured search. Conversely, for a quantum walk to evolve along the path of the adiabatic search algorithm, it must be a chiral quantum walk on a weighted, directed star graph with structure that is also stronger than the oracle for unstructured search. Thus, the two techniques, although similar in being described by Hamiltonians that govern their evolution, compute by fundamentally irreconcilable means.
Kubař, Tomáš; Elstner, Marcus
2013-04-28
In this work, a fragment-orbital density functional theory-based method is combined with two different non-adiabatic schemes for the propagation of the electronic degrees of freedom. This allows us to perform unbiased simulations of electron transfer processes in complex media, and the computational scheme is applied to the transfer of a hole in solvated DNA. It turns out that the mean-field approach, where the wave function of the hole is driven into a superposition of adiabatic states, leads to over-delocalization of the hole charge. This problem is avoided using a surface hopping scheme, resulting in a smaller rate of hole transfer. The method is highly efficient due to the on-the-fly computation of the coarse-grained DFT Hamiltonian for the nucleobases, which is coupled to the environment using a QM/MM approach. The computational efficiency and partial parallel character of the methodology make it possible to simulate electron transfer in systems of relevant biochemical size on a nanosecond time scale. Since standard non-polarizable force fields are applied in the molecular-mechanics part of the calculation, a simple scaling scheme was introduced into the electrostatic potential in order to simulate the effect of electronic polarization. It is shown that electronic polarization has an important effect on the features of charge transfer. The methodology is applied to two kinds of DNA sequences, illustrating the features of transfer along a flat energy landscape as well as over an energy barrier. The performance and relative merit of the mean-field scheme and the surface hopping for this application are discussed. PMID:23493847
NASA Astrophysics Data System (ADS)
Salami, M. J. E.; Tijani, I. B.; Abdullateef, A. I.; Aibinu, M. A.
2013-12-01
A hybrid optimization algorithm using Differential Evolution (DE) and Genetic Algorithm (GA) is proposed in this study to address the problem of network parameters determination associated with the Nonlinear Autoregressive with eXogenous inputs Network (NARX-network). The proposed algorithm involves a two level optimization scheme to search for both optimal network architecture and weights. The DE at the upper level is formulated as combinatorial optimization to search for the network architecture while the associated network weights that minimize the prediction error is provided by the GA at the lower level. The performance of the algorithm is evaluated on identification of a laboratory rotary motion system. The system identification results show the effectiveness of the proposed algorithm for nonparametric model development.
NASA Astrophysics Data System (ADS)
Li, Dafa
2016-05-01
The adiabatic theorem was proposed about 90 years ago and has played an important role in quantum physics. The quantitative adiabatic condition constructed from eigenstates and eigenvalues of a Hamiltonian is a traditional tool to estimate adiabaticity and has proven to be the necessary and sufficient condition for adiabaticity. However, recently the condition has become a controversial subject. In this paper, we list some expressions to estimate the validity of the adiabatic approximation. We show that the quantitative adiabatic condition is invalid for the adiabatic approximation via the Euclidean distance between the adiabatic state and the evolution state. Furthermore, we deduce general necessary and sufficient conditions for the validity of the adiabatic approximation by different definitions.
Fast wavelet based algorithms for linear evolution equations
NASA Technical Reports Server (NTRS)
Engquist, Bjorn; Osher, Stanley; Zhong, Sifen
1992-01-01
A class was devised of fast wavelet based algorithms for linear evolution equations whose coefficients are time independent. The method draws on the work of Beylkin, Coifman, and Rokhlin which they applied to general Calderon-Zygmund type integral operators. A modification of their idea is applied to linear hyperbolic and parabolic equations, with spatially varying coefficients. A significant speedup over standard methods is obtained when applied to hyperbolic equations in one space dimension and parabolic equations in multidimensions.
Digitized adiabatic quantum computing with a superconducting circuit.
Barends, R; Shabani, A; Lamata, L; Kelly, J; Mezzacapo, A; Las Heras, U; Babbush, R; Fowler, A G; Campbell, B; Chen, Yu; Chen, Z; Chiaro, B; Dunsworth, A; Jeffrey, E; Lucero, E; Megrant, A; Mutus, J Y; Neeley, M; Neill, C; O'Malley, P J J; Quintana, C; Roushan, P; Sank, D; Vainsencher, A; Wenner, J; White, T C; Solano, E; Neven, H; Martinis, John M
2016-06-01
Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable. PMID:27279216
Digitized adiabatic quantum computing with a superconducting circuit
NASA Astrophysics Data System (ADS)
Barends, R.; Shabani, A.; Lamata, L.; Kelly, J.; Mezzacapo, A.; Heras, U. Las; Babbush, R.; Fowler, A. G.; Campbell, B.; Chen, Yu; Chen, Z.; Chiaro, B.; Dunsworth, A.; Jeffrey, E.; Lucero, E.; Megrant, A.; Mutus, J. Y.; Neeley, M.; Neill, C.; O’Malley, P. J. J.; Quintana, C.; Roushan, P.; Sank, D.; Vainsencher, A.; Wenner, J.; White, T. C.; Solano, E.; Neven, H.; Martinis, John M.
2016-06-01
Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.
Digitized adiabatic quantum computing with a superconducting circuit, part I: Theory
NASA Astrophysics Data System (ADS)
Lamata, L.; Barends, R.; Shabani, A.; Kelly, J.; Mezzacapo, A.; Las Heras, U.; Babbush, R.; Fowler, A. G.; Campbell, B.; Chen, Yu; Chen, Z.; Chiaro, B.; Dunsworth, A.; Jeffrey, E.; Lucero, E.; Megrant, A.; Mutus, J. Y.; Neeley, M.; Neill, C.; O'Malley, P. J. J.; Quintana, C.; Roushan, P.; Solano, E.; Neven, H.; Martinis, John M.
Adiabatic quantum computing (AQC) is a general-purpose optimization algorithm that in contrast to circuit-model quantum algorithms can be applied to a large set of computational problems. An analog physical realization of AQC has certain limitations that we propose can be overcome by a gate-model equivalence of the AQC. In this talk we discuss the hardware advantages of digitized AQC in particular arbitrary interactions, precision, and coherence. We could experimentally realize the principles of digitized AQC on a chain of nine qubits, and highlight the physics of adiabatic evolutions as well as the Kibble-Zurek mechanism.
Adiabatic topological quantum computing
NASA Astrophysics Data System (ADS)
Cesare, Chris; Landahl, Andrew J.; Bacon, Dave; Flammia, Steven T.; Neels, Alice
2015-07-01
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic excitations will be created that will disorder the encoded quantum information. Here, we explore this question in detail by studying adiabatic code deformations on Hamiltonians based on topological codes, notably Kitaev's surface codes and the more recently discovered color codes. We develop protocols that enable universal quantum computing by adiabatic evolution in a way that keeps the energy gap of the system constant with respect to the computation size and introduces only simple local Hamiltonian interactions. This allows one to perform holonomic quantum computing with these topological quantum computing systems. The tools we develop allow one to go beyond numerical simulations and understand these processes analytically.
Janiuk, Agnieszka; Sznajder, Maciej; Moscibrodzka, Monika; Proga, Daniel
2009-11-10
We study a slightly rotating accretion flow onto a black hole, using the fully three-dimensional (3D) numerical simulations. We consider hydrodynamics of an inviscid flow, assuming a spherically symmetric density distribution at the outer boundary and a small, latitude-dependent angular momentum. We investigate the role of the adiabatic index and gas temperature, and the flow behavior due to non-axisymmetric effects. Our 3D simulations confirm axisymmetric results: the material that has too much angular momentum to be accreted forms a thick torus near the equator, and the mass accretion rate is lower than the Bondi rate. In our previous study of the 3D accretion flows, for gamma = 5/3, we found that the inner torus precessed, even for axisymmetric conditions at large radii. The present study shows that the inner torus precesses also for other values of the adiabatic index: gamma = 4/3, 1.2, and 1.01. However, the time for the precession to set increases with decreasing gamma. In particular, for gamma = 1.01, we find that depending on the outer boundary conditions, the torus may shrink substantially due to the strong inflow of the non-rotating matter, and the precession will have insufficient time to develop. On the other hand, if the torus is supplied by the continuous inflow of the rotating material from the outer radii, its inner parts will eventually tilt and precess, as was for the larger gamma's.
An Enhanced Differential Evolution Algorithm Based on Multiple Mutation Strategies
Xiang, Wan-li; Meng, Xue-lei; An, Mei-qing; Li, Yin-zhen; Gao, Ming-xia
2015-01-01
Differential evolution algorithm is a simple yet efficient metaheuristic for global optimization over continuous spaces. However, there is a shortcoming of premature convergence in standard DE, especially in DE/best/1/bin. In order to take advantage of direction guidance information of the best individual of DE/best/1/bin and avoid getting into local trap, based on multiple mutation strategies, an enhanced differential evolution algorithm, named EDE, is proposed in this paper. In the EDE algorithm, an initialization technique, opposition-based learning initialization for improving the initial solution quality, and a new combined mutation strategy composed of DE/current/1/bin together with DE/pbest/bin/1 for the sake of accelerating standard DE and preventing DE from clustering around the global best individual, as well as a perturbation scheme for further avoiding premature convergence, are integrated. In addition, we also introduce two linear time-varying functions, which are used to decide which solution search equation is chosen at the phases of mutation and perturbation, respectively. Experimental results tested on twenty-five benchmark functions show that EDE is far better than the standard DE. In further comparisons, EDE is compared with other five state-of-the-art approaches and related results show that EDE is still superior to or at least equal to these methods on most of benchmark functions. PMID:26609304
Application of Differential Evolution Algorithm on Self-Potential Data
Li, Xiangtao; Yin, Minghao
2012-01-01
Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces, and has been successfully used to solve several kinds of problems. In this paper, differential evolution is used for quantitative interpretation of self-potential data in geophysics. Six parameters are estimated including the electrical dipole moment, the depth of the source, the distance from the origin, the polarization angle and the regional coefficients. This study considers three kinds of data from Turkey: noise-free data, contaminated synthetic data, and Field example. The differential evolution and the corresponding model parameters are constructed as regards the number of the generations. Then, we show the vibration of the parameters at the vicinity of the low misfit area. Moreover, we show how the frequency distribution of each parameter is related to the number of the DE iteration. Experimental results show the DE can be used for solving the quantitative interpretation of self-potential data efficiently compared with previous methods. PMID:23240004
An Evolution Based Biosensor Receptor DNA Sequence Generation Algorithm
Kim, Eungyeong; Lee, Malrey; Gatton, Thomas M.; Lee, Jaewan; Zang, Yupeng
2010-01-01
A biosensor is composed of a bioreceptor, an associated recognition molecule, and a signal transducer that can selectively detect target substances for analysis. DNA based biosensors utilize receptor molecules that allow hybridization with the target analyte. However, most DNA biosensor research uses oligonucleotides as the target analytes and does not address the potential problems of real samples. The identification of recognition molecules suitable for real target analyte samples is an important step towards further development of DNA biosensors. This study examines the characteristics of DNA used as bioreceptors and proposes a hybrid evolution-based DNA sequence generating algorithm, based on DNA computing, to identify suitable DNA bioreceptor recognition molecules for stable hybridization with real target substances. The Traveling Salesman Problem (TSP) approach is applied in the proposed algorithm to evaluate the safety and fitness of the generated DNA sequences. This approach improves efficiency and stability for enhanced and variable-length DNA sequence generation and allows extension to generation of variable-length DNA sequences with diverse receptor recognition requirements. PMID:22315543
Non-adiabatic perturbations in multi-component perfect fluids
Koshelev, N.A.
2011-04-01
The evolution of non-adiabatic perturbations in models with multiple coupled perfect fluids with non-adiabatic sound speed is considered. Instead of splitting the entropy perturbation into relative and intrinsic parts, we introduce a set of symmetric quantities, which also govern the non-adiabatic pressure perturbation in models with energy transfer. We write the gauge invariant equations for the variables that determine on a large scale the non-adiabatic pressure perturbation and the rate of changes of the comoving curvature perturbation. The analysis of evolution of the non-adiabatic pressure perturbation has been made for several particular models.
Quantum Adiabatic Optimization and Combinatorial Landscapes
NASA Technical Reports Server (NTRS)
Smelyanskiy, V. N.; Knysh, S.; Morris, R. D.
2003-01-01
In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.
Graph isomorphism and adiabatic quantum computing
NASA Astrophysics Data System (ADS)
Gaitan, Frank; Clark, Lane
2014-03-01
In the Graph Isomorphism (GI) problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and maps G --> G'. If yes (no), then G and G' are said to be isomorphic (non-isomorphic). The GI problem is an important problem in computer science and is thought to be of comparable difficulty to integer factorization. We present a quantum algorithm that solves arbitrary instances of GI, and which provides a novel approach to determining all automorphisms of a graph. The algorithm converts a GI instance to a combinatorial optimization problem that can be solved using adiabatic quantum evolution. Numerical simulation of the algorithm's quantum dynamics shows that it correctly distinguishes non-isomorphic graphs; recognizes isomorphic graphs; and finds the automorphism group of a graph. We also discuss the algorithm's experimental implementation and show how it can be leveraged to solve arbitrary instances of the NP-Complete Sub-Graph Isomorphism problem.
Studies in Chaotic adiabatic dynamics
Jarzynski, C.
1994-01-01
Chaotic adiabatic dynamics refers to the study of systems exhibiting chaotic evolution under slowly time-dependent equations of motion. In this dissertation the author restricts his attention to Hamiltonian chaotic adiabatic systems. The results presented are organized around a central theme, namely, that the energies of such systems evolve diffusively. He begins with a general analysis, in which he motivates and derives a Fokker-Planck equation governing this process of energy diffusion. He applies this equation to study the {open_quotes}goodness{close_quotes} of an adiabatic invariant associated with chaotic motion. This formalism is then applied to two specific examples. The first is that of a gas of noninteracting point particles inside a hard container that deforms slowly with time. Both the two- and three-dimensional cases are considered. The results are discussed in the context of the Wall Formula for one-body dissipation in nuclear physics, and it is shown that such a gas approaches, asymptotically with time, an exponential velocity distribution. The second example involves the Fermi mechanism for the acceleration of cosmic rays. Explicit evolution equations are obtained for the distribution of cosmic ray energies within this model, and the steady-state energy distribution that arises when this equation is modified to account for the injection and removal of cosmic rays is discussed. Finally, the author re-examines the multiple-time-scale approach as applied to the study of phase space evolution under a chaotic adiabatic Hamiltonian. This leads to a more rigorous derivation of the above-mentioned Fokker-Planck equation, and also to a new term which has relevance to the problem of chaotic adiabatic reaction forces (the forces acting on slow, heavy degrees of freedom due to their coupling to light, fast chaotic degrees).
Optimization of Electrical Energy Production by using Modified Differential Evolution Algorithm
NASA Astrophysics Data System (ADS)
Glotic, Arnel
The dissertation addressed the optimization of electrical energy production from hydro power plants and thermal power plants. It refers to short-term optimization and presents a complex optimization problem. The complexity of the problem arises from an extensive number of co-dependent variables and power plant constraints. According to the complexity of the problem, the differential evolution algorithm known as the successful and robust optimization algorithm was selected as an appropriate algorithm for optimization. The performance of this differential evolution algorithm is closely connected with a control parameters' set and its capabilities being inter alia improved by the algorithm's parallelization. The capabilities of achieving a global optimal solution within the optimization of electrical energy production are improved by the proposed modified differential evolution algorithm with new parallelization mode. This algorithm's performance is also improved by its proposed dynamic population size throughout the optimization process. In addition to achieving better optimization results in comparison with the classic differential evolution algorithm, the proposed dynamic population size reduces convergence time. The improvements of this algorithm presented in the dissertation, besides power plant models mostly used in scientific publications, were also tested on the power plant models represented by real parameters'. The optimization of electrical energy from hydro and thermal power plants is followed by certain criteria; satisfying system demand, minimizing usage of water quantity per produced electrical energy unit, minimizing or eliminating water spillage, satisfying the final reservoir states of hydro power plants and minimizing fuel costs and emissions of thermal power plants.
Adiabaticity in open quantum systems
NASA Astrophysics Data System (ADS)
Venuti, Lorenzo Campos; Albash, Tameem; Lidar, Daniel A.; Zanardi, Paolo
2016-03-01
We provide a rigorous generalization of the quantum adiabatic theorem for open systems described by a Markovian master equation with time-dependent Liouvillian L (t ) . We focus on the finite system case relevant for adiabatic quantum computing and quantum annealing. Adiabaticity is defined in terms of closeness to the instantaneous steady state. While the general result is conceptually similar to the closed-system case, there are important differences. Namely, a system initialized in the zero-eigenvalue eigenspace of L (t ) will remain in this eigenspace with a deviation that is inversely proportional to the total evolution time T . In the case of a finite number of level crossings, the scaling becomes T-η with an exponent η that we relate to the rate of the gap closing. For master equations that describe relaxation to thermal equilibrium, we show that the evolution time T should be long compared to the corresponding minimum inverse gap squared of L (t ) . Our results are illustrated with several examples.
A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
Shi, Yonggang; Karl, William Clem
2010-01-01
In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular, we propose a two-cycle algorithm to approximate level-set-based curve evolution without the need of solving partial differential equations (PDEs). Our algorithm is applicable to a broad class of evolution speeds that can be viewed as composed of a data-dependent term and a curve smoothness regularization term. We achieve curve evolution corresponding to such evolution speeds by separating the evolution process into two different cycles: one cycle for the data-dependent term and a second cycle for the smoothness regularization. The smoothing term is derived from a Gaussian filtering process. In both cycles, the evolution is realized through a simple element switching mechanism between two linked lists, that implicitly represents the curve using an integer valued level-set function. By careful construction, all the key evolution steps require only integer operations. A consequence is that we obtain significant computation speedups compared to exact PDE-based approaches while obtaining excellent agreement with these methods for problems of practical engineering interest. In particular, the resulting algorithm is fast enough for use in real-time video processing applications, which we demonstrate through several image segmentation and video tracking experiments. PMID:18390371
NASA Astrophysics Data System (ADS)
Mingolo, Nusharin; Sarakorn, Weerachai
2016-04-01
In this research, the Modified Differential Evolution (DE) algorithm is proposed and applied to the Magnetotelluric (MT) and Vertical Electrical sounding (VES) data to reveal the reasonable resistivity structure. The common processes of DE algorithm, including initialization, mutation and crossover, are modified by introducing both new control parameters and some constraints to obtain the fitting-reasonable resistivity model. The validity and efficiency of our developed modified DE algorithm is tested on both synthetic and real observed data. Our developed DE algorithm is also compared to the well-known OCCAM's algorithm for real case of MT data. For the synthetic case, our modified DE algorithm with appropriate control parameters can reveal the reasonable-fitting models when compared to the original synthetic models. For the real data case, the resistivity structures revealed by our algorithm are closed to those obtained by OCCAM's inversion, but our obtained structures reveal layers more apparently.
NASA Astrophysics Data System (ADS)
Mandrà, Salvatore; Guerreschi, Gian Giacomo; Aspuru-Guzik, Alán
2015-12-01
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the minimum energy gap encountered during the dynamics. Unfortunately, the direct calculation of the gap is strongly limited by the exponential growth in the dimensionality of the Hilbert space associated to the quantum system. Although many special-purpose methods have been devised to reduce the effective dimensionality, they are strongly limited to particular classes of problems with evident symmetries. Moreover, little is known about the computational power of adiabatic quantum optimizers in real-world conditions. Here we propose and implement a general purposes reduction method that does not rely on any explicit symmetry and which requires, under certain general conditions, only a polynomial amount of classical resources. Thanks to this method, we are able to analyze the performance of "nonideal" quantum adiabatic optimizers to solve the well-known Grover problem, namely the search of target entries in an unsorted database, in the presence of discrete local defects. In this case, we show that adiabatic quantum optimization, even if affected by random noise, is still potentially faster than any classical algorithm.
The Structure of Evolution LOCBURST: The BATSE Burst Location Algorithm
NASA Technical Reports Server (NTRS)
Pendleton, Geoffrey N.; Briggs, Michael S.; Kippen, R. March; Paciesas, William S.; Stollberg, Mark; Woods, Pete; Meegan, C. A.; Fishman, G. J.; McCollough, M. L.; Connaughton, V.
1998-01-01
The gamma-ray bursts (GRB) location algorithm used to produce the BATSE GRB locations is described. The general flow of control of the current location algorithm is presented and the significant properties of the various physical inputs required are identified. The development of the burst location algorithm during the releases of the BATSE 1B, 2B, and 3B gamma-ray burst catalogs is presented so that the reasons for the differences in the positions and error estimates between the catalogs can be understood. In particular, differences between the 2B and 3B locations are discussed for events that have moved significantly and the reasons for the changes explained. The locations of bursts located independently by the interplanetary network are used to illustrate the effect on burst location accuracy of various components of the algorithm. IPN data as well as locations from other gamma-ray instruments are used to calculate estimates of the systematic errors on BATSE burst locations.
Wireless adiabatic power transfer
Rangelov, A.A.; Suchowski, H.; Silberberg, Y.; Vitanov, N.V.
2011-03-15
Research Highlights: > Efficient and robust mid-range wireless energy transfer between two coils. > The adiabatic energy transfer is analogous to adiabatic passage in quantum optics. > Wireless energy transfer is insensitive to any resonant constraints. > Wireless energy transfer is insensitive to noise in the neighborhood of the coils. - Abstract: We propose a technique for efficient mid-range wireless power transfer between two coils, by adapting the process of adiabatic passage for a coherently driven two-state quantum system to the realm of wireless energy transfer. The proposed technique is shown to be robust to noise, resonant constraints, and other interferences that exist in the neighborhood of the coils.
A Modified Differential Evolution Algorithm with Cauchy Mutation for Global Optimization
NASA Astrophysics Data System (ADS)
Ali, Musrrat; Pant, Millie; Singh, Ved Pal
Differential Evolution (DE) is a powerful yet simple evolutionary algorithm for optimization of real valued, multi modal functions. DE is generally considered as a reliable, accurate and robust optimization technique. However, the algorithm suffers from premature convergence, slow convergence rate and large computational time for optimizing the computationally expensive objective functions. Therefore, an attempt to speed up DE is considered necessary. This research introduces a modified differential evolution (MDE), a modification to DE that enhances the convergence rate without compromising with the solution quality. In Modified differential evolution (MDE) algorithm, if an individual fails in continuation to improve its performance to a specified number of times then new point is generated using Cauchy mutation. MDE on a test bed of functions is compared with original DE. It is found that MDE requires less computational effort to locate global optimal solution.
Adiabatically driven Brownian pumps.
Rozenbaum, Viktor M; Makhnovskii, Yurii A; Shapochkina, Irina V; Sheu, Sheh-Yi; Yang, Dah-Yen; Lin, Sheng Hsien
2013-07-01
We investigate a Brownian pump which, being powered by a flashing ratchet mechanism, produces net particle transport through a membrane. The extension of the Parrondo's approach developed for reversible Brownian motors [Parrondo, Phys. Rev. E 57, 7297 (1998)] to adiabatically driven pumps is given. We demonstrate that the pumping mechanism becomes especially efficient when the time variation of the potential occurs adiabatically fast or adiabatically slow, in perfect analogy with adiabatically driven Brownian motors which exhibit high efficiency [Rozenbaum et al., Phys. Rev. E 85, 041116 (2012)]. At the same time, the efficiency of the pumping mechanism is shown to be less than that of Brownian motors due to fluctuations of the number of particles in the membrane. PMID:23944411
Experiences and evolutions of the ALICE DAQ Detector Algorithms framework
NASA Astrophysics Data System (ADS)
Chapeland, Sylvain; Carena, Franco; Carena, Wisla; Chibante Barroso, Vasco; Costa, Filippo; Denes, Ervin; Divia, Roberto; Fuchs, Ulrich; Grigore, Alexandru; Simonetti, Giuseppe; Soos, Csaba; Telesca, Adriana; Vande Vyvre, Pierre; von Haller, Barthelemy
2012-12-01
ALICE (A Large Ion Collider Experiment) is the heavy-ion detector studying the physics of strongly interacting matter and the quark-gluon plasma at the CERN LHC (Large Hadron Collider). The 18 ALICE sub-detectors are regularly calibrated in order to achieve most accurate physics measurements. Some of these procedures are done online in the DAQ (Data Acquisition System) so that calibration results can be directly used for detector electronics configuration before physics data taking, at run time for online event monitoring, and offline for data analysis. A framework was designed to collect statistics and compute calibration parameters, and has been used in production since 2008. This paper focuses on the recent features developed to benefit from the multi-cores architecture of CPUs, and to optimize the processing power available for the calibration tasks. It involves some C++ base classes to effectively implement detector specific code, with independent processing of events in parallel threads and aggregation of partial results. The Detector Algorithm (DA) framework provides utility interfaces for handling of input and output (configuration, monitored physics data, results, logging), and self-documentation of the produced executable. New algorithms are created quickly by inheritance of base functionality and implementation of few ad-hoc virtual members, while the framework features are kept expandable thanks to the isolation of the detector calibration code. The DA control system also handles unexpected processes behaviour, logs execution status, and collects performance statistics.
The stochastic evolution of a protocell: the Gillespie algorithm in a dynamically varying volume.
Carletti, T; Filisetti, A
2012-01-01
We propose an improvement of the Gillespie algorithm allowing us to study the time evolution of an ensemble of chemical reactions occurring in a varying volume, whose growth is directly related to the amount of some specific molecules, belonging to the reactions set. This allows us to study the stochastic evolution of a protocell, whose volume increases because of the production of container molecules. Several protocell models are considered and compared with the deterministic models. PMID:22536297
Quantum Monte Carlo simulations of tunneling in quantum adiabatic optimization
NASA Astrophysics Data System (ADS)
Brady, Lucas T.; van Dam, Wim
2016-03-01
We explore to what extent path-integral quantum Monte Carlo methods can efficiently simulate quantum adiabatic optimization algorithms during a quantum tunneling process. Specifically we look at symmetric cost functions defined over n bits with a single potential barrier that a successful quantum adiabatic optimization algorithm will have to tunnel through. The height and width of this barrier depend on n , and by tuning these dependencies, we can make the optimization algorithm succeed or fail in polynomial time. In this article we compare the strength of quantum adiabatic tunneling with that of path-integral quantum Monte Carlo methods. We find numerical evidence that quantum Monte Carlo algorithms will succeed in the same regimes where quantum adiabatic optimization succeeds.
EDGA: A Population Evolution Direction-Guided Genetic Algorithm for Protein-Ligand Docking.
Guan, Boxin; Zhang, Changsheng; Ning, Jiaxu
2016-07-01
Protein-ligand docking can be formulated as a search algorithm associated with an accurate scoring function. However, most current search algorithms cannot show good performance in docking problems, especially for highly flexible docking. To overcome this drawback, this article presents a novel and robust optimization algorithm (EDGA) based on the Lamarckian genetic algorithm (LGA) for solving flexible protein-ligand docking problems. This method applies a population evolution direction-guided model of genetics, in which search direction evolves to the optimum solution. The method is more efficient to find the lowest energy of protein-ligand docking. We consider four search methods-a tradition genetic algorithm, LGA, SODOCK, and EDGA-and compare their performance in docking of six protein-ligand docking problems. The results show that EDGA is the most stable, reliable, and successful. PMID:26895461
Chain Copolymerization Reactions: An Algorithm to Predict the Reaction Evolution with Conversion
ERIC Educational Resources Information Center
Gallardo, Alberto; Aguilar, Maria Rosa; Abraham, Gustavo A.; Roman, Julio San
2004-01-01
An algorithm is developed to study and understand the behavior of chain copolymerization reactions. When a binary copolymerization reaction follows the terminal model, Conversion is able to predict the evolution of different parameters, such as instantaneous and cumulative copolymer molar fractions, or molar fractions of any sequence with the…
Reentry trajectories and their optimization by an evolution algorithm
NASA Astrophysics Data System (ADS)
Bade, A.; Voegt, S.; Axmann, J. K.; Rex, D.
The descent of a winged space vehicle from an orbit and the following re-entry into denser atmospheric layers is a rather complex physical process. To get insight into some of the fundamental phenomena, as a first step, the re-entry of simple shaped bodies has to be simulated. In order to improve the understanding of the physics, in this paper, a stepwise approach is presented: re-entry of balls, of capsules and of winged vehicles. For the re-entry of winged space vehicles, the equations of motion are not formulated in Keplerian elements but in earth-oriented coordinate systems, with the help of spherical polar coordinates in the most general form. They include thrust and aerodynamic forces (in three components). The atmosphere is regarded as fixed with the rotating oblate earth. This set of differential equations is solved by numerical integration. The influence of the angle of attack and of the bank angle upon the re-entry trajectory is discussed, also with respect to constraints (e.g., surface temperature). In all practical applications, various optimization problems arise, e.g. if for a required lateral range the heat load for the vehicle has to be minimized. The Institute of Space Technology and Reactor Technology has developed a method based on the evolution strategy, which will shortly be described here. Optimal re-entry trajectories for a preliminary configuration similar to HORUS are presented.
A New Differential Evolution Algorithm and Its Application to Real Life Problems
NASA Astrophysics Data System (ADS)
Pant, Millie; Ali, Musrrat; Singh, V. P.
2009-07-01
Most of the real life problems occurring in various disciplines of science and engineering can be modeled as optimization problems. Also, most of these problems are nonlinear in nature which requires a suitable and efficient optimization algorithm to reach to an optimum value. In the past few years various algorithms has been proposed to deal with nonlinear optimization problems. Differential Evolution (DE) is a stochastic, population based search technique, which can be classified as an Evolutionary Algorithm (EA) using the concepts of selection crossover and reproduction to guide the search. It has emerged as a powerful tool for solving optimization problems in the past few years. However, the convergence rate of DE still does not meet all the requirements, and attempts to speed up differential evolution are considered necessary. In order to improve the performance of DE, we propose a modified DE algorithm called DEPCX which uses parent centric approach to manipulate the solution vectors. The performance of DEPCX is validated on a test bed of five benchmark functions and five real life engineering design problems. Numerical results are compared with original differential evolution (DE) and with TDE, another recently modified version of DE. Empirical analysis of the results clearly indicates the competence and efficiency of the proposed DEPCX algorithm for solving benchmark as well as real life problems with a good convergence rate.
Anderson localization makes adiabatic quantum optimization fail
Altshuler, Boris; Krovi, Hari; Roland, Jérémie
2010-01-01
Understanding NP-complete problems is a central topic in computer science (NP stands for nondeterministic polynomial time). This is why adiabatic quantum optimization has attracted so much attention, as it provided a new approach to tackle NP-complete problems using a quantum computer. The efficiency of this approach is limited by small spectral gaps between the ground and excited states of the quantum computer’s Hamiltonian. We show that the statistics of the gaps can be analyzed in a novel way, borrowed from the study of quantum disordered systems in statistical mechanics. It turns out that due to a phenomenon similar to Anderson localization, exponentially small gaps appear close to the end of the adiabatic algorithm for large random instances of NP-complete problems. This implies that unfortunately, adiabatic quantum optimization fails: The system gets trapped in one of the numerous local minima. PMID:20616043
Adiabatic cooling of antiprotons.
Gabrielse, G; Kolthammer, W S; McConnell, R; Richerme, P; Kalra, R; Novitski, E; Grzonka, D; Oelert, W; Sefzick, T; Zielinski, M; Fitzakerley, D; George, M C; Hessels, E A; Storry, C H; Weel, M; Müllers, A; Walz, J
2011-02-18
Adiabatic cooling is shown to be a simple and effective method to cool many charged particles in a trap to very low temperatures. Up to 3×10(6) p are cooled to 3.5 K-10(3) times more cold p and a 3 times lower p temperature than previously reported. A second cooling method cools p plasmas via the synchrotron radiation of embedded e(-) (with many fewer e(-) than p in preparation for adiabatic cooling. No p are lost during either process-a significant advantage for rare particles. PMID:21405511
Adiabatic Cooling of Antiprotons
Gabrielse, G.; Kolthammer, W. S.; McConnell, R.; Richerme, P.; Kalra, R.; Novitski, E.; Oelert, W.; Grzonka, D.; Sefzick, T.; Zielinski, M.; Fitzakerley, D.; George, M. C.; Hessels, E. A.; Storry, C. H.; Weel, M.; Muellers, A.; Walz, J.
2011-02-18
Adiabatic cooling is shown to be a simple and effective method to cool many charged particles in a trap to very low temperatures. Up to 3x10{sup 6} p are cooled to 3.5 K--10{sup 3} times more cold p and a 3 times lower p temperature than previously reported. A second cooling method cools p plasmas via the synchrotron radiation of embedded e{sup -} (with many fewer e{sup -} than p) in preparation for adiabatic cooling. No p are lost during either process--a significant advantage for rare particles.
Adiabatic and isocurvature perturbation projections in multi-field inflation
NASA Astrophysics Data System (ADS)
Gordon, Chris; Saffin, Paul M.
2013-08-01
Current data are in good agreement with the predictions of single field inflation. However, the hemispherical asymmetry, seen in the cosmic microwave background data, may hint at a potential problem. Generalizing to multi-field models may provide one possible explanation. A useful way of modeling perturbations in multi-field inflation is to investigate the projection of the perturbation along and perpendicular to the background fields' trajectory. These correspond to the adiabatic and isocurvature perturbations. However, it is important to note that in general there are no corresponding adiabatic and isocurvature fields. The purpose of this article is to highlight the distinction between a field redefinition and a perturbation projection. We provide a detailed derivation of the evolution of the isocurvature perturbation to show that no assumption of an adiabatic or isocurvature field is needed. We also show how this evolution equation is consistent with the field covariant evolution equations for the adiabatic perturbation in the flat field space limit.
NASA Astrophysics Data System (ADS)
Zhang, Yanjun; Yu, Chunjuan; Fu, Xinghu; Liu, Wenzhe; Bi, Weihong
2015-12-01
In the distributed optical fiber sensing system based on Brillouin scattering, strain and temperature are the main measuring parameters which can be obtained by analyzing the Brillouin center frequency shift. The novel algorithm which combines the cuckoo search algorithm (CS) with the improved differential evolution (IDE) algorithm is proposed for the Brillouin scattering parameter estimation. The CS-IDE algorithm is compared with CS algorithm and analyzed in different situation. The results show that both the CS and CS-IDE algorithm have very good convergence. The analysis reveals that the CS-IDE algorithm can extract the scattering spectrum features with different linear weight ratio, linewidth combination and SNR. Moreover, the BOTDR temperature measuring system based on electron optical frequency shift is set up to verify the effectiveness of the CS-IDE algorithm. Experimental results show that there is a good linear relationship between the Brillouin center frequency shift and temperature changes.
Culbreath, Karissa; Ager, Edward; Nemeyer, Ronald J.; Kerr, Alan
2012-01-01
We present the evolution of testing algorithms at our institution in which the C. Diff Quik Chek Complete immunochromatographic cartridge assay determines the presence of both glutamate dehydrogenase and Clostridium difficile toxins A and B as a primary screen for C. difficile infection and indeterminate results (glutamate dehydrogenase positive, toxin A and B negative) are confirmed by the GeneXpert C. difficile PCR assay. This two-step algorithm is a cost-effective method for highly sensitive detection of toxigenic C. difficile. PMID:22718938
Evolution of domain wall networks: The Press-Ryden-Spergel algorithm
Sousa, L.; Avelino, P. P.
2010-04-15
The Press-Ryden-Spergel (PRS) algorithm is a modification to the field theory equations of motion, parametrized by two parameters ({alpha} and {beta}), implemented in numerical simulations of cosmological domain wall networks, in order to ensure a fixed comoving resolution. In this paper we explicitly demonstrate that the PRS algorithm provides the correct domain wall dynamics in (N+1)-dimensional Friedmann-Robertson-Walker universes if {alpha}+{beta}/2=N, fully validating its use in numerical studies of cosmic domain evolution. We further show that this result is valid for generic thin featureless domain walls, independently of the Lagrangian of the model.
Adiabatic Quantum Programming: Minor Embedding With Hard Faults
Klymko, Christine F; Sullivan, Blair D; Humble, Travis S
2013-01-01
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.
Adiabatic quantum programming: minor embedding with hard faults
NASA Astrophysics Data System (ADS)
Klymko, Christine; Sullivan, Blair D.; Humble, Travis S.
2013-11-01
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. These methods extend with fabric growth while scaling linearly in time and quadratically in footprint. We also provide methods for handling hard faults in the logical fabric without invoking approximations to the original problem and illustrate their versatility through numerical studies of embeddability versus fault rates in square lattices of complete bipartite unit cells. The studies show that these algorithms are more resilient to faulty fabrics than naive embedding approaches, a feature which should prove useful in benchmarking the adiabatic quantum optimization algorithm on existing faulty hardware.
An integrated programming and development environment for adiabatic quantum optimization
NASA Astrophysics Data System (ADS)
Humble, T. S.; McCaskey, A. J.; Bennink, R. S.; Billings, J. J.; DʼAzevedo, E. F.; Sullivan, B. D.; Klymko, C. F.; Seddiqi, H.
2014-01-01
Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised challenging questions about how to evaluate adiabatic quantum optimization (AQO) programs. Processor behavior depends on multiple steps to synthesize an adiabatic quantum program, which are each highly tunable. We present an integrated programming and development environment for AQO called Jade Adiabatic Development Environment (JADE) that provides control over all the steps taken during program synthesis. JADE captures the workflow needed to rigorously specify the AQO algorithm while allowing a variety of problem types, programming techniques, and processor configurations. We have also integrated JADE with a quantum simulation engine that enables program profiling using numerical calculation. The computational engine supports plug-ins for simulation methodologies tailored to various metrics and computing resources. We present the design, integration, and deployment of JADE and discuss its potential use for benchmarking AQO programs by the quantum computer science community.
Shortcut to adiabatic gate teleportation
NASA Astrophysics Data System (ADS)
Santos, Alan C.; Silva, Raphael D.; Sarandy, Marcelo S.
2016-01-01
We introduce a shortcut to the adiabatic gate teleportation model of quantum computation. More specifically, we determine fast local counterdiabatic Hamiltonians able to implement teleportation as a universal computational primitive. In this scenario, we provide the counterdiabatic driving for arbitrary n -qubit gates, which allows to achieve universality through a variety of gate sets. Remarkably, our approach maps the superadiabatic Hamiltonian HSA for an arbitrary n -qubit gate teleportation into the implementation of a rotated superadiabatic dynamics of an n -qubit state teleportation. This result is rather general, with the speed of the evolution only dictated by the quantum speed limit. In particular, we analyze the energetic cost for different Hamiltonian interpolations in the context of the energy-time complementarity.
Comment on ``Adiabatic quantum computation with a one-dimensional projector Hamiltonian''
NASA Astrophysics Data System (ADS)
Kay, Alastair
2013-10-01
The partial adiabatic search algorithm was introduced in Tulsi's paper [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.80.052328 80, 052328 (2009)] as a modification of the usual adiabatic algorithm for a quantum search with the idea that most of the interesting computation only happens over a very short range of the adiabatic path. By focusing on that restricted range, one can potentially gain an advantage by reducing the control requirements on the system, enabling a uniform rate of evolution. In this Comment, we point out an oversight in Tulsi's paper [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.80.052328 80, 052328 (2009)] that invalidates its proof. However, the argument can be corrected, and the calculations in Tulsi's paper [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.80.052328 80, 052328 (2009)] are then sufficient to show that the scheme still works. Nevertheless, subsequent works [Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.82.034304 82, 034304 (2010), Chin. Phys. BCPBHAJ1674-105610.1088/1674-1056/20/4/040309 20, 040309 (2011), Chin. Phys. BCPBHAJ1674-105610.1088/1674-1056/21/1/010306 21, 010306 (2012), AASRI Procedia 1, 5862 (2012), and Quantum Inf. Process.10.1007/s11128-013-0557-1 12, 2689 (2013)] cannot all be recovered in the same way.
Adiabatic Quantum Simulation of Quantum Chemistry
Babbush, Ryan; Love, Peter J.; Aspuru-Guzik, Alán
2014-01-01
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions. PMID:25308187
Li, Xiaofang; Xu, Lizhong; Wang, Huibin; Song, Jie; Yang, Simon X
2010-01-01
The traditional Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol is a clustering-based protocol. The uneven selection of cluster heads results in premature death of cluster heads and premature blind nodes inside the clusters, thus reducing the overall lifetime of the network. With a full consideration of information on energy and distance distribution of neighboring nodes inside the clusters, this paper proposes a new routing algorithm based on differential evolution (DE) to improve the LEACH routing protocol. To meet the requirements of monitoring applications in outdoor environments such as the meteorological, hydrological and wetland ecological environments, the proposed algorithm uses the simple and fast search features of DE to optimize the multi-objective selection of cluster heads and prevent blind nodes for improved energy efficiency and system stability. Simulation results show that the proposed new LEACH routing algorithm has better performance, effectively extends the working lifetime of the system, and improves the quality of the wireless sensor networks. PMID:22219670
The knowledge instinct, cognitive algorithms, modeling of language and cultural evolution
NASA Astrophysics Data System (ADS)
Perlovsky, Leonid I.
2008-04-01
The talk discusses mechanisms of the mind and their engineering applications. The past attempts at designing "intelligent systems" encountered mathematical difficulties related to algorithmic complexity. The culprit turned out to be logic, which in one way or another was used not only in logic rule systems, but also in statistical, neural, and fuzzy systems. Algorithmic complexity is related to Godel's theory, a most fundamental mathematical result. These difficulties were overcome by replacing logic with a dynamic process "from vague to crisp," dynamic logic. It leads to algorithms overcoming combinatorial complexity, and resulting in orders of magnitude improvement in classical problems of detection, tracking, fusion, and prediction in noise. I present engineering applications to pattern recognition, detection, tracking, fusion, financial predictions, and Internet search engines. Mathematical and engineering efficiency of dynamic logic can also be understood as cognitive algorithm, which describes fundamental property of the mind, the knowledge instinct responsible for all our higher cognitive functions: concepts, perception, cognition, instincts, imaginations, intuitions, emotions, including emotions of the beautiful. I present our latest results in modeling evolution of languages and cultures, their interactions in these processes, and role of music in cultural evolution. Experimental data is presented that support the theory. Future directions are outlined.
An implementation of differential evolution algorithm for inversion of geoelectrical data
NASA Astrophysics Data System (ADS)
Balkaya, Çağlayan
2013-11-01
Differential evolution (DE), a population-based evolutionary algorithm (EA) has been implemented to invert self-potential (SP) and vertical electrical sounding (VES) data sets. The algorithm uses three operators including mutation, crossover and selection similar to genetic algorithm (GA). Mutation is the most important operator for the success of DE. Three commonly used mutation strategies including DE/best/1 (strategy 1), DE/rand/1 (strategy 2) and DE/rand-to-best/1 (strategy 3) were applied together with a binomial type crossover. Evolution cycle of DE was realized without boundary constraints. For the test studies performed with SP data, in addition to both noise-free and noisy synthetic data sets two field data sets observed over the sulfide ore body in the Malachite mine (Colorado) and over the ore bodies in the Neem-Ka Thana cooper belt (India) were considered. VES test studies were carried out using synthetically produced resistivity data representing a three-layered earth model and a field data set example from Gökçeada (Turkey), which displays a seawater infiltration problem. Mutation strategies mentioned above were also extensively tested on both synthetic and field data sets in consideration. Of these, strategy 1 was found to be the most effective strategy for the parameter estimation by providing less computational cost together with a good accuracy. The solutions obtained by DE for the synthetic cases of SP were quite consistent with particle swarm optimization (PSO) which is a more widely used population-based optimization algorithm than DE in geophysics. Estimated parameters of SP and VES data were also compared with those obtained from Metropolis-Hastings (M-H) sampling algorithm based on simulated annealing (SA) without cooling to clarify uncertainties in the solutions. Comparison to the M-H algorithm shows that DE performs a fast approximate posterior sampling for the case of low-dimensional inverse geophysical problems.
Random matrix model of adiabatic quantum computing
Mitchell, David R.; Adami, Christoph; Lue, Waynn; Williams, Colin P.
2005-05-15
We present an analysis of the quantum adiabatic algorithm for solving hard instances of 3-SAT (an NP-complete problem) in terms of random matrix theory (RMT). We determine the global regularity of the spectral fluctuations of the instantaneous Hamiltonians encountered during the interpolation between the starting Hamiltonians and the ones whose ground states encode the solutions to the computational problems of interest. At each interpolation point, we quantify the degree of regularity of the average spectral distribution via its Brody parameter, a measure that distinguishes regular (i.e., Poissonian) from chaotic (i.e., Wigner-type) distributions of normalized nearest-neighbor spacings. We find that for hard problem instances - i.e., those having a critical ratio of clauses to variables - the spectral fluctuations typically become irregular across a contiguous region of the interpolation parameter, while the spectrum is regular for easy instances. Within the hard region, RMT may be applied to obtain a mathematical model of the probability of avoided level crossings and concomitant failure rate of the adiabatic algorithm due to nonadiabatic Landau-Zener-type transitions. Our model predicts that if the interpolation is performed at a uniform rate, the average failure rate of the quantum adiabatic algorithm, when averaged over hard problem instances, scales exponentially with increasing problem size.
Shortcuts to adiabaticity for non-Hermitian systems
Ibanez, S.; Martinez-Garaot, S.; Torrontegui, E.; Muga, J. G.; Chen Xi
2011-08-15
Adiabatic processes driven by non-Hermitian, time-dependent Hamiltonians may be sped up by generalizing inverse engineering techniques based on counter-diabatic (transitionless driving) algorithms or on dynamical invariants. We work out the basic theory and examples described by two-level Hamiltonians: the acceleration of rapid adiabatic passage with a decaying excited level and of the dynamics of a classical particle on an expanding harmonic oscillator.
Dephasing effects on stimulated Raman adiabatic passage in tripod configurations
Lazarou, C.; Vitanov, N. V.
2010-09-15
We present an analytic description of the effects of dephasing processes on stimulated Raman adiabatic passage in a tripod quantum system. To this end, we develop an effective two-level model. Our analysis makes use of the adiabatic approximation in the weak dephasing regime. An effective master equation for a two-level system formed by two dark states is derived, where analytic solutions are obtained by utilizing the Demkov-Kunike model. From these, it is found that the fidelity for the final coherent superposition state decreases exponentially for increasing dephasing rates. Depending on the pulse ordering and for adiabatic evolution, the pulse delay can have an inverse effect.
Adiabatic condition and the quantum hitting time of Markov chains
Krovi, Hari; Ozols, Maris; Roland, Jeremie
2010-08-15
We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) P on a graph with a set of unknown marked vertices, one can define a related absorbing walk P{sup '} where outgoing transitions from marked vertices are replaced by self-loops. We build a Hamiltonian H(s) from the interpolated Markov chain P(s)=(1-s)P+sP{sup '} and use it in an adiabatic quantum algorithm to drive an initial superposition over all vertices to a superposition over marked vertices. The adiabatic condition implies that, for any reversible Markov chain and any set of marked vertices, the running time of the adiabatic algorithm is given by the square root of the classical hitting time. This algorithm therefore demonstrates a novel connection between the adiabatic condition and the classical notion of hitting time of a random walk. It also significantly extends the scope of previous quantum algorithms for this problem, which could only obtain a full quadratic speedup for state-transitive reversible Markov chains with a unique marked vertex.
Best band selection of hyperspectral remote sensing image based on differential evolution algorithm
NASA Astrophysics Data System (ADS)
Cai, Z.; Li, Z.; Jiang, A.; Chen, X.
2010-12-01
The hyperspectral remote sensing makes use of spectrum resolution with the nano-scale collecting image data simultaneously in dozens or hundreds of narrow and adjacent spectral bands above the earth's surface. These hyperspectral remote sensors make it possible to derive a continuous spectrum line for each image pixel (or a special sort of material). It can acquire space information, radiated information and spectrum information of images synchronously, so that it has remarkable application value and extensive development prospect in many related fields. However, the hyperspectral remote sensing images' characteristics, such as hundreds of bands, high spectral resolution and large volumes of data, have induced many problems such as high ratio of redundant information, large-scale storage space query, long processing delay, the Hughes phenomenon and so on. The main approach to solve these problems is making dimensional reduction before the classification or visual interpretation with the hyperspectral image data. There are two main methods for dimensional reduction: feature abstraction and bands selection. Although the feature abstraction that can achieve the purpose of dimensional reduction, in the process of feature abstraction or non-linear changes in both linear transformation, it will cause the loss of the physical implication of the original image data and also make it hard to apply hyperspectral images to visual interpretation. In contrast, band selection method outperforms in terms of being more universal for application. The selected bands can not only be used as attributes (features) for classification but also synthesize RGB false color image for visual interpretation. Therefore, band selection of hyperspectral remote sensing images is an important dimensional reduction method. Here, we design a hyperspectral remote sensing image band selection algorithm based on differential evolution algorithm. Differential evolution is an evolutionary method based on
odNEAT: An Algorithm for Decentralised Online Evolution of Robotic Controllers.
Silva, Fernando; Urbano, Paulo; Correia, Luís; Christensen, Anders Lyhne
2015-01-01
Online evolution gives robots the capacity to learn new tasks and to adapt to changing environmental conditions during task execution. Previous approaches to online evolution of neural controllers are typically limited to the optimisation of weights in networks with a prespecified, fixed topology. In this article, we propose a novel approach to online learning in groups of autonomous robots called odNEAT. odNEAT is a distributed and decentralised neuroevolution algorithm that evolves both weights and network topology. We demonstrate odNEAT in three multirobot tasks: aggregation, integrated navigation and obstacle avoidance, and phototaxis. Results show that odNEAT approximates the performance of rtNEAT, an efficient centralised method, and outperforms IM-(μ + 1), a decentralised neuroevolution algorithm. Compared with rtNEAT and IM-(μ + 1), odNEAT's evolutionary dynamics lead to the synthesis of less complex neural controllers with superior generalisation capabilities. We show that robots executing odNEAT can display a high degree of fault tolerance as they are able to adapt and learn new behaviours in the presence of faults. We conclude with a series of ablation studies to analyse the impact of each algorithmic component on performance. PMID:25478664
A modified differential evolution algorithm for damage identification in submerged shell structures
NASA Astrophysics Data System (ADS)
Reed, H. M.; Nichols, J. M.; Earls, C. J.
2013-08-01
Obtaining good estimates of structural parameters from observed data is a particularly challenging task owing to the complex (often multi-modal) likelihood functions that often accompany such problems. As a result, sophisticated optimization routines are typically required to produce maximum likelihood estimates of the desired parameters. Evolutionary algorithms comprise one such approach, whereby nature-inspired mutation and crossover operations allow the sensible exploration of even multi-modal functions, in search of a global maximum. The challenge, of course, is to balance broad coverage in parameter space with the speed required to obtain such estimates. This work focuses directly on this problem by proposing a modified version of the Differential Evolution algorithm. The idea is to adjust both mutation and cross-over rates, during the optimization, in a manner that increases the convergence rate to the desired solution. Performance is demonstrated on the challenging problem of identifying imperfections in submerged shell structures.
Bazzani, A.; Turchetti, G.; Benedetti, C.; Rambaldi, S.; Servizi, G.
2005-06-08
In a high intensity circular accelerator the synchrotron dynamics introduces a slow modulation in the betatronic tune due to the space-charge tune depression. When the transverse motion is non-linear due to the presence of multipolar effects, resonance islands move in the phase space and change their amplitude. This effect introduces the trapping and detrapping phenomenon and a slow diffusion in the phase space. We apply the neo-adiabatic theory to describe this diffusion mechanism that can contribute to halo formation.
The dynamic instability of adiabatic blast waves
NASA Technical Reports Server (NTRS)
Ryu, Dongsu; Vishniac, Ethan T.
1991-01-01
Adiabatic blastwaves, which have a total energy injected from the center E varies as t(sup q) and propagate through a preshock medium with a density rho(sub E) varies as r(sup -omega) are described by a family of similarity solutions. Previous work has shown that adiabatic blastwaves with increasing or constant postshock entropy behind the shock front are susceptible to an oscillatory instability, caused by the difference between the nature of the forces on the two sides of the dense shell behind the shock front. This instability sets in if the dense postshock layer is sufficiently thin. The stability of adiabatic blastwaves with a decreasing postshock entropy is considered. Such blastwaves, if they are decelerating, always have a region behind the shock front which is subject to convection. Some accelerating blastwaves also have such region, depending on the values of q, omega, and gamma where gamma is the adiabatic index. However, since the shock interface stabilizes dynamically induced perturbations, blastwaves become convectively unstable only if the convective zone is localized around the origin or a contact discontinuity far from the shock front. On the other hand, the contact discontinuity of accelerating blastwaves is subject to a strong Rayleigh-Taylor instability. The frequency spectra of the nonradial, normal modes of adiabatic blastwaves have been calculated. The results have been applied to the shocks propagating through supernovae envelopes. It is shown that the metal/He and He/H interfaces are strongly unstable against the Rayleigh-Taylor instability. This instability will induce mixing in supernovae envelopes. In addition the implications of this work for the evolution of planetary nebulae is discussed.
The dynamic instability of adiabatic blast waves
NASA Astrophysics Data System (ADS)
Ryu, Dongsu; Vishniac, Ethan T.
1991-02-01
Adiabatic blastwaves, which have a total energy injected from the center E varies as tq and propagate through a preshock medium with a density rhoE varies as r-omega are described by a family of similarity solutions. Previous work has shown that adiabatic blastwaves with increasing or constant postshock entropy behind the shock front are susceptible to an oscillatory instability, caused by the difference between the nature of the forces on the two sides of the dense shell behind the shock front. This instability sets in if the dense postshock layer is sufficiently thin. The stability of adiabatic blastwaves with a decreasing postshock entropy is considered. Such blastwaves, if they are decelerating, always have a region behind the shock front which is subject to convection. Some accelerating blastwaves also have such region, depending on the values of q, omega, and gamma where gamma is the adiabatic index. However, since the shock interface stabilizes dynamically induced perturbations, blastwaves become convectively unstable only if the convective zone is localized around the origin or a contact discontinuity far from the shock front. On the other hand, the contact discontinuity of accelerating blastwaves is subject to a strong Rayleigh-Taylor instability. The frequency spectra of the nonradial, normal modes of adiabatic blastwaves have been calculated. The results have been applied to the shocks propagating through supernovae envelopes. It is shown that the metal/He and He/H interfaces are strongly unstable against the Rayleigh-Taylor instability. This instability will induce mixing in supernovae envelopes. In addition the implications of this work for the evolution of planetary nebulae is discussed.
The dynamic instability of adiabatic blastwaves
NASA Astrophysics Data System (ADS)
Ryu, Dongsu; Vishniac, Ethan T.
1990-05-01
Adiabatic blastwaves, which have a total energy injected from the center E varies as t(sup q) and propagate through a preshock medium with a density rho(sub E) varies as r(sup -omega) are described by a family of similarity solutions. Previous work has shown that adiabatic blastwaves with increasing or constant postshock entropy behind the shock front are susceptible to an oscillatory instability, caused by the difference between the nature of the forces on the two sides of the dense shell behind the shock front. This instability sets in if the dense postshock layer is sufficiently thin. The stability of adiabatic blastwaves with a decreasing postshock entropy is considered. Such blastwaves, if they are decelerating, always have a region behind the shock front which is subject to convection. Some accelerating blastwaves also have such region, depending on the values of q, omega, and gamma where gamma is the adiabatic index. However, since the shock interface stabilizes dynamically induced perturbations, blastwaves become convectively unstable only if the convective zone is localized around the origin or a contact discontinuity far from the shock front. On the other hand, the contact discontinuity of accelerating blastwaves is subject to a strong Rayleigh-Taylor instability. The frequency spectra of the nonradial, normal modes of adiabatic blastwaves have been calculated. The results have been applied to the shocks propagating through supernovae envelopes. It is shown that the metal/He and He/H interfaces are strongly unstable against the Rayleigh-Taylor instability. This instability will induce mixing in supernovae envelopes. In addition the implications of this work for the evolution of planetary nebulae is discussed.
Wang, Xiaolong; Jiang, Aipeng; Jiangzhou, Shu; Li, Ping
2014-01-01
A large-scale parallel-unit seawater reverse osmosis desalination plant contains many reverse osmosis (RO) units. If the operating conditions change, these RO units will not work at the optimal design points which are computed before the plant is built. The operational optimization problem (OOP) of the plant is to find out a scheduling of operation to minimize the total running cost when the change happens. In this paper, the OOP is modelled as a mixed-integer nonlinear programming problem. A two-stage differential evolution algorithm is proposed to solve this OOP. Experimental results show that the proposed method is satisfactory in solution quality. PMID:24701180
Wang, Jian; Wang, Xiaolong; Jiang, Aipeng; Jiangzhou, Shu; Li, Ping
2014-01-01
A large-scale parallel-unit seawater reverse osmosis desalination plant contains many reverse osmosis (RO) units. If the operating conditions change, these RO units will not work at the optimal design points which are computed before the plant is built. The operational optimization problem (OOP) of the plant is to find out a scheduling of operation to minimize the total running cost when the change happens. In this paper, the OOP is modelled as a mixed-integer nonlinear programming problem. A two-stage differential evolution algorithm is proposed to solve this OOP. Experimental results show that the proposed method is satisfactory in solution quality. PMID:24701180
Adiabatic state preparation study of methylene
Veis, Libor Pittner, Jiří
2014-06-07
Quantum computers attract much attention as they promise to outperform their classical counterparts in solving certain type of problems. One of them with practical applications in quantum chemistry is simulation of complex quantum systems. An essential ingredient of efficient quantum simulation algorithms are initial guesses of the exact wave functions with high enough fidelity. As was proposed in Aspuru-Guzik et al. [Science 309, 1704 (2005)], the exact ground states can in principle be prepared by the adiabatic state preparation method. Here, we apply this approach to preparation of the lowest lying multireference singlet electronic state of methylene and numerically investigate preparation of this state at different molecular geometries. We then propose modifications that lead to speeding up the preparation process. Finally, we decompose the minimal adiabatic state preparation employing the direct mapping in terms of two-qubit interactions.
NASA Astrophysics Data System (ADS)
Pitakaso, Rapeepan; Sethanan, Kanchana
2016-02-01
This article proposes the differential evolution algorithm (DE) and the modified differential evolution algorithm (DE-C) to solve a simple assembly line balancing problem type 1 (SALBP-1) and SALBP-1 when the maximum number of machine types in a workstation is considered (SALBP-1M). The proposed algorithms are tested and compared with existing effective heuristics using various sets of test instances found in the literature. The computational results show that the proposed heuristics is one of the best methods, compared with the other approaches.
Adiabaticity and spectral splits in collective neutrino transformations
Raffelt, Georg G.; Smirnov, Alexei Yu.
2007-12-15
Neutrinos streaming off a supernova core transform collectively by neutrino-neutrino interactions, leading to 'spectral splits' where an energy E{sub split} divides the transformed spectrum sharply into parts of almost pure but different flavors. We present a detailed description of the spectral-split phenomenon which is conceptually and quantitatively understood in an adiabatic treatment of neutrino-neutrino effects. Central to this theory is a self-consistency condition in the form of two sum rules (integrals over the neutrino spectra that must equal certain conserved quantities). We provide explicit analytic and numerical solutions for various neutrino spectra. We introduce the concept of the adiabatic reference frame and elaborate on the relative adiabatic evolution. Violating adiabaticity leads to the spectral split being 'washed out'. The sharpness of the split appears to be represented by a surprisingly universal function.
NASA Astrophysics Data System (ADS)
Landahl, Andrew
2012-10-01
Quantum computers promise to exploit counterintuitive quantum physics principles like superposition, entanglement, and uncertainty to solve problems using fundamentally fewer steps than any conventional computer ever could. The mere possibility of such a device has sharpened our understanding of quantum coherent information, just as lasers did for our understanding of coherent light. The chief obstacle to developing quantum computer technology is decoherence--one of the fastest phenomena in all of physics. In principle, decoherence can be overcome by using clever entangled redundancies in a process called fault-tolerant quantum error correction. However, the quality and scale of technology required to realize this solution appears distant. An exciting alternative is a proposal called ``adiabatic'' quantum computing (AQC), in which adiabatic quantum physics keeps the computer in its lowest-energy configuration throughout its operation, rendering it immune to many decoherence sources. The Adiabatic Quantum Architectures In Ultracold Systems (AQUARIUS) Grand Challenge Project at Sandia seeks to demonstrate this robustness in the laboratory and point a path forward for future hardware development. We are building devices in AQUARIUS that realize the AQC architecture on up to three quantum bits (``qubits'') in two platforms: Cs atoms laser-cooled to below 5 microkelvin and Si quantum dots cryo-cooled to below 100 millikelvin. We are also expanding theoretical frontiers by developing methods for scalable universal AQC in these platforms. We have successfully demonstrated operational qubits in both platforms and have even run modest one-qubit calculations using our Cs device. In the course of reaching our primary proof-of-principle demonstrations, we have developed multiple spinoff technologies including nanofabricated diffractive optical elements that define optical-tweezer trap arrays and atomic-scale Si lithography commensurate with placing individual donor atoms with
Multisurface Adiabatic Reactive Molecular Dynamics.
Nagy, Tibor; Yosa Reyes, Juvenal; Meuwly, Markus
2014-04-01
Adiabatic reactive molecular dynamics (ARMD) simulation method is a surface-crossing algorithm for modeling chemical reactions in classical molecular dynamics simulations using empirical force fields. As the ARMD Hamiltonian is time dependent during crossing, it allows only approximate energy conservation. In the current work, the range of applicability of conventional ARMD is explored, and a new multisurface ARMD (MS-ARMD) method is presented, implemented in CHARMM and applied to the vibrationally induced photodissociation of sulfuric acid (H2SO4) in the gas phase. For this, an accurate global potential energy surface (PES) involving 12 H2SO4 and 4 H2O + SO3 force fields fitted to MP2/6-311G++(2d,2p) reference energies is employed. The MS-ARMD simulations conserve total energy and feature both intramolecular H-transfer reactions and water elimination. An analytical treatment of the dynamics in the crossing region finds that conventional ARMD can approximately conserve total energy for limiting cases. In one of them, the reduced mass of the system is large, which often occurs for simulations of solvated biomolecular systems. On the other hand, MS-ARMD is a general approach for modeling chemical reactions including gas-phase, homogeneous, heterogeneous, and enzymatic catalytic reactions while conserving total energy in atomistic simulations. PMID:26580356
NASA Astrophysics Data System (ADS)
Song, Xianhai; Li, Lei; Zhang, Xueqiang; Huang, Jianquan; Shi, Xinchun; Jin, Si; Bai, Yiming
2014-10-01
In recent years, Rayleigh waves are gaining popularity to obtain near-surface shear (S)-wave velocity profiles. However, inversion of Rayleigh wave dispersion curves is challenging for most local-search methods due to its high nonlinearity and to its multimodality. In this study, we proposed and tested a new Rayleigh wave dispersion curve inversion scheme based on differential evolution (DE) algorithm. DE is a novel stochastic search approach that possesses several attractive advantages: (1) Capable of handling non-differentiable, non-linear and multimodal objective functions because of its stochastic search strategy; (2) Parallelizability to cope with computation intensive objective functions without being time consuming by using a vector population where the stochastic perturbation of the population vectors can be done independently; (3) Ease of use, i.e. few control variables to steer the minimization/maximization by DE's self-organizing scheme; and (4) Good convergence properties. The proposed inverse procedure was applied to nonlinear inversion of fundamental-mode Rayleigh wave dispersion curves for near-surface S-wave velocity profiles. To evaluate calculation efficiency and stability of DE, we firstly inverted four noise-free and four noisy synthetic data sets. Secondly, we investigated effects of the number of layers on DE algorithm and made an uncertainty appraisal analysis by DE algorithm. Thirdly, we made a comparative analysis with genetic algorithms (GA) by a synthetic data set to further investigate the performance of the proposed inverse procedure. Finally, we inverted a real-world example from a waste disposal site in NE Italy to examine the applicability of DE on Rayleigh wave dispersion curves. Furthermore, we compared the performance of the proposed approach to that of GA to further evaluate scores of the inverse procedure described here. Results from both synthetic and actual field data demonstrate that differential evolution algorithm applied
Zhu, Wu; Fang, Jian-an; Tang, Yang; Zhang, Wenbing; Du, Wei
2012-01-01
Design of a digital infinite-impulse-response (IIR) filter is the process of synthesizing and implementing a recursive filter network so that a set of prescribed excitations results a set of desired responses. However, the error surface of IIR filters is usually non-linear and multi-modal. In order to find the global minimum indeed, an improved differential evolution (DE) is proposed for digital IIR filter design in this paper. The suggested algorithm is a kind of DE variants with a controllable probabilistic (CPDE) population size. It considers the convergence speed and the computational cost simultaneously by nonperiodic partial increasing or declining individuals according to fitness diversities. In addition, we discuss as well some important aspects for IIR filter design, such as the cost function value, the influence of (noise) perturbations, the convergence rate and successful percentage, the parameter measurement, etc. As to the simulation result, it shows that the presented algorithm is viable and comparable. Compared with six existing State-of-the-Art algorithms-based digital IIR filter design methods obtained by numerical experiments, CPDE is relatively more promising and competitive. PMID:22808191
NASA Astrophysics Data System (ADS)
Zheng, Feifei; Simpson, Angus R.; Zecchin, Aaron C.
2011-08-01
This paper proposes a novel optimization approach for the least cost design of looped water distribution systems (WDSs). Three distinct steps are involved in the proposed optimization approach. In the first step, the shortest-distance tree within the looped network is identified using the Dijkstra graph theory algorithm, for which an extension is proposed to find the shortest-distance tree for multisource WDSs. In the second step, a nonlinear programming (NLP) solver is employed to optimize the pipe diameters for the shortest-distance tree (chords of the shortest-distance tree are allocated the minimum allowable pipe sizes). Finally, in the third step, the original looped water network is optimized using a differential evolution (DE) algorithm seeded with diameters in the proximity of the continuous pipe sizes obtained in step two. As such, the proposed optimization approach combines the traditional deterministic optimization technique of NLP with the emerging evolutionary algorithm DE via the proposed network decomposition. The proposed methodology has been tested on four looped WDSs with the number of decision variables ranging from 21 to 454. Results obtained show the proposed approach is able to find optimal solutions with significantly less computational effort than other optimization techniques.
Geometry of the Adiabatic Theorem
ERIC Educational Resources Information Center
Lobo, Augusto Cesar; Ribeiro, Rafael Antunes; Ribeiro, Clyffe de Assis; Dieguez, Pedro Ruas
2012-01-01
We present a simple and pedagogical derivation of the quantum adiabatic theorem for two-level systems (a single qubit) based on geometrical structures of quantum mechanics developed by Anandan and Aharonov, among others. We have chosen to use only the minimum geometric structure needed for the understanding of the adiabatic theorem for this case.…
NASA Astrophysics Data System (ADS)
Wang, Congzhe; Fang, Yuefa; Guo, Sheng
2015-07-01
Dimensional synthesis is one of the most difficult issues in the field of parallel robots with actuation redundancy. To deal with the optimal design of a redundantly actuated parallel robot used for ankle rehabilitation, a methodology of dimensional synthesis based on multi-objective optimization is presented. First, the dimensional synthesis of the redundant parallel robot is formulated as a nonlinear constrained multi-objective optimization problem. Then four objective functions, separately reflecting occupied space, input/output transmission and torque performances, and multi-criteria constraints, such as dimension, interference and kinematics, are defined. In consideration of the passive exercise of plantar/dorsiflexion requiring large output moment, a torque index is proposed. To cope with the actuation redundancy of the parallel robot, a new output transmission index is defined as well. The multi-objective optimization problem is solved by using a modified Differential Evolution(DE) algorithm, which is characterized by new selection and mutation strategies. Meanwhile, a special penalty method is presented to tackle the multi-criteria constraints. Finally, numerical experiments for different optimization algorithms are implemented. The computation results show that the proposed indices of output transmission and torque, and constraint handling are effective for the redundant parallel robot; the modified DE algorithm is superior to the other tested algorithms, in terms of the ability of global search and the number of non-dominated solutions. The proposed methodology of multi-objective optimization can be also applied to the dimensional synthesis of other redundantly actuated parallel robots only with rotational movements.
Liu, Chang; Wang, Guofeng; Xie, Qinglu; Zhang, Yanchao
2014-01-01
Effective fault classification of rolling element bearings provides an important basis for ensuring safe operation of rotating machinery. In this paper, a novel vibration sensor-based fault diagnosis method using an Ellipsoid-ARTMAP network (EAM) and a differential evolution (DE) algorithm is proposed. The original features are firstly extracted from vibration signals based on wavelet packet decomposition. Then, a minimum-redundancy maximum-relevancy algorithm is introduced to select the most prominent features so as to decrease feature dimensions. Finally, a DE-based EAM (DE-EAM) classifier is constructed to realize the fault diagnosis. The major characteristic of EAM is that the sample distribution of each category is realized by using a hyper-ellipsoid node and smoothing operation algorithm. Therefore, it can depict the decision boundary of disperse samples accurately and effectively avoid over-fitting phenomena. To optimize EAM network parameters, the DE algorithm is presented and two objectives, including both classification accuracy and nodes number, are simultaneously introduced as the fitness functions. Meanwhile, an exponential criterion is proposed to realize final selection of the optimal parameters. To prove the effectiveness of the proposed method, the vibration signals of four types of rolling element bearings under different loads were collected. Moreover, to improve the robustness of the classifier evaluation, a two-fold cross validation scheme is adopted and the order of feature samples is randomly arranged ten times within each fold. The results show that DE-EAM classifier can recognize the fault categories of the rolling element bearings reliably and accurately. PMID:24936949
Aspects of adiabatic population transfer and control
NASA Astrophysics Data System (ADS)
Demirplak, Mustafa
This thesis explores two different questions. The first question we answer is how to restore a given population transfer scenario given that it works efficiently in the adiabatic limit but fails because of lack of intensity and/or short duration. We derive a very simple algorithm to do this and apply it to both toy and realistic models. Two results emerge from this study. While the mathematical existence of the programme is certain it might not always be physically desirable. The restoration of adiabaticity is phase sensitive. The second question that is answered in this thesis is not how to invent new control paradigms, but rather what would happen to them in the presence of stochastic perturbers. We first use a phenomenological model to study the effect of stochastic dephasing on population transfer by stimulated Raman adiabatic passage. The results of this Monte Carlo calculation are qualitatively explained with a perturbation theoretical result in the dressed state basis. The reliability of our phenomenological model is questioned through a more rigorous hybrid quantal-classical simulation of controlled population transfer in HCl in Ar.
Generalized Ramsey numbers through adiabatic quantum optimization
NASA Astrophysics Data System (ADS)
Ranjbar, Mani; Macready, William G.; Clark, Lane; Gaitan, Frank
2016-06-01
Ramsey theory is an active research area in combinatorics whose central theme is the emergence of order in large disordered structures, with Ramsey numbers marking the threshold at which this order first appears. For generalized Ramsey numbers r(G, H), the emergent order is characterized by graphs G and H. In this paper we: (i) present a quantum algorithm for computing generalized Ramsey numbers by reformulating the computation as a combinatorial optimization problem which is solved using adiabatic quantum optimization; and (ii) determine the Ramsey numbers r({{T}}m,{{T}}n) for trees of order m,n = 6,7,8 , most of which were previously unknown.
Adiabatic Mass Loss Model in Binary Stars
NASA Astrophysics Data System (ADS)
Ge, H. W.
2012-07-01
Rapid mass transfer process in the interacting binary systems is very complicated. It relates to two basic problems in the binary star evolution, i.e., the dynamically unstable Roche-lobe overflow and the common envelope evolution. Both of the problems are very important and difficult to be modeled. In this PhD thesis, we focus on the rapid mass loss process of the donor in interacting binary systems. The application to the criterion of dynamically unstable mass transfer and the common envelope evolution are also included. Our results based on the adiabatic mass loss model could be used to improve the binary evolution theory, the binary population synthetic method, and other related aspects. We build up the adiabatic mass loss model. In this model, two approximations are included. The first one is that the energy generation and heat flow through the stellar interior can be neglected, hence the restructuring is adiabatic. The second one is that he stellar interior remains in hydrostatic equilibrium. We model this response by constructing model sequences, beginning with a donor star filling its Roche lobe at an arbitrary point in its evolution, holding its specific entropy and composition profiles fixed. These approximations are validated by the comparison with the time-dependent binary mass transfer calculations and the polytropic model for low mass zero-age main-sequence stars. In the dynamical time scale mass transfer, the adiabatic response of the donor star drives it to expand beyond its Roche lobe, leading to runaway mass transfer and the formation of a common envelope with its companion star. For donor stars with surface convection zones of any significant depth, this runaway condition is encountered early in mass transfer, if at all; but for main sequence stars with radiative envelopes, it may be encountered after a prolonged phase of thermal time scale mass transfer, so-called delayed dynamical instability. We identify the critical binary mass ratio for the
NASA Astrophysics Data System (ADS)
Gurarslan, Gurhan; Karahan, Halil
2015-09-01
In this study, an accurate model was developed for solving problems of groundwater-pollution-source identification. In the developed model, the numerical simulations of flow and pollutant transport in groundwater were carried out using MODFLOW and MT3DMS software. The optimization processes were carried out using a differential evolution algorithm. The performance of the developed model was tested on two hypothetical aquifer models using real and noisy observation data. In the first model, the release histories of the pollution sources were determined assuming that the numbers, locations and active stress periods of the sources are known. In the second model, the release histories of the pollution sources were determined assuming that there is no information on the sources. The results obtained by the developed model were found to be better than those reported in literature.
Using Neighborhood-Algorithm Inversion to Test and Calibrate Landscape Evolution Models
NASA Astrophysics Data System (ADS)
Perignon, M. C.; Tucker, G. E.; Van Der Beek, P.; Hilley, G. E.; Arrowsmith, R.
2011-12-01
Landscape evolution models use mass transport rules to simulate the development of topography over timescales too long for humans to observe. The ability of models to reproduce various attributes of real landscapes must be tested against natural systems in which driving forces, boundary conditions, and timescales of landscape evolution can be well constrained. We test and calibrate a landscape evolution model by comparing it with a well-constrained natural experiment using a formal inversion method to obtain best-fitting parameter values. Our case study is the Dragon's Back Pressure Ridge, a region of elevated terrain parallel to the south central San Andreas Fault that serves as a natural laboratory for studying how the timing and spatial distribution of uplift affects topography. We apply an optimization procedure to identify the parameter ranges and combinations that best account for the observed topography. Through the use of repeat forward modeling, direct-search inversion models can be used to convert observations from such natural systems into inferences of the processes that governed their formation. Simple inversion techniques have been used before in landscape evolution modeling, but these are imprecise and computationally expensive. We present the application of a more efficient inversion technique, the Neighborhood Algorithm (NA), to optimize the search for the model parameters values that are most consistent with the formation of the Dragon's Back Pressure Ridge through repeat forward modeling using CHILD. Inversion techniques require the comparison of model results with direct observations to evaluate misfit. For our target landscape, this is done through a series of topographic metrics that include hypsometry, slope-area curves, and channel concavity. NA uses an initial Monte Carlo simulation for which misfits have been calculated to guide a new iteration of forward models. At each iteration, NA uses n-dimensional Voronoi cells to explore the
NASA Astrophysics Data System (ADS)
Mozdgir, A.; Mahdavi, Iraj; Seyyedi, I.; Shiraqei, M. E.
2011-06-01
An assembly line is a flow-oriented production system where the productive units performing the operations, referred to as stations, are aligned in a serial manner. The assembly line balancing problem arises and has to be solved when an assembly line has to be configured or redesigned. The so-called simple assembly line balancing problem (SALBP), a basic version of the general problem, has attracted attention of researchers and practitioners of operations research for almost half a century. There are four types of objective functions which are considered to this kind of problem. The versions of SALBP may be complemented by a secondary objective which consists of smoothing station loads. Many heuristics have been proposed for the assembly line balancing problem due to its computational complexity and difficulty in identifying an optimal solution and so many heuristic solutions are supposed to solve this problem. In this paper a differential evolution algorithm is developed to minimize workload smoothness index in SALBP-2 and the algorithm parameters are optimized using Taguchi method.
SIMULATION OF CONTINUOUS-CONTACT SEPARATION PROCESSES: MULTICOMPONENT, ADIABATIC ABSORPTION
A new algorithm has been developed for the steady-state simulation of multicomponent, adiabatic absorption in packed columns. The system of differential model equations that describe the physical absorption process is reduced to algebraic equations by using a finite difference me...
Gong, Li-gang; Yang, Wen-lun
2014-01-01
Unmanned combat aerial vehicles (UCAVs) have been of great interest to military organizations throughout the world due to their outstanding capabilities to operate in dangerous or hazardous environments. UCAV path planning aims to obtain an optimal flight route with the threats and constraints in the combat field well considered. In this work, a novel artificial bee colony (ABC) algorithm improved by a balance-evolution strategy (BES) is applied in this optimization scheme. In this new algorithm, convergence information during the iteration is fully utilized to manipulate the exploration/exploitation accuracy and to pursue a balance between local exploitation and global exploration capabilities. Simulation results confirm that BE-ABC algorithm is more competent for the UCAV path planning scheme than the conventional ABC algorithm and two other state-of-the-art modified ABC algorithms. PMID:24790555
Li, Bai; Gong, Li-gang; Yang, Wen-lun
2014-01-01
Unmanned combat aerial vehicles (UCAVs) have been of great interest to military organizations throughout the world due to their outstanding capabilities to operate in dangerous or hazardous environments. UCAV path planning aims to obtain an optimal flight route with the threats and constraints in the combat field well considered. In this work, a novel artificial bee colony (ABC) algorithm improved by a balance-evolution strategy (BES) is applied in this optimization scheme. In this new algorithm, convergence information during the iteration is fully utilized to manipulate the exploration/exploitation accuracy and to pursue a balance between local exploitation and global exploration capabilities. Simulation results confirm that BE-ABC algorithm is more competent for the UCAV path planning scheme than the conventional ABC algorithm and two other state-of-the-art modified ABC algorithms. PMID:24790555
Adiabatic quantum computing with phase modulated laser pulses
Goswami, Debabrata
2005-01-01
Implementation of quantum logical gates for multilevel systems is demonstrated through decoherence control under the quantum adiabatic method using simple phase modulated laser pulses. We make use of selective population inversion and Hamiltonian evolution with time to achieve such goals robustly instead of the standard unitary transformation language. PMID:17195865
Kibble-Zurek mechanism beyond adiabaticity: Finite-time scaling with critical initial slip
NASA Astrophysics Data System (ADS)
Huang, Yingyi; Yin, Shuai; Hu, Qijun; Zhong, Fan
2016-01-01
The Kibble-Zurek mechanism demands an initial adiabatic stage before an impulse stage to have a frozen correlation length that generates topological defects in a cooling phase transition. Here we study such a driven critical dynamics but with an initial condition that is near the critical point and that is far away from equilibrium. In this case, there is no initial adiabatic stage at all and thus adiabaticity is broken. However, we show that there again exists a finite length scale arising from the driving that divides the evolution into three stages. A relaxation-finite-time-scaling-adiabatic scenario is then proposed in place of the adiabatic-impulse-adiabatic scenario of the original Kibble-Zurek mechanism. A unified scaling theory, which combines finite-time scaling with critical initial slip, is developed to describe the universal behavior and is confirmed with numerical simulations of a two-dimensional classical Ising model.
NASA Technical Reports Server (NTRS)
Koshak, William; Solakiewicz, Richard
2012-01-01
The ability to estimate the fraction of ground flashes in a set of flashes observed by a satellite lightning imager, such as the future GOES-R Geostationary Lightning Mapper (GLM), would likely improve operational and scientific applications (e.g., severe weather warnings, lightning nitrogen oxides studies, and global electric circuit analyses). A Bayesian inversion method, called the Ground Flash Fraction Retrieval Algorithm (GoFFRA), was recently developed for estimating the ground flash fraction. The method uses a constrained mixed exponential distribution model to describe a particular lightning optical measurement called the Maximum Group Area (MGA). To obtain the optimum model parameters (one of which is the desired ground flash fraction), a scalar function must be minimized. This minimization is difficult because of two problems: (1) Label Switching (LS), and (2) Parameter Identity Theft (PIT). The LS problem is well known in the literature on mixed exponential distributions, and the PIT problem was discovered in this study. Each problem occurs when one allows the numerical minimizer to freely roam through the parameter search space; this allows certain solution parameters to interchange roles which leads to fundamental ambiguities, and solution error. A major accomplishment of this study is that we have employed a state-of-the-art genetic-based global optimization algorithm called Differential Evolution (DE) that constrains the parameter search in such a way as to remove both the LS and PIT problems. To test the performance of the GoFFRA when DE is employed, we applied it to analyze simulated MGA datasets that we generated from known mixed exponential distributions. Moreover, we evaluated the GoFFRA/DE method by applying it to analyze actual MGAs derived from low-Earth orbiting lightning imaging sensor data; the actual MGA data were classified as either ground or cloud flash MGAs using National Lightning Detection Network[TM] (NLDN) data. Solution error
A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce
NASA Astrophysics Data System (ADS)
Xia, Chao; Sheng, Ying; Jiang, Zhong-Zhong; Tan, Chunqiao; Huang, Min; He, Yuanjian
2015-12-01
In this paper, a novel discrete differential evolution (DDE) algorithm is proposed to solve the vehicle routing problems (VRP) in B2C e-commerce, in which VRP is modeled by the incomplete graph based on the actual urban road system. First, a variant of classical VRP is described and a mathematical programming model for the variant is given. Second, the DDE is presented, where individuals are represented as the sequential encoding scheme, and a novel reparation operator is employed to repair the infeasible solutions. Furthermore, a FLOYD operator for dealing with the shortest route is embedded in the proposed DDE. Finally, an extensive computational study is carried out in comparison with the predatory search algorithm and genetic algorithm, and the results show that the proposed DDE is an effective algorithm for VRP in B2C e-commerce.
Hydrodynamic evolution of sperm swimming: Optimal flagella by a genetic algorithm.
Ishimoto, Kenta
2016-06-21
Swimming performance of spermatozoa is an important index for the success of fertilization. For many years, numerous studies have reported the optimal swimming of flagellar organisms. Nevertheless, there is still a question as to which is optimal among planar, circular helical and ellipsoidal helical beating. In this paper, we use a genetic algorithm to investigate the beat pattern with the best swimming efficiency based on hydrodynamic dissipation and internal torque exertion. For the parameters considered, our results show that the planar beat is optimal for small heads and the helical flagellum is optimum for a larger heads, while the ellipsoidal beat is never optimal. Also, the genetic optimization reveals that the wavenumber and shape of wave envelope are relevant parameters, whereas the wave shape and head geometry have relatively minor effects on efficiency. The optimal beat with respect to the efficiency based on the internal torque exertion of an active elastic flagellum is characterized by a small-wavenumber and large-amplitude wave in a lower-viscosity medium. The obtained results on the optimal waveform are consistent with observations for planar waveforms, but in many respects, the results suggest the necessity of a detailed flagellar structure-fluid interaction to address whether real spermatozoa exhibit hydrodynamically efficient swimming. The evolutional optimization approach used in this study has distinguished biologically important parameters, and the methodology can potentially be applicable to various swimmers. PMID:27063642
Effect of dephasing on stimulated Raman adiabatic passage
Ivanov, P.A.; Vitanov, N.V.; Bergmann, K.
2004-12-01
This work explores the effect of phase relaxation on the population transfer efficiency in stimulated Raman adiabatic passage (STIRAP). The study is based on the Liouville equation, which is solved analytically in the adiabatic limit. The transfer efficiency of STIRAP is found to decrease exponentially with the dephasing rate; this effect is stronger for shorter pulse delays and weaker for larger delays, since the transition time is found to be inversely proportional to the pulse delay. Moreover, it is found that the transfer efficiency of STIRAP in the presence of dephasing does not depend on the peak Rabi frequencies at all, as long as they are sufficiently large to enforce adiabatic evolution; hence increasing the field intensity cannot reduce the dephasing losses. It is shown also that for any dephasing rate, the final populations of the initial state and the intermediate state are equal. For strong dephasing all three populations tend to (1/3)
Pressure Oscillations in Adiabatic Compression
ERIC Educational Resources Information Center
Stout, Roland
2011-01-01
After finding Moloney and McGarvey's modified adiabatic compression apparatus, I decided to insert this experiment into my physical chemistry laboratory at the last minute, replacing a problematic experiment. With insufficient time to build the apparatus, we placed a bottle between two thick textbooks and compressed it with a third textbook forced…
Adiabatic dynamics of magnetic vortices
NASA Astrophysics Data System (ADS)
Papanicolaou, N.
1994-03-01
We formulate a reasonably detailed adiabatic conjecture concerning the dynamics of skew deflection of magnetic vortices in a field gradient, which is expected to be valid at sufficiently large values of the winding number. The conjecture is consistent with the golden rule used to describe the dynamics of realistic magnetic bubbles and is verified here numerically within the 2-D isotropic Heisenberg model.
NASA Astrophysics Data System (ADS)
Han, Yu-Yan; Gong, Dunwei; Sun, Xiaoyan
2015-07-01
A flow-shop scheduling problem with blocking has important applications in a variety of industrial systems but is underrepresented in the research literature. In this study, a novel discrete artificial bee colony (ABC) algorithm is presented to solve the above scheduling problem with a makespan criterion by incorporating the ABC with differential evolution (DE). The proposed algorithm (DE-ABC) contains three key operators. One is related to the employed bee operator (i.e. adopting mutation and crossover operators of discrete DE to generate solutions with good quality); the second is concerned with the onlooker bee operator, which modifies the selected solutions using insert or swap operators based on the self-adaptive strategy; and the last is for the local search, that is, the insert-neighbourhood-based local search with a small probability is adopted to improve the algorithm's capability in exploitation. The performance of the proposed DE-ABC algorithm is empirically evaluated by applying it to well-known benchmark problems. The experimental results show that the proposed algorithm is superior to the compared algorithms in minimizing the makespan criterion.
Khan, S. U.; Qureshi, I. M.; Zaman, F.; Shoaib, B.; Naveed, A.; Basit, A.
2014-01-01
Three issues regarding sensor failure at any position in the antenna array are discussed. We assume that sensor position is known. The issues include raise in sidelobe levels, displacement of nulls from their original positions, and diminishing of null depth. The required null depth is achieved by making the weight of symmetrical complement sensor passive. A hybrid method based on memetic computing algorithm is proposed. The hybrid method combines the cultural algorithm with differential evolution (CADE) which is used for the reduction of sidelobe levels and placement of nulls at their original positions. Fitness function is used to minimize the error between the desired and estimated beam patterns along with null constraints. Simulation results for various scenarios have been given to exhibit the validity and performance of the proposed algorithm. PMID:24688440
Adiabatic and diabatic process of sum frequency conversion.
Liqing, Ren; Yongfang, Li; Baihong, Li; Lei, Wang; Zhaohua, Wang
2010-09-13
Based on the dressed state formalism, we obtain the adiabatic criterion of the sum frequency conversion. We show that this constraint restricts the energy conversion between the two dressed fields, which are superpositions of the signal field and the sum frequency field. We also show that the evolution of the populations of the dressed fields, which in turn describes the conversion of light photons from the seed frequency to the sum frequency during propagation through the nonlinear crystal. Take the quasiphased matched (QPM) scheme as an example, we calculate the expected bandwidth of the frequency conversion process, and its dependence on the length of the crystal. We demonstrate that the evolutionary patterns of the sum frequency field's energy are similar to the Fresnel diffraction of a light field. We finally show that the expected bandwidth can be also deduced from the evolution of the adiabaticity of the dressed fileds. PMID:20940935
Adiabatic Berry phase in an atom-molecule conversion system
Fu Libin; Liu Jie
2010-11-15
We investigate the Berry phase of adiabatic quantum evolution in the atom-molecule conversion system that is governed by a nonlinear Schroedinger equation. We find that the Berry phase consists of two parts: the usual Berry connection term and a novel term from the nonlinearity brought forth by the atom-molecule coupling. The total geometric phase can be still viewed as the flux of the magnetic field of a monopole through the surface enclosed by a closed path in parameter space. The charge of the monopole, however, is found to be one third of the elementary charge of the usual quantized monopole. We also derive the classical Hannay angle of a geometric nature associated with the adiabatic evolution. It exactly equals minus Berry phase, indicating a novel connection between Berry phase and Hannay angle in contrast to the usual derivative form.
Robust adiabatic sum frequency conversion.
Suchowski, Haim; Prabhudesai, Vaibhav; Oron, Dan; Arie, Ady; Silberberg, Yaron
2009-07-20
We discuss theoretically and demonstrate experimentally the robustness of the adiabatic sum frequency conversion method. This technique, borrowed from an analogous scheme of robust population transfer in atomic physics and nuclear magnetic resonance, enables the achievement of nearly full frequency conversion in a sum frequency generation process for a bandwidth up to two orders of magnitude wider than in conventional conversion schemes. We show that this scheme is robust to variations in the parameters of both the nonlinear crystal and of the incoming light. These include the crystal temperature, the frequency of the incoming field, the pump intensity, the crystal length and the angle of incidence. Also, we show that this extremely broad bandwidth can be tuned to higher or lower central wavelengths by changing either the pump frequency or the crystal temperature. The detailed study of the properties of this converter is done using the Landau-Zener theory dealing with the adiabatic transitions in two level systems. PMID:19654679
Does temperature increase or decrease in adiabatic decompression of magma?
NASA Astrophysics Data System (ADS)
Kilinc, A. I.; Ghiorso, M. S.; Khan, T.
2011-12-01
We have modeled adiabatic decompression of an andesitic and a basaltic magma as an isentropic process using the Melts algorithm. Our modeling shows that during adiabatic decompression temperature of andesitic magma increases but temperature of basaltic magma decreases. In an isentropic process entropy is constant so change of temperature with pressure can be written as dT/dP=T (dV/dT)/Cp where T (dV/dT)/Cp is generally positive. If delta P is negative so is delta T. In general, in the absence of phase change, we expect the temperature to decrease with adiabatic decompression. The effect of crystallization is to turn a more entropic phase (liquid) into a less entropic phase (solid), which must be compensated by raising the temperature. If during adiabatic decompression there is small amount or no crystallization, T (dV/dT)/Cp effect which lowers the temperature overwhelms the small amount of crystallization, which raises the temperature, and overall system temperature decreases.
NASA Astrophysics Data System (ADS)
Marvian, Milad; Lidar, Daniel
We investigate the performance of error suppression schemes for adiabatic quantum computation. Assuming a Markovian environment and using an adiabatic master equation we compare the rate of excitation from the ground subspace of the encoded Hamiltonian during the evolution to that of the unprotected Hamiltonian. For different forms of Markovian environments -- such as sub-Ohmic, Ohmic and super-Ohmic -- we identify the parameter thresholds for which encoding starts exhibiting its benefits.
The Structure and Evolution of LOCBURST: The BATSE Burst Location Algorithm
NASA Technical Reports Server (NTRS)
Pendleton, Geoffrey N.; Briggs, Michael S.; Kippen, R. Marc; Paciesas, William S.; Stollberg, Mark; Woods, Pete; Meegan, Charles A.; Fishman, Gerald J.; McCollough, Mike L.; Connaughton, Valerie
1999-01-01
The gamma-ray burst (GRB) location algorithm used to produce the BATSE GRB locations is described. The general flow of control of the current location algorithm is presented, and the significant properties of the various physical inputs required are identified. The development of the burst location algorithm during the releases of the BATSE IB, 2B, and 3B GRB catalogs is presented so that the reasons for the differences in the positions and error estimates between the catalogs can be understood. In particular, differences between the 2B and 3B locations are discussed for events that have moved significantly and the reasons for the changes explained. The locations of bursts located independently by the interplanetary network (IPN) are used to illustrate the effect on burst location accuracy of various components of the algorithm. IPN data and locations from other gamma-ray instruments are used to calculate estimates of the systematic errors on BATSE burst locations.
He, Feng; Zhang, Wei; Zhang, Guoqiang
2016-01-01
A differential evolution algorithm for solving Nash equilibrium in nonlinear continuous games is presented in this paper, called NIDE (Nikaido-Isoda differential evolution). At each generation, parent and child strategy profiles are compared one by one pairwisely, adapting Nikaido-Isoda function as fitness function. In practice, the NE of nonlinear game model with cubic cost function and quadratic demand function is solved, and this method could also be applied to non-concave payoff functions. Moreover, the NIDE is compared with the existing Nash Domination Evolutionary Multiplayer Optimization (NDEMO), the result showed that NIDE was significantly better than NDEMO with less iterations and shorter running time. These numerical examples suggested that the NIDE method is potentially useful. PMID:27589229
Optimization of the mean radius flow path of a multi-stage steam turbine with evolution algorithms
NASA Astrophysics Data System (ADS)
Huttunen, Jukka; Larjola, Jaakko; Turunen-Saaresti, Teemu; Backman, Jari
2011-08-01
A prototype model of the mean radius flow path of a four-stage, high speed 1 MWe axial steam turbine was optimized by using evolution algorithms, DE (differential evolution) algorithm in this case. Also the cost-benefits of the optimization were inspected. The optimization was successfully performed but the accuracy of the optimization was slightly less than hoped when compared to the control modeling executed with the CFD (computational fluid dynamics). The mentioned inaccuracy could have been hardly avoided because of problems with an initial presumption involving semi-empiric calculations and of the uncertainty concerning the absolute areas of qualification of the functions. This kind of algebraic modeling was essential for the success of the optimization because e.g. CFD-calculation could not have been done on each step of the optimization. During the optimization some problems occurred with the adequacy of the computer capacity and with finding a suitable solution that would keep the algorithms within mathematically allowable boundaries but would not restrict the progress of the optimization too much. The rest of the problems were due to the novelty of the application and problems with preciseness when handling the areas of qualification of the functions. Although the accuracy of the optimization results was not exactly in accordance with the objective, they did have a favorable effect on the designing of the turbine. The optimization executed with the help of the DE-algorithm got at least about 3.5 % more power out of the turbine which means about 150 000 € cost-benefit per turbine in the form of additional electricity capacity.
Non-adiabatic molecular dynamics by accelerated semiclassical Monte Carlo
White, Alexander J.; Gorshkov, Vyacheslav N.; Tretiak, Sergei; Mozyrsky, Dmitry
2015-07-07
Non-adiabatic dynamics, where systems non-radiatively transition between electronic states, plays a crucial role in many photo-physical processes, such as fluorescence, phosphorescence, and photoisomerization. Methods for the simulation of non-adiabatic dynamics are typically either numerically impractical, highly complex, or based on approximations which can result in failure for even simple systems. Recently, the Semiclassical Monte Carlo (SCMC) approach was developed in an attempt to combine the accuracy of rigorous semiclassical methods with the efficiency and simplicity of widely used surface hopping methods. However, while SCMC was found to be more efficient than other semiclassical methods, it is not yet as efficientmore » as is needed to be used for large molecular systems. Here, we have developed two new methods: the accelerated-SCMC and the accelerated-SCMC with re-Gaussianization, which reduce the cost of the SCMC algorithm up to two orders of magnitude for certain systems. In many cases shown here, the new procedures are nearly as efficient as the commonly used surface hopping schemes, with little to no loss of accuracy. This implies that these modified SCMC algorithms will be of practical numerical solutions for simulating non-adiabatic dynamics in realistic molecular systems.« less
Non-adiabatic molecular dynamics by accelerated semiclassical Monte Carlo
White, Alexander J.; Gorshkov, Vyacheslav N.; Tretiak, Sergei; Mozyrsky, Dmitry
2015-07-07
Non-adiabatic dynamics, where systems non-radiatively transition between electronic states, plays a crucial role in many photo-physical processes, such as fluorescence, phosphorescence, and photoisomerization. Methods for the simulation of non-adiabatic dynamics are typically either numerically impractical, highly complex, or based on approximations which can result in failure for even simple systems. Recently, the Semiclassical Monte Carlo (SCMC) approach was developed in an attempt to combine the accuracy of rigorous semiclassical methods with the efficiency and simplicity of widely used surface hopping methods. However, while SCMC was found to be more efficient than other semiclassical methods, it is not yet as efficient as is needed to be used for large molecular systems. Here, we have developed two new methods: the accelerated-SCMC and the accelerated-SCMC with re-Gaussianization, which reduce the cost of the SCMC algorithm up to two orders of magnitude for certain systems. In many cases shown here, the new procedures are nearly as efficient as the commonly used surface hopping schemes, with little to no loss of accuracy. This implies that these modified SCMC algorithms will be of practical numerical solutions for simulating non-adiabatic dynamics in realistic molecular systems.
Non-adiabatic molecular dynamics by accelerated semiclassical Monte Carlo
White, Alexander J.; Gorshkov, Vyacheslav N.; Tretiak, Sergei; Mozyrsky, Dmitry
2015-07-07
Non-adiabatic dynamics, where systems non-radiatively transition between electronic states, plays a crucial role in many photo-physical processes, such as fluorescence, phosphorescence, and photoisomerization. Methods for the simulation of non-adiabatic dynamics are typically either numerically impractical, highly complex, or based on approximations which can result in failure for even simple systems. Recently, the Semiclassical Monte Carlo (SCMC) approach was developed in an attempt to combine the accuracy of rigorous semiclassical methods with the efficiency and simplicity of widely used surface hopping methods. However, while SCMC was found to be more efficient than other semiclassical methods, it is not yet as efficient as is needed to be used for large molecular systems. Here, we have developed two new methods: the accelerated-SCMC and the accelerated-SCMC with re-Gaussianization, which reduce the cost of the SCMC algorithm up to two orders of magnitude for certain systems. In most cases shown here, the new procedures are nearly as efficient as the commonly used surface hopping schemes, with little to no loss of accuracy. This implies that these modified SCMC algorithms will be of practical numerical solutions for simulating non-adiabatic dynamics in realistic molecular systems.
ERIC Educational Resources Information Center
Mayr, Ernst
1978-01-01
Traces the history of evolution theory from Lamarck and Darwin to the present. Discusses natural selection in detail. Suggests that, besides biological evolution, there is also a cultural evolution which is more rapid than the former. (MA)
Adiabatic Wankel type rotary engine
NASA Technical Reports Server (NTRS)
Kamo, R.; Badgley, P.; Doup, D.
1988-01-01
This SBIR Phase program accomplished the objective of advancing the technology of the Wankel type rotary engine for aircraft applications through the use of adiabatic engine technology. Based on the results of this program, technology is in place to provide a rotor and side and intermediate housings with thermal barrier coatings. A detailed cycle analysis of the NASA 1007R Direct Injection Stratified Charge (DISC) rotary engine was performed which concluded that applying thermal barrier coatings to the rotor should be successful and that it was unlikely that the rotor housing could be successfully run with thermal barrier coatings as the thermal stresses were extensive.
NASA Astrophysics Data System (ADS)
Gallagher, Kerry; Sambridge, Malcolm; Drijkoningen, Guy
In providing a method for solving non-linear optimization problems Monte Carlo techniques avoid the need for linearization but, in practice, are often prohibitive because of the large number of models that must be considered. A new class of methods known as Genetic Algorithms have recently been devised in the field of Artificial Intelligence. We outline the basic concept of genetic algorithms and discuss three examples. We show that, in locating an optimal model, the new technique is far superior in performance to Monte Carlo techniques in all cases considered. However, Monte Carlo integration is still regarded as an effective method for the subsequent model appraisal.
NASA Astrophysics Data System (ADS)
Li, Hong; Zhang, Li; Jiao, Yong-Chang
2016-07-01
This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn-Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.
Energy-Efficient and Secure S-Box circuit using Symmetric Pass Gate Adiabatic Logic
Kumar, Dinesh; Mohammad, Azhar; Singh, Vijay; Perumalla, Kalyan S
2016-01-01
Differential Power Analysis (DPA) attack is considered to be a main threat while designing cryptographic processors. In cryptographic algorithms like DES and AES, S-Box is used to indeterminate the relationship between the keys and the cipher texts. However, S-box is prone to DPA attack due to its high power consumption. In this paper, we are implementing an energy-efficient 8-bit S-Box circuit using our proposed Symmetric Pass Gate Adiabatic Logic (SPGAL). SPGAL is energy-efficient as compared to the existing DPAresistant adiabatic and non-adiabatic logic families. SPGAL is energy-efficient due to reduction of non-adiabatic loss during the evaluate phase of the outputs. Further, the S-Box circuit implemented using SPGAL is resistant to DPA attacks. The results are verified through SPICE simulations in 180nm technology. SPICE simulations show that the SPGAL based S-Box circuit saves upto 92% and 67% of energy as compared to the conventional CMOS and Secured Quasi-Adiabatic Logic (SQAL) based S-Box circuit. From the simulation results, it is evident that the SPGAL based circuits are energy-efficient as compared to the existing DPAresistant adiabatic and non-adiabatic logic families. In nutshell, SPGAL based gates can be used to build secure hardware for lowpower portable electronic devices and Internet-of-Things (IoT) based electronic devices.
Design of wideband multilayer planar absorber using a new differential evolution algorithm
NASA Astrophysics Data System (ADS)
Lin, Chuan; Qing, Anyong; Zang, Jiefeng
2015-03-01
Design of wideband planar absorber using real electromagnetic composite materials is considered in this paper. A new differential evolution, dynamic differential evolution with best of random differential mutation, is applied to solve this problem. To simplify the problem, a suitable objective function and regulation scheme have been designed to transform the constrained multi-objective problem into unconstrained single-objective one. The effects of total thickness and investigated frequency band have been studied. Four-layer planar absorbers for different cases have been successfully designed.
Ferrauto, Tomassino; Parisi, Domenico; Di Stefano, Gabriele; Baldassarre, Gianluca
2013-01-01
Organisms that live in groups, from microbial symbionts to social insects and schooling fish, exhibit a number of highly efficient cooperative behaviors, often based on role taking and specialization. These behaviors are relevant not only for the biologist but also for the engineer interested in decentralized collective robotics. We address these phenomena by carrying out experiments with groups of two simulated robots controlled by neural networks whose connection weights are evolved by using genetic algorithms. These algorithms and controllers are well suited to autonomously find solutions for decentralized collective robotic tasks based on principles of self-organization. The article first presents a taxonomy of role-taking and specialization mechanisms related to evolved neural network controllers. Then it introduces two cooperation tasks, which can be accomplished by either role taking or specialization, and uses these tasks to compare four different genetic algorithms to evaluate their capacity to evolve a suitable behavioral strategy, which depends on the task demands. Interestingly, only one of the four algorithms, which appears to have more biological plausibility, is capable of evolving role taking or specialization when they are needed. The results are relevant for both collective robotics and biology, as they can provide useful hints on the different processes that can lead to the emergence of specialization in robots and organisms. PMID:23514239
Microscopic expression for heat in the adiabatic basis.
Polkovnikov, Anatoli
2008-11-28
We derive a microscopic expression for the instantaneous diagonal elements of the density matrix rho(nn)(t) in the adiabatic basis for an arbitrary time-dependent process in a closed Hamiltonian system. If the initial density matrix is stationary (diagonal) then this expression contains only squares of absolute values of matrix elements of the evolution operator, which can be interpreted as transition probabilities. We then derive the microscopic expression for the heat defined as the energy generated due to transitions between instantaneous energy levels. If the initial density matrix is passive [diagonal with rho(nn)(0) monotonically decreasing with energy] then the heat is non-negative in agreement with basic expectations of thermodynamics. Our findings also can be used for systematic expansion of various observables around the adiabatic limit. PMID:19113464
The adiabatic motion of charged dust grains in rotating magnetospheres
NASA Astrophysics Data System (ADS)
Northrop, T. G.; Hill, J. R.
1983-01-01
Adiabatic equations of motion are derived for the micrometer-sized dust grains detected in the Jovian and Saturn magnetospheres by the Pioneer 10 and 11 spacecraft. The adiabatic theory of charged particle motion is extended to the case of variable grain charge. Attention is focused on the innermost and outermost limits to the grain orbit evolution, with all orbits tending to become circular with time. The parameters such as the center equation of motion, the drift velocity, and the parallel equation of motion are obtained for grains in a rotating magnetosphere. Consideration is given to the effects of periodic grain charge-discharge, which are affected by the ambient plasma properties and the grain plasma velocity. The charge-discharge process at the gyrofrequency is determined to eliminate the invariance of the magnetic moment and cause the grain to exhibit radial movement. The magnetic moment increases or decreases as a function of the gyrophase of the charge variation.
NASA Astrophysics Data System (ADS)
Ekinci, Yunus Levent; Balkaya, Çağlayan; Göktürkler, Gökhan; Turan, Seçil
2016-06-01
An efficient approach to estimate model parameters from residual gravity data based on differential evolution (DE), a stochastic vector-based metaheuristic algorithm, has been presented. We have showed the applicability and effectiveness of this algorithm on both synthetic and field anomalies. According to our knowledge, this is a first attempt of applying DE for the parameter estimations of residual gravity anomalies due to isolated causative sources embedded in the subsurface. The model parameters dealt with here are the amplitude coefficient (A), the depth and exact origin of causative source (zo and xo, respectively) and the shape factors (q and ƞ). The error energy maps generated for some parameter pairs have successfully revealed the nature of the parameter estimation problem under consideration. Noise-free and noisy synthetic single gravity anomalies have been evaluated with success via DE/best/1/bin, which is a widely used strategy in DE. Additionally some complicated gravity anomalies caused by multiple source bodies have been considered, and the results obtained have showed the efficiency of the algorithm. Then using the strategy applied in synthetic examples some field anomalies observed for various mineral explorations such as a chromite deposit (Camaguey district, Cuba), a manganese deposit (Nagpur, India) and a base metal sulphide deposit (Quebec, Canada) have been considered to estimate the model parameters of the ore bodies. Applications have exhibited that the obtained results such as the depths and shapes of the ore bodies are quite consistent with those published in the literature. Uncertainty in the solutions obtained from DE algorithm has been also investigated by Metropolis-Hastings (M-H) sampling algorithm based on simulated annealing without cooling schedule. Based on the resulting histogram reconstructions of both synthetic and field data examples the algorithm has provided reliable parameter estimations being within the sampling limits of
NASA Astrophysics Data System (ADS)
Bor, E.; Turduev, M.; Kurt, H.
2016-08-01
Photonic structure designs based on optimization algorithms provide superior properties compared to those using intuition-based approaches. In the present study, we numerically and experimentally demonstrate subwavelength focusing of light using wavelength scale absorption-free dielectric scattering objects embedded in an air background. An optimization algorithm based on differential evolution integrated into the finite-difference time-domain method was applied to determine the locations of each circular dielectric object with a constant radius and refractive index. The multiobjective cost function defined inside the algorithm ensures strong focusing of light with low intensity side lobes. The temporal and spectral responses of the designed compact photonic structure provided a beam spot size in air with a full width at half maximum value of 0.19λ, where λ is the wavelength of light. The experiments were carried out in the microwave region to verify numerical findings, and very good agreement between the two approaches was found. The subwavelength light focusing is associated with a strong interference effect due to nonuniformly arranged scatterers and an irregular index gradient. Improving the focusing capability of optical elements by surpassing the diffraction limit of light is of paramount importance in optical imaging, lithography, data storage, and strong light-matter interaction.
Bor, E; Turduev, M; Kurt, H
2016-01-01
Photonic structure designs based on optimization algorithms provide superior properties compared to those using intuition-based approaches. In the present study, we numerically and experimentally demonstrate subwavelength focusing of light using wavelength scale absorption-free dielectric scattering objects embedded in an air background. An optimization algorithm based on differential evolution integrated into the finite-difference time-domain method was applied to determine the locations of each circular dielectric object with a constant radius and refractive index. The multiobjective cost function defined inside the algorithm ensures strong focusing of light with low intensity side lobes. The temporal and spectral responses of the designed compact photonic structure provided a beam spot size in air with a full width at half maximum value of 0.19λ, where λ is the wavelength of light. The experiments were carried out in the microwave region to verify numerical findings, and very good agreement between the two approaches was found. The subwavelength light focusing is associated with a strong interference effect due to nonuniformly arranged scatterers and an irregular index gradient. Improving the focusing capability of optical elements by surpassing the diffraction limit of light is of paramount importance in optical imaging, lithography, data storage, and strong light-matter interaction. PMID:27477060
Bor, E.; Turduev, M.; Kurt, H.
2016-01-01
Photonic structure designs based on optimization algorithms provide superior properties compared to those using intuition-based approaches. In the present study, we numerically and experimentally demonstrate subwavelength focusing of light using wavelength scale absorption-free dielectric scattering objects embedded in an air background. An optimization algorithm based on differential evolution integrated into the finite-difference time-domain method was applied to determine the locations of each circular dielectric object with a constant radius and refractive index. The multiobjective cost function defined inside the algorithm ensures strong focusing of light with low intensity side lobes. The temporal and spectral responses of the designed compact photonic structure provided a beam spot size in air with a full width at half maximum value of 0.19λ, where λ is the wavelength of light. The experiments were carried out in the microwave region to verify numerical findings, and very good agreement between the two approaches was found. The subwavelength light focusing is associated with a strong interference effect due to nonuniformly arranged scatterers and an irregular index gradient. Improving the focusing capability of optical elements by surpassing the diffraction limit of light is of paramount importance in optical imaging, lithography, data storage, and strong light-matter interaction. PMID:27477060
Drallos, P.J.; Wadehra, J.M.
1988-06-01
We are presenting a novel numerical technique for obtaining the time evolution of the electron velocity and electron energy distribution functions in the presence of a uniform electric field. Using this technique, the various swarm parameters can be evolved for sufficiently long times so that equilibrium can be reached without incurring any numerical instabilities. Results are presented for electron swarms in gaseous neon for various values of E/N.
García-Pedrajas, Nicolás; Ortiz-Boyer, Domingo; Hervás-Martínez, César
2006-05-01
In this work we present a new approach to crossover operator in the genetic evolution of neural networks. The most widely used evolutionary computation paradigm for neural network evolution is evolutionary programming. This paradigm is usually preferred due to the problems caused by the application of crossover to neural network evolution. However, crossover is the most innovative operator within the field of evolutionary computation. One of the most notorious problems with the application of crossover to neural networks is known as the permutation problem. This problem occurs due to the fact that the same network can be represented in a genetic coding by many different codifications. Our approach modifies the standard crossover operator taking into account the special features of the individuals to be mated. We present a new model for mating individuals that considers the structure of the hidden layer and redefines the crossover operator. As each hidden node represents a non-linear projection of the input variables, we approach the crossover as a problem on combinatorial optimization. We can formulate the problem as the extraction of a subset of near-optimal projections to create the hidden layer of the new network. This new approach is compared to a classical crossover in 25 real-world problems with an excellent performance. Moreover, the networks obtained are much smaller than those obtained with classical crossover operator. PMID:16343847
Degenerate adiabatic perturbation theory: Foundations and applications
NASA Astrophysics Data System (ADS)
Rigolin, Gustavo; Ortiz, Gerardo
2014-08-01
We present details and expand on the framework leading to the recently introduced degenerate adiabatic perturbation theory [Phys. Rev. Lett. 104, 170406 (2010), 10.1103/PhysRevLett.104.170406], and on the formulation of the degenerate adiabatic theorem, along with its necessary and sufficient conditions [given in Phys. Rev. A 85, 062111 (2012), 10.1103/PhysRevA.85.062111]. We start with the adiabatic approximation for degenerate Hamiltonians that paves the way to a clear and rigorous statement of the associated degenerate adiabatic theorem, where the non-Abelian geometric phase (Wilczek-Zee phase) plays a central role to its quantitative formulation. We then describe the degenerate adiabatic perturbation theory, whose zeroth-order term is the degenerate adiabatic approximation, in its full generality. The parameter in the perturbative power-series expansion of the time-dependent wave function is directly associated to the inverse of the time it takes to drive the system from its initial to its final state. With the aid of the degenerate adiabatic perturbation theory we obtain rigorous necessary and sufficient conditions for the validity of the adiabatic theorem of quantum mechanics. Finally, to illustrate the power and wide scope of the methodology, we apply the framework to a degenerate Hamiltonian, whose closed-form time-dependent wave function is derived exactly, and also to other nonexactly solvable Hamiltonians whose solutions are numerically computed.
NASA Astrophysics Data System (ADS)
Kummerow, Christian; Hong, Y.; Olson, W. S.; Yang, S.; Adler, R. F.; McCollum, J.; Ferraro, R.; Petty, G.; Shin, D.-B.; Wilheit, T. T.
2001-11-01
This paper describes the latest improvements applied to the Goddard profiling algorithm (GPROF), particularly as they apply to the Tropical Rainfall Measuring Mission (TRMM). Most of these improvements, however, are conceptual in nature and apply equally to other passive microwave sensors. The improvements were motivated by a notable overestimation of precipitation in the intertropical convergence zone. This problem was traced back to the algorithm's poor separation between convective and stratiform precipitation coupled with a poor separation between stratiform and transition regions in the a priori cloud model database. In addition to now using an improved convective-stratiform classification scheme, the new algorithm also makes use of emission and scattering indices instead of individual brightness temperatures. Brightness temperature indices have the advantage of being monotonic functions of rainfall. This, in turn, has allowed the algorithm to better define the uncertainties needed by the scheme's Bayesian inversion approach. Last, the algorithm over land has been modified primarily to better account for ambiguous classification where the scattering signature of precipitation could be confused with surface signals. All these changes have been implemented for both the TRMM Microwave Imager (TMI) and the Special Sensor Microwave Imager (SSM/I). Results from both sensors are very similar at the storm scale and for global averages. Surface rainfall products from the algorithm's operational version have been compared with conventional rainfall data over both land and oceans. Over oceans, GPROF results compare well with atoll gauge data. GPROF is biased negatively by 9% with a correlation of 0.86 for monthly 2.5° averages over the atolls. If only grid boxes with two or more atolls are used, the correlation increases to 0.91 but GPROF becomes positively biased by 6%. Comparisons with TRMM ground validation products from Kwajalein reveal that GPROF is negatively
A genetic algorithm approach to probing the evolution of self-organized nanostructured systems.
Siepmann, Peter; Martin, Christopher P; Vancea, Ioan; Moriarty, Philip J; Krasnogor, Natalio
2007-07-01
We present a new methodology, based on a combination of genetic algorithms and image morphometry, for matching the outcome of a Monte Carlo simulation to experimental observations of a far-from-equilibrium nanosystem. The Monte Carlo model used simulates a colloidal solution of nanoparticles drying on a solid substrate and has previously been shown to produce patterns very similar to those observed experimentally. Our approach enables the broad parameter space associated with simulated nanoparticle self-organization to be searched effectively for a given experimental target morphology. PMID:17552572
Sumithra, Subramaniam; Victoire, T. Aruldoss Albert
2015-01-01
Due to large dimension of clusters and increasing size of sensor nodes, finding the optimal route and cluster for large wireless sensor networks (WSN) seems to be highly complex and cumbersome. This paper proposes a new method to determine a reasonably better solution of the clustering and routing problem with the highest concern of efficient energy consumption of the sensor nodes for extending network life time. The proposed method is based on the Differential Evolution (DE) algorithm with an improvised search operator called Diversified Vicinity Procedure (DVP), which models a trade-off between energy consumption of the cluster heads and delay in forwarding the data packets. The obtained route using the proposed method from all the gateways to the base station is comparatively lesser in overall distance with less number of data forwards. Extensive numerical experiments demonstrate the superiority of the proposed method in managing energy consumption of the WSN and the results are compared with the other algorithms reported in the literature. PMID:26516635
Sumithra, Subramaniam; Victoire, T Aruldoss Albert
2015-01-01
Due to large dimension of clusters and increasing size of sensor nodes, finding the optimal route and cluster for large wireless sensor networks (WSN) seems to be highly complex and cumbersome. This paper proposes a new method to determine a reasonably better solution of the clustering and routing problem with the highest concern of efficient energy consumption of the sensor nodes for extending network life time. The proposed method is based on the Differential Evolution (DE) algorithm with an improvised search operator called Diversified Vicinity Procedure (DVP), which models a trade-off between energy consumption of the cluster heads and delay in forwarding the data packets. The obtained route using the proposed method from all the gateways to the base station is comparatively lesser in overall distance with less number of data forwards. Extensive numerical experiments demonstrate the superiority of the proposed method in managing energy consumption of the WSN and the results are compared with the other algorithms reported in the literature. PMID:26516635
NASA Astrophysics Data System (ADS)
Rashed, Ghamgeen I.; Sun, Yuanzhang; Shaheen, H. I.
Flexible Alternating Current Transmission Systems (FACTS) devices have been proposed as an effective solution for controlling power flow and regulating bus voltage in electrical power systems, resulting in an increased transfer capability, low system losses, and improve stability. However to what extent the performance of FACTS devices can be brought out highly depends upon the location and the parameters of these devices. In this paper, we propose two Evolutionary Optimization Techniques, namely Differential Evolution (DE) and Genetic Algorithm (GA) to select the optimal location and the optimal parameter setting of TCSC which minimize the active power losses in the power network, and compare their performances. To show the validity of the proposed techniques and for comparison purposes, simulations are carried out on several power systems, a three-bus power system, a five-bus power system, and an IEEE-14 bus power system. The results, we have obtained, indicate that DE is an easy to use, fast, robust and powerful optimization technique compared with genetic algorithm (GA). The results are presented in the paper together with appropriate discussion.
Wright, Thomas; Ward, Jamie
2013-08-01
Sensory substitution is a promising technique for mitigating the loss of a sensory modality. Sensory substitution devices (SSDs) work by converting information from the impaired sense (e.g., vision) into another, intact sense (e.g., audition). However, there are a potentially infinite number of ways of converting images into sounds, and it is important that the conversion takes into account the limits of human perception and other user-related factors (e.g., whether the sounds are pleasant to listen to). The device explored here is termed "polyglot" because it generates a very large set of solutions. Specifically, we adapt a procedure that has been in widespread use in the design of technology but has rarely been used as a tool to explore perception-namely, interactive genetic algorithms. In this procedure, a very large range of potential sensory substitution devices can be explored by creating a set of "genes" with different allelic variants (e.g., different ways of translating luminance into loudness). The most successful devices are then "bred" together, and we statistically explore the characteristics of the selected-for traits after multiple generations. The aim of the present study is to produce design guidelines for a better SSD. In three experiments, we vary the way that the fitness of the device is computed: by asking the user to rate the auditory aesthetics of different devices (Experiment 1), and by measuring the ability of participants to match sounds to images (Experiment 2) and the ability to perceptually discriminate between two sounds derived from similar images (Experiment 3). In each case, the traits selected for by the genetic algorithm represent the ideal SSD for that task. Taken together, these traits can guide the design of a better SSD. PMID:23298393
Schedule path optimization for adiabatic quantum computing and optimization
NASA Astrophysics Data System (ADS)
Zeng, Lishan; Zhang, Jun; Sarovar, Mohan
2016-04-01
Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are probabilistic in nature and the minimum gap between the ground state and first excited state of the system during evolution is a major factor in determining the success probability. In this work we investigate a strategy for increasing the minimum gap and success probability by introducing intermediate Hamiltonians that modify the evolution path between initial and final Hamiltonians. We focus on an optimization problem relevant to recent hardware implementations and present numerical evidence for the existence of a purely local intermediate Hamiltonian that achieve the optimum performance in terms of pushing the minimum gap to one of the end points of the evolution. As a part of this study we develop a convex optimization formulation of the search for optimal adiabatic schedules that makes this computation more tractable, and which may be of independent interest. We further study the effectiveness of random intermediate Hamiltonians on the minimum gap and success probability, and empirically find that random Hamiltonians have a significant probability of increasing the success probability, but only by a modest amount.
Relativistic blast waves in two dimensions. I - The adiabatic case
NASA Technical Reports Server (NTRS)
Shapiro, P. R.
1979-01-01
Approximate solutions are presented for the dynamical evolution of strong adiabatic relativistic blast waves which result from a point explosion in an ambient gas in which the density varies both with distance from the explosion center and with polar angle in axisymmetry. Solutions are analytical or quasi-analytical for the extreme relativistic case and numerical for the arbitrarily relativistic case. Some general properties of nonplanar relativistic shocks are also discussed, including the incoherence of spherical ultrarelativistic blast-wave fronts on angular scales greater than the reciprocal of the shock Lorentz factor, as well as the conditions for producing blast-wave acceleration.
Gravitational radiation reaction and inspiral waveforms in the adiabatic limit.
Hughes, Scott A; Drasco, Steve; Flanagan, Eanna E; Franklin, Joel
2005-06-10
We describe progress evolving an important limit of binaries in general relativity: stellar mass compact objects spiraling into much larger black holes. Such systems are of great observational interest. We have developed tools to compute for the first time the radiation from generic orbits. Using global conservation laws, we find the orbital evolution and waveforms for special cases. For generic orbits, inspirals and waveforms can be found by augmenting our approach with an adiabatic self-force rule due to Mino. Such waveforms should be accurate enough for gravitational-wave searches. PMID:16090377
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network
Goto, Hayato
2016-01-01
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence. PMID:26899997
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network
NASA Astrophysics Data System (ADS)
Goto, Hayato
2016-02-01
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network.
Goto, Hayato
2016-01-01
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence. PMID:26899997
Adiabatic Compression of Oxygen: Real Fluid Temperatures
NASA Technical Reports Server (NTRS)
Barragan, Michelle; Wilson, D. Bruce; Stoltzfus, Joel M.
2000-01-01
The adiabatic compression of oxygen has been identified as an ignition source for systems operating in enriched oxygen atmospheres. Current practice is to evaluate the temperature rise on compression by treating oxygen as an ideal gas with constant heat capacity. This paper establishes the appropriate thermodynamic analysis for the common occurrence of adiabatic compression of oxygen and in the process defines a satisfactory equation of state (EOS) for oxygen. It uses that EOS to model adiabatic compression as isentropic compression and calculates final temperatures for this system using current approaches for comparison.
Heating and cooling in adiabatic mixing process
NASA Astrophysics Data System (ADS)
Zhou, Jing; Cai, Zi; Zou, Xu-Bo; Guo, Guang-Can
2010-12-01
We study the effect of interaction on the temperature change in the process of adiabatic mixing of two components of Fermi gases using the real-space Bogoliubov-de Gennes method. We find that in the process of adiabatic mixing, the competition between the adiabatic expansion and the attractive interaction makes it possible to cool or heat the system depending on the strength of the interaction and the initial temperature of the system. The changes of the temperature in a bulk system and in a trapped system are investigated.
Search for the algorithm of genes distribution during the process of microbial evolution
NASA Astrophysics Data System (ADS)
Pikuta, Elena V.
2015-09-01
Previous two and three dimensional graph analysis of eco-physiological data of Archaea demonstrated specific geometry for distribution of major Prokaryotic groups in a hyperboloid function. The function of a two-sheet hyperboloid covered all known biological groups, and therefore, could be applied for the entire evolution of life on Earth. The vector of evolution was indicated from the point of hyper temperature, extreme acidity and low salinity to the point of low temperature and increased alkalinity and salinity. According to this vector, the following groups were chosen for the gene screening analysis. In the vector "High-Temperature → Low-Temperature" within extreme acidic pH (0-3), it is: 1) the hyperthermophilic Crenarchaeota - order Sulfolobales, 2) moderately thermophilic Euryarchaeota - Class Thermoplasmata, and 3) mesophilic acidophiles- genus Thiobacillus and others. In the vector "Low pH → High pH" the following groups were selected in three temperature ranges: a) Hyperthermophilic Archaea and Eubacteria, b) moderately thermophilic - representatives of the genera Anaerobacter and Anoxybacillus, and c) mesophilic haloalkaliphiles (Eubacteria and Archaea). The genes associated with acidophily (H+ pump), chemolitho-autotrophy (proteins of biochemichal cycles), polymerases, and histones were proposed for the first vector, and for the second vector the genes associated with halo-alkaliphily (Na+ pumps), enzymes of organotrophic metabolisms (sugar- and proteolytics), and others were indicated for the screening. Here, an introduction to the phylogenetic constant (ρη) is presented and discussed. This universal characteristic is calculated for two principally different life forms -Prokaryotes and Eukaryotes; Existence of the second type of living forms is impossible without the first one. The number of chromosomes in Prokaryotic organisms is limited to one (with very rare exceptions, to two), while in Eukaryotic organisms this number is larger. Currently
Adiabatic limits on Riemannian Heisenberg manifolds
Yakovlev, A A
2008-02-28
An asymptotic formula is obtained for the distribution function of the spectrum of the Laplace operator, in the adiabatic limit for the foliation defined by the orbits of an invariant flow on a compact Riemannian Heisenberg manifold. Bibliography: 21 titles.
Experimental demonstration of composite adiabatic passage
NASA Astrophysics Data System (ADS)
Schraft, Daniel; Halfmann, Thomas; Genov, Genko T.; Vitanov, Nikolay V.
2013-12-01
We report an experimental demonstration of composite adiabatic passage (CAP) for robust and efficient manipulation of two-level systems. The technique represents a altered version of rapid adiabatic passage (RAP), driven by composite sequences of radiation pulses with appropriately chosen phases. We implement CAP with radio-frequency pulses to invert (i.e., to rephase) optically prepared spin coherences in a Pr3+:Y2SiO5 crystal. We perform systematic investigations of the efficiency of CAP and compare the results with conventional π pulses and RAP. The data clearly demonstrate the superior features of CAP with regard to robustness and efficiency, even under conditions of weakly fulfilled adiabaticity. The experimental demonstration of composite sequences to support adiabatic passage is of significant relevance whenever a high efficiency or robustness of coherent excitation processes need to be maintained, e.g., as required in quantum information technology.
An Adiabatic Architecture for Linear Signal Processing
NASA Astrophysics Data System (ADS)
Vollmer, M.; Götze, J.
2005-05-01
Using adiabatic CMOS logic instead of the more traditional static CMOS logic can lower the power consumption of a hardware design. However, the characteristic differences between adiabatic and static logic, such as a four-phase clock, have a far reaching influence on the design itself. These influences are investigated in this paper by adapting a systolic array of CORDIC devices to be implemented adiabatically. We present a means to describe adiabatic logic in VHDL and use it to define the systolic array with precise timing and bit-true calculations. The large pipeline bubbles that occur in a naive version of this array are identified and removed to a large degree. As an example, we demonstrate a parameterization of the CORDIC array that carries out adaptive RLS filtering.
Adiabatic invariance of oscillons/I -balls
NASA Astrophysics Data System (ADS)
Kawasaki, Masahiro; Takahashi, Fuminobu; Takeda, Naoyuki
2015-11-01
Real scalar fields are known to fragment into spatially localized and long-lived solitons called oscillons or I -balls. We prove the adiabatic invariance of the oscillons/I -balls for a potential that allows periodic motion even in the presence of non-negligible spatial gradient energy. We show that such a potential is uniquely determined to be the quadratic one with a logarithmic correction, for which the oscillons/I -balls are absolutely stable. For slightly different forms of the scalar potential dominated by the quadratic one, the oscillons/I -balls are only quasistable, because the adiabatic charge is only approximately conserved. We check the conservation of the adiabatic charge of the I -balls in numerical simulation by slowly varying the coefficient of logarithmic corrections. This unambiguously shows that the longevity of oscillons/I -balls is due to the adiabatic invariance.
Symmetry of the Adiabatic Condition in the Piston Problem
ERIC Educational Resources Information Center
Anacleto, Joaquim; Ferreira, J. M.
2011-01-01
This study addresses a controversial issue in the adiabatic piston problem, namely that of the piston being adiabatic when it is fixed but no longer so when it can move freely. It is shown that this apparent contradiction arises from the usual definition of adiabatic condition. The issue is addressed here by requiring the adiabatic condition to be…
ADIABATIC MASS LOSS IN BINARY STARS. I. COMPUTATIONAL METHOD
Ge Hongwei; Chen Xuefei; Han Zhanwen; Webbink, Ronald F. E-mail: mshjell@gmail.co
2010-07-10
The asymptotic response of donor stars in interacting binary systems to very rapid mass loss is characterized by adiabatic expansion throughout their interiors. In this limit, energy generation and heat flow through the stellar interior can be neglected. We model this response by constructing model sequences, beginning with a donor star filling its Roche lobe at an arbitrary point in its evolution, holding its specific entropy and composition profiles fixed as mass is removed from the surface. The stellar interior remains in hydrostatic equilibrium. Luminosity profiles in these adiabatic models of mass-losing stars can be reconstructed from the specific entropy profiles and their gradients. These approximations are validated by comparison with time-dependent binary mass transfer calculations. We describe how adiabatic mass-loss sequences can be used to quantify threshold conditions for dynamical timescale mass transfer, and to establish the range of post-common envelope binaries that are allowed energetically. In dynamical timescale mass transfer, the adiabatic response of the donor star drives it to expand beyond its Roche lobe, leading to runaway mass transfer and the formation of a common envelope with its companion star. For donor stars with surface convection zones of any significant depth, this runaway condition is encountered early in mass transfer, if at all; but for main-sequence stars with radiative envelopes, it may be encountered after a prolonged phase of thermal timescale mass transfer, a so-called delayed dynamical instability. We identify the critical binary mass ratio for the onset of dynamical timescale mass transfer as that ratio for which the adiabatic response of the donor star radius to mass loss matches that of its Roche lobe at some point during mass transfer; if the ratio of donor to accretor masses exceeds this critical value, dynamical timescale mass transfer ensues. In common envelope evolution, the dissipation of orbital energy of the
Adiabatic invariants in stellar dynamics. 1: Basic concepts
NASA Technical Reports Server (NTRS)
Weinberg, Martin D.
1994-01-01
The adiabatic criterion, widely used in astronomical dynamics, is based on the harmonic oscillator. It asserts that the change in action under a slowly varying perturbation is exponentially small. Recent mathematical results that precisely define the conditions for invariance show that this model does not apply in general. In particular, a slowly varying perturbation may cause significant evolution stellar dynamical systems even if its time scale is longer than any internal orbital time scale. This additional 'heating' may have serious implications for the evolution of star clusters and dwarf galaxies which are subject to long-term environmental forces. The mathematical developments leading to these results are reviewed, and the conditions for applicability to and further implications for stellar systems are discussed. Companion papers present a computational method for a general time-dependent disturbance and detailed example.
Accurate adiabatic correction in the hydrogen molecule
Pachucki, Krzysztof; Komasa, Jacek
2014-12-14
A new formalism for the accurate treatment of adiabatic effects in the hydrogen molecule is presented, in which the electronic wave function is expanded in the James-Coolidge basis functions. Systematic increase in the size of the basis set permits estimation of the accuracy. Numerical results for the adiabatic correction to the Born-Oppenheimer interaction energy reveal a relative precision of 10{sup −12} at an arbitrary internuclear distance. Such calculations have been performed for 88 internuclear distances in the range of 0 < R ⩽ 12 bohrs to construct the adiabatic correction potential and to solve the nuclear Schrödinger equation. Finally, the adiabatic correction to the dissociation energies of all rovibrational levels in H{sub 2}, HD, HT, D{sub 2}, DT, and T{sub 2} has been determined. For the ground state of H{sub 2} the estimated precision is 3 × 10{sup −7} cm{sup −1}, which is almost three orders of magnitude higher than that of the best previous result. The achieved accuracy removes the adiabatic contribution from the overall error budget of the present day theoretical predictions for the rovibrational levels.
Accurate adiabatic correction in the hydrogen molecule
NASA Astrophysics Data System (ADS)
Pachucki, Krzysztof; Komasa, Jacek
2014-12-01
A new formalism for the accurate treatment of adiabatic effects in the hydrogen molecule is presented, in which the electronic wave function is expanded in the James-Coolidge basis functions. Systematic increase in the size of the basis set permits estimation of the accuracy. Numerical results for the adiabatic correction to the Born-Oppenheimer interaction energy reveal a relative precision of 10-12 at an arbitrary internuclear distance. Such calculations have been performed for 88 internuclear distances in the range of 0 < R ⩽ 12 bohrs to construct the adiabatic correction potential and to solve the nuclear Schrödinger equation. Finally, the adiabatic correction to the dissociation energies of all rovibrational levels in H2, HD, HT, D2, DT, and T2 has been determined. For the ground state of H2 the estimated precision is 3 × 10-7 cm-1, which is almost three orders of magnitude higher than that of the best previous result. The achieved accuracy removes the adiabatic contribution from the overall error budget of the present day theoretical predictions for the rovibrational levels.
Symmetry-Protected Quantum Adiabatic Transistors
NASA Astrophysics Data System (ADS)
Williamson, Dominic J.; Bartlett, Stephen D.
2014-03-01
An essential development in the history of computing was the invention of the transistor as it allowed logic circuits to be implemented in a robust and modular way. The physical characteristics of semiconductor materials were the key to building these devices. We aim to present an analogous development for quantum computing by showing that quantum adiabatic transistors (as defined by Flammia et al.) are built upon the essential qualities of symmetry-protected (SP) quantum ordered phases in one dimension. Flammia et al. and Renes et al. have demonstrated schemes for universal adiabatic quantum computation using quantum adiabatic transistors described by interacting spin chain models with specifically chosen Hamiltonian terms. We show that these models can be understood as specific examples of the generic situation in which all SP phases lead to quantum computation on encoded edge degrees of freedom by adiabatically traversing a symmetric phase transition into a trivial symmetric phase. This point of view is advantageous as it allows us to readily see that the computational properties of a quantum adiabatic transistor arise from a phase of matter rather than due to carefully tuned interactions.
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network
NASA Astrophysics Data System (ADS)
Goto, Hayato
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via its bifurcation with a slowly varying parameter. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing. To distinguish them, we refer to the present approach as bifurcation-based adiabatic quantum computation. Our numerical simulation results suggest that quantum superposition and quantum fluctuation work effectively to find optimal solutions.
Nonadiabatic exchange dynamics during adiabatic frequency sweeps
NASA Astrophysics Data System (ADS)
Barbara, Thomas M.
2016-04-01
A Bloch equation analysis that includes relaxation and exchange effects during an adiabatic frequency swept pulse is presented. For a large class of sweeps, relaxation can be incorporated using simple first order perturbation theory. For anisochronous exchange, new expressions are derived for exchange augmented rotating frame relaxation. For isochronous exchange between sites with distinct relaxation rate constants outside the extreme narrowing limit, simple criteria for adiabatic exchange are derived and demonstrate that frequency sweeps commonly in use may not be adiabatic with regard to exchange unless the exchange rates are much larger than the relaxation rates. Otherwise, accurate assessment of the sensitivity to exchange dynamics will require numerical integration of the rate equations. Examples of this situation are given for experimentally relevant parameters believed to hold for in-vivo tissue. These results are of significance in the study of exchange induced contrast in magnetic resonance imaging.
Adiabatic approximation for the density matrix
NASA Astrophysics Data System (ADS)
Band, Yehuda B.
1992-05-01
An adiabatic approximation for the Liouville density-matrix equation which includes decay terms is developed. The adiabatic approximation employs the eigenvectors of the non-normal Liouville operator. The approximation is valid when there exists a complete set of eigenvectors of the non-normal Liouville operator (i.e., the eigenvectors span the density-matrix space), the time rate of change of the Liouville operator is small, and an auxiliary matrix is nonsingular. Numerical examples are presented involving efficient population transfer in a molecule by stimulated Raman scattering, with the intermediate level of the molecule decaying on a time scale that is fast compared with the pulse durations of the pump and Stokes fields. The adiabatic density-matrix approximation can be simply used to determine the density matrix for atomic or molecular systems interacting with cw electromagnetic fields when spontaneous emission or other decay mechanisms prevail.
Extensive Adiabatic Invariants for Nonlinear Chains
NASA Astrophysics Data System (ADS)
Giorgilli, Antonio; Paleari, Simone; Penati, Tiziano
2012-09-01
We look for extensive adiabatic invariants in nonlinear chains in the thermodynamic limit. Considering the quadratic part of the Klein-Gordon Hamiltonian, by a linear change of variables we transform it into a sum of two parts in involution. At variance with the usual method of introducing normal modes, our constructive procedure allows us to exploit the complete resonance, while keeping the extensive nature of the system. Next we construct a nonlinear approximation of an extensive adiabatic invariant for a perturbation of the discrete nonlinear Schrödinger model. The fluctuations of this quantity are controlled via Gibbs measure estimates independent of the system size, for a large set of initial data at low specific energy. Finally, by numerical calculations we show that our adiabatic invariant is well conserved for times much longer than predicted by our first order theory, with fluctuation much smaller than expected according to standard statistical estimates.
Adiabatic many-body state preparation and information transfer in quantum dot arrays
NASA Astrophysics Data System (ADS)
Farooq, Umer; Bayat, Abolfazl; Mancini, Stefano; Bose, Sougato
2015-04-01
Quantum simulation of many-body systems are one of the most interesting tasks of quantum technology. Among them is the preparation of a many-body system in its ground state when the vanishing energy gap makes the cooling mechanisms ineffective. Adiabatic theorem, as an alternative to cooling, can be exploited for driving the many-body system to its ground state. In this paper, we study two most common disorders in quantum dot arrays, namely exchange coupling fluctuations and hyperfine interaction, in adiabatic preparation of ground state in such systems. We show that the adiabatic ground-state preparation is highly robust against those disorder effects making it a good analog simulator. Moreover, we also study the adiabatic quantum information transfer, using singlet-triplet states, across a spin chain. In contrast to ground-state preparation the transfer mechanism is highly affected by disorder and in particular, the hyperfine interaction is very destructive for the performance. This suggests that for communication tasks across such arrays adiabatic evolution is not as effective and quantum quenches could be preferable.
NASA Astrophysics Data System (ADS)
Peter, Ulmschneider
When we are looking for intelligent life outside the Earth, there is a fundamental question: Assuming that life has formed on an extraterrestrial planet, will it also develop toward intelligence? As this is hotly debated, we will now describe the development of life on Earth in more detail in order to show that there are good reasons why evolution should culminate in intelligent beings.
Dlouhy, Brian J; Dahdaleh, Nader S; Menezes, Arnold H
2015-04-01
The craniovertebral junction (CVJ), or the craniocervical junction (CCJ) as it is otherwise known, houses the crossroads of the CNS and is composed of the occipital bone that surrounds the foramen magnum, the atlas vertebrae, the axis vertebrae, and their associated ligaments and musculature. The musculoskeletal organization of the CVJ is unique and complex, resulting in a wide range of congenital, developmental, and acquired pathology. The refinements of the transoral approach to the CVJ by the senior author (A.H.M.) in the late 1970s revolutionized the treatment of CVJ pathology. At the same time, a physiological approach to CVJ management was adopted at the University of Iowa Hospitals and Clinics in 1977 based on the stability and motion dynamics of the CVJ and the site of encroachment, incorporating the transoral approach for irreducible ventral CVJ pathology. Since then, approaches and techniques to treat ventral CVJ lesions have evolved. In the last 40 years at University of Iowa Hospitals and Clinics, multiple approaches to the CVJ have evolved and a better understanding of CVJ pathology has been established. In addition, new reduction strategies that have diminished the need to perform ventral decompressive approaches have been developed and implemented. In this era of surgical subspecialization, to properly treat complex CVJ pathology, the CVJ specialist must be trained in skull base transoral and endoscopic endonasal approaches, pediatric and adult CVJ spine surgery, and must understand and be able to treat the complex CSF dynamics present in CVJ pathology to provide the appropriate, optimal, and tailored treatment strategy for each individual patient, both child and adult. This is a comprehensive review of the history and evolution of the transoral approaches, extended transoral approaches, endoscopie assisted transoral approaches, endoscopie endonasal approaches, and CVJ reduction strategies. Incorporating these advancements, the authors update the
Spontaneous emission in stimulated Raman adiabatic passage
Ivanov, P. A.; Vitanov, N. V.; Bergmann, K.
2005-11-15
This work explores the effect of spontaneous emission on the population transfer efficiency in stimulated Raman adiabatic passage (STIRAP). The approach uses adiabatic elimination of weakly coupled density matrix elements in the Liouville equation, from which a very accurate analytic approximation is derived. The loss of population transfer efficiency is found to decrease exponentially with the factor {omega}{sub 0}{sup 2}/{gamma}, where {gamma} is the spontaneous emission rate and {omega}{sub 0} is the peak Rabi frequency. The transfer efficiency increases with the pulse delay and reaches a steady value. For large pulse delay and large spontaneous emission rate STIRAP degenerates into optical pumping.
Adiabatic Hyperspherical Analysis of Realistic Nuclear Potentials
NASA Astrophysics Data System (ADS)
Daily, K. M.; Kievsky, Alejandro; Greene, Chris H.
2015-12-01
Using the hyperspherical adiabatic method with the realistic nuclear potentials Argonne V14, Argonne V18, and Argonne V18 with the Urbana IX three-body potential, we calculate the adiabatic potentials and the triton bound state energies. We find that a discrete variable representation with the slow variable discretization method along the hyperradial degree of freedom results in energies consistent with the literature. However, using a Laguerre basis results in missing energy, even when extrapolated to an infinite number of basis functions and channels. We do not include the isospin T = 3/2 contribution in our analysis.
On black hole spectroscopy via adiabatic invariance
NASA Astrophysics Data System (ADS)
Jiang, Qing-Quan; Han, Yan
2012-12-01
In this Letter, we obtain the black hole spectroscopy by combining the black hole property of adiabaticity and the oscillating velocity of the black hole horizon. This velocity is obtained in the tunneling framework. In particular, we declare, if requiring canonical invariance, the adiabatic invariant quantity should be of the covariant form Iadia = ∮pi dqi. Using it, the horizon area of a Schwarzschild black hole is quantized independently of the choice of coordinates, with an equally spaced spectroscopy always given by ΔA = 8 π lp2 in the Schwarzschild and Painlevé coordinates.
Adiabatic approximation for nucleus-nucleus scattering
Johnson, R.C.
2005-10-14
Adiabatic approximations to few-body models of nuclear scattering are described with emphasis on reactions with deuterons and halo nuclei (frozen halo approximation) as projectiles. The different ways the approximation should be implemented in a consistent theory of elastic scattering, stripping and break-up are explained and the conditions for the theory's validity are briefly discussed. A formalism which links few-body models and the underlying many-body system is outlined and the connection between the adiabatic and CDCC methods is reviewed.
NASA Astrophysics Data System (ADS)
Zhu, Xiaolei; Yarkony, David R.
2016-01-01
We have recently introduced a diabatization scheme, which simultaneously fits and diabatizes adiabatic ab initio electronic wave functions, Zhu and Yarkony J. Chem. Phys. 140, 024112 (2014). The algorithm uses derivative couplings in the defining equations for the diabatic Hamiltonian, Hd, and fits all its matrix elements simultaneously to adiabatic state data. This procedure ultimately provides an accurate, quantifiably diabatic, representation of the adiabatic electronic structure data. However, optimizing the large number of nonlinear parameters in the basis functions and adjusting the number and kind of basis functions from which the fit is built, which provide the essential flexibility, has proved challenging. In this work, we introduce a procedure that combines adiabatic state and diabatic state data to efficiently optimize the nonlinear parameters and basis function expansion. Further, we consider using direct properties based diabatizations to initialize the fitting procedure. To address this issue, we introduce a systematic method for eliminating the debilitating (diabolical) singularities in the defining equations of properties based diabatizations. We exploit the observation that if approximate diabatic data are available, the commonly used approach of fitting each matrix element of Hd individually provides a starting point (seed) from which convergence of the full Hd construction algorithm is rapid. The optimization of nonlinear parameters and basis functions and the elimination of debilitating singularities are, respectively, illustrated using the 1,2,3,41A states of phenol and the 1,21A states of NH3, states which are coupled by conical intersections.
Free energy calculations from adaptive molecular dynamics simulations with adiabatic reweighting
NASA Astrophysics Data System (ADS)
Cao, Lingling; Stoltz, Gabriel; Lelièvre, Tony; Marinica, Mihai-Cosmin; Athènes, Manuel
2014-03-01
We propose an adiabatic reweighting algorithm for computing the free energy along an external parameter from adaptive molecular dynamics simulations. The adaptive bias is estimated using Bayes identity and information from all the sampled configurations. We apply the algorithm to a structural transition in a cluster and to the migration of a crystalline defect along a reaction coordinate. Compared to standard adaptive molecular dynamics, we observe an acceleration of convergence. With the aid of the algorithm, it is also possible to iteratively construct the free energy along the reaction coordinate without having to differentiate the gradient of the reaction coordinate or any biasing potential.
Adiabatic Compression in a Fire Syringe.
ERIC Educational Resources Information Center
Hayn, Carl H.; Baird, Scott C.
1985-01-01
Suggests using better materials in fire syringes to obtain more effective results during demonstrations which show the elevation in temperature upon a very rapid (adiabatic) compression of air. Also describes an experiment (using ignition temperatures) which introduces students to the use of thermocouples for high temperature measurements. (DH)
Apparatus to Measure Adiabatic and Isothermal Processes.
ERIC Educational Resources Information Center
Lamb, D. W.; White, G. M.
1996-01-01
Describes a simple manual apparatus designed to serve as an effective demonstration of the differences between isothermal and adiabatic processes for the general or elementary physics student. Enables students to verify Boyle's law for slow processes and identify the departure from this law for rapid processes and can also be used to give a clear…
Evolution of the spectral index after inflation
Asgari, A.A.; Abbassi, A.H. E-mail: ahabbasi@modares.ac.ir
2014-09-01
In this article we investigate the time evolution of the adiabatic (curvature) and isocurvature (entropy) spectral indices after inflation era for all cosmological scales with two different initial conditions. For this purpose, we first extract an explicit equation for the time evolution of the comoving curvature perturbation (which may be known as the generalized Mukhanov-Sasaki equation). It would be cleared that the evolution of adiabatic spectral index severely depends on the initial conditions moreover, as expected it is constant only for the super-Hubble scales and adiabatic initial conditions. Additionally, the adiabatic spectral index after recombination approaches a constant value for the isocurvature perturbations. Finally, we re-investigate the Sachs-Wolfe effect and show that the fudge factor 1/3 in the adiabatic ordinary Sachs-Wolfe formula must be replaced by 0.4.
Communication: Adiabatic and non-adiabatic electron-nuclear motion: Quantum and classical dynamics
NASA Astrophysics Data System (ADS)
Albert, Julian; Kaiser, Dustin; Engel, Volker
2016-05-01
Using a model for coupled electronic-nuclear motion we investigate the range from negligible to strong non-adiabatic coupling. In the adiabatic case, the quantum dynamics proceeds in a single electronic state, whereas for strong coupling a complete transition between two adiabatic electronic states takes place. It is shown that in all coupling regimes the short-time wave-packet dynamics can be described using ensembles of classical trajectories in the phase space spanned by electronic and nuclear degrees of freedom. We thus provide an example which documents that the quantum concept of non-adiabatic transitions is not necessarily needed if electronic and nuclear motion is treated on the same footing.
Adiabatic circuits: converter for static CMOS signals
NASA Astrophysics Data System (ADS)
Fischer, J.; Amirante, E.; Bargagli-Stoffi, A.; Schmitt-Landsiedel, D.
2003-05-01
Ultra low power applications can take great advantages from adiabatic circuitry. In this technique a multiphase system is used which consists ideally of trapezoidal voltage signals. The input signals to be processed will often come from a function block realized in static CMOS. The static rectangular signals must be converted for the oscillating multiphase system of the adiabatic circuitry. This work shows how to convert the input signals to the proposed pulse form which is synchronized to the appropriate supply voltage. By means of adder structures designed for a 0.13µm technology in a 4-phase system there will be demonstrated, which additional circuits are necessary for the conversion. It must be taken into account whether the data arrive in parallel or serial form. Parallel data are all in one phase and therefore it is advantageous to use an adder structure with a proper input stage, e.g. a Carry Lookahead Adder (CLA). With a serial input stage it is possible to read and to process four signals during one cycle due to the adiabatic 4-phase system. Therefore input signals with a frequency four times higher than the adiabatic clock frequency can be used. This reduces the disadvantage of the slow clock period typical for adiabatic circuits. By means of an 8 bit Ripple Carry Adder (8 bit RCA) the serial reading will be introduced. If the word width is larger than 4 bits the word can be divided in 4 bit words which are processed in parallel. This is the most efficient way to minimize the number of input lines and pads. At the same time a high throughput is achieved.
Adiabatic burst evaporation from bicontinuous nanoporous membranes
Ichilmann, Sachar; Rücker, Kerstin; Haase, Markus; Enke, Dirk
2015-01-01
Evaporation of volatile liquids from nanoporous media with bicontinuous morphology and pore diameters of a few 10 nm is an ubiquitous process. For example, such drying processes occur during syntheses of nanoporous materials by sol–gel chemistry or by spinodal decomposition in the presence of solvents as well as during solution impregnation of nanoporous hosts with functional guests. It is commonly assumed that drying is endothermic and driven by non-equilibrium partial pressures of the evaporating species in the gas phase. We show that nearly half of the liquid evaporates in an adiabatic mode involving burst-like liquid-to-gas conversions. During single adiabatic burst evaporation events liquid volumes of up to 107 μm3 are converted to gas. The adiabatic liquid-to-gas conversions occur if air invasion fronts get unstable because of the built-up of high capillary pressures. Adiabatic evaporation bursts propagate avalanche-like through the nanopore systems until the air invasion fronts have reached new stable configurations. Adiabatic cavitation bursts thus compete with Haines jumps involving air invasion front relaxation by local liquid flow without enhanced mass transport out of the nanoporous medium and prevail if the mean pore diameter is in the range of a few 10 nm. The results reported here may help optimize membrane preparation via solvent-based approaches, solution-loading of nanopore systems with guest materials as well as routine use of nanoporous membranes with bicontinuous morphology and may contribute to better understanding of adsorption/desorption processes in nanoporous media. PMID:25926406
Adiabatic passage with spin locking in Tm3+:YAG
NASA Astrophysics Data System (ADS)
Pascual-Winter, M. F.; Tongning, R. C.; Lauro, R.; Louchet-Chauvet, A.; Chanelière, T.; Le Gouët, J.-L.
2012-08-01
In low-concentration Tm3+:YAG, we observe efficient adiabatic rapid passage (ARP) of thulium nuclear spin over flipping times much longer than T2. Efficient ARP with long flipping time has been observed in monoatomic solids for decades and has been analyzed in terms of spin temperature and of the thermodynamic equilibrium of a coupled spin ensemble. In low-concentration impurity-doped crystals the spin temperature concept may be questioned. A single spin model should be preferred since the impurity ions are weakly coupled together but interact with the numerous off-resonant matrix ions that originate the spin-spin relaxation. The experiment takes place in the context of quantum information investigation, involving impurity-doped crystals, spin hyperpolarization by optical pumping, and optical detection of the spin evolution.
Adiabatic entanglement in two-atom cavity QED
Lazarou, C.; Garraway, B. M.
2008-02-15
We analyze the problem of a single mode field interacting with a pair of two level atoms. The atoms enter and exit the cavity at different times. Instead of using constant coupling, we use time-dependent couplings which represent the spatial dependence of the mode. Although the system evolution is adiabatic for most of the time, a previously unstudied energy crossing plays a key role in the system dynamics when the atoms have a time delay. We show that conditional atom-cavity entanglement can be generated, while for large photon numbers the entangled system has a behavior which can be mapped onto the single atom Jaynes-Cummings model. Exploring the main features of this system we propose simple and fairly robust methods for entangling atoms independently of the cavity, for quantum state mapping, and for implementing SWAP and controlled-NOT (CNOT) gates with atomic qubits.
Chen, Tao; Yan, Fang-Ping
2013-01-01
The integration with different decisions in the supply chain is a trend, since it can avoid the suboptimal decisions. In this paper, we provide an effective intelligent algorithm for a modified joint replenishment and location-inventory problem (JR-LIP). The problem of the JR-LIP is to determine the reasonable number and location of distribution centers (DCs), the assignment policy of customers, and the replenishment policy of DCs such that the overall cost is minimized. However, due to the JR-LIP's difficult mathematical properties, simple and effective solutions for this NP-hard problem have eluded researchers. To find an effective approach for the JR-LIP, a hybrid self-adapting differential evolution algorithm (HSDE) is designed. To verify the effectiveness of the HSDE, two intelligent algorithms that have been proven to be effective algorithms for the similar problems named genetic algorithm (GA) and hybrid DE (HDE) are chosen to compare with it. Comparative results of benchmark functions and randomly generated JR-LIPs show that HSDE outperforms GA and HDE. Moreover, a sensitive analysis of cost parameters reveals the useful managerial insight. All comparative results show that HSDE is more stable and robust in handling this complex problem especially for the large-scale problem. PMID:24453822
Geroux, Chris M.; Deupree, Robert G.
2011-04-10
We are developing a three-dimensional radiation hydrodynamics code to simulate the interaction of convection and pulsation in classical variable stars. One key goal is the ability to carry these simulations to full amplitude in order to compare them with observed light and velocity curves. Previous two-dimensional calculations were prevented from doing this because of drift in the radial coordinate system, due to the algorithm defining radial movement of the coordinate system during the pulsation cycle. We remove this difficulty by defining our coordinate system flow algorithm to require that the mass in a spherical shell remains constant throughout the pulsation cycle. We perform adiabatic test calculations to show that large amplitude solutions repeat over more than 150 pulsation periods. We also verify that the computational method conserves the peak kinetic energy per period, as must be true for adiabatic pulsation models.
Transition time of nonlinear Landau-Zener model in adiabatic limit
NASA Astrophysics Data System (ADS)
Liu, Xuan-Zuo; Tian, Dong-Ping; Chong, Bo
2016-06-01
The impact of nonlinear interaction on the loop structure of lower energy level and on the time evolution curve of canonical momentum which corresponds to the lower eigenstate are analyzed respectively. We find that the curve changes from single-valued to multi-valued as nonlinear interaction grows. The fascinating part is that the time range delimited by turning points in the loop of energy level and the period between two inflexion points on the multi-valued part of the evolution curve of canonical momentum are the same. Therefore, we propose a characteristic time in the transition process of nonlinear Landau-Zener model in adiabatic limit. Last, the physical meaning of the transition time as a measure of how much time the system experiences a structural change which directly results in the breakdown of adiabaticity is discussed.
Semiclassical analysis of the electron-nuclear coupling in electronic non-adiabatic processes
NASA Astrophysics Data System (ADS)
Agostini, Federica; Min, Seung Kyu; Gross, E. K. U.
2015-10-01
In the context of the exact factorization of the electron-nuclear wave function, the coupling between electrons and nuclei beyond the adiabatic regime is encoded (i) in the time-dependent vector and scalar potentials and (ii) in the electron-nuclear coupling operator. The former appear in the Schroedinger-like equation that drives the evolution of the nuclear degrees of freedom, whereas the latter is responsible for inducing non-adiabatic effects in the electronic evolution equation. As we have devoted previous studies to the analysis of the vector and scalar potentials, in this paper we focus on the properties of the electron-nuclear coupling operator, with the aim of describing a numerical procedure to approximate it within a semiclassical treatment of the nuclear dynamics.
Adiabatic Mach-Zehnder Interferometry on a Quantized Bose-Josephson Junction
Lee, Chaohong
2006-10-13
We propose a scheme to achieve Mach-Zehnder interferometry using a quantized Bose-Josephson junction with a negative charging energy. The quantum adiabatic evolution through a dynamical bifurcation is used to accomplish the beam splitting and recombination. The negative charging energy ensures the existence of a path-entangled state which enhances the phase measurement precision to the Heisenberg limit. A feasible detection procedure is also presented. The scheme should be realizable with current technology.
Adiabatic Far Field Sub-Diffraction Imaging
Cang, Hu; Salandrino, Alessandro; Wang, Yuan; Zhang, Xiang
2015-01-01
The limited resolution of a conventional optical imaging system stems from the fact that the fine feature information of an object is carried by evanescent waves, which exponentially decay in space thus cannot reach the imaging plane. We introduce here a new concept of adiabatic lens, which utilizes a geometrically conformal surface to mediate the interference of slowly decompressed electromagnetic waves at far field to form images. The decompression is satisfying an adiabatic condition, and by bridging the gap between far field and near field, it allows far field optical systems to project an image of the near field features directly. Using these designs, we demonstrated the magnification can be up to 20 times and it is possible to achieve sub-50nm imaging resolution in visible. Our approach provides a means to extend the domain of geometrical optics to a deep sub-wavelength scale. PMID:26258769
Shortcuts to adiabaticity from linear response theory.
Acconcia, Thiago V; Bonança, Marcus V S; Deffner, Sebastian
2015-10-01
A shortcut to adiabaticity is a finite-time process that produces the same final state as would result from infinitely slow driving. We show that such shortcuts can be found for weak perturbations from linear response theory. With the help of phenomenological response functions, a simple expression for the excess work is found-quantifying the nonequilibrium excitations. For two specific examples, i.e., the quantum parametric oscillator and the spin 1/2 in a time-dependent magnetic field, we show that finite-time zeros of the excess work indicate the existence of shortcuts. Finally, we propose a degenerate family of protocols, which facilitates shortcuts to adiabaticity for specific and very short driving times. PMID:26565209
Arbitrary qudit gates by adiabatic passage
NASA Astrophysics Data System (ADS)
Rousseaux, B.; Guérin, S.; Vitanov, N. V.
2013-03-01
We derive an adiabatic technique that implements the most general SU(d) transformation in a quantum system of d degenerate states, featuring a qudit. This technique is based on the factorization of the SU(d) transformation into d generalized quantum Householder reflections, each of which is implemented by a two-shot stimulated Raman adiabatic passage with appropriate static phases. The energy of the lasers needed to synthesize a single Householder reflection is shown to be remarkably constant as a function of d. This technique is directly applicable to a linear trapped ion system with d+1 ions. We implement the quantum Fourier transform numerically in a qudit with d=4 (defined as a quartit) as an example.
Trapped Ion Quantum Computation by Adiabatic Passage
Feng Xuni; Wu Chunfeng; Lai, C. H.; Oh, C. H.
2008-11-07
We propose a new universal quantum computation scheme for trapped ions in thermal motion via the technique of adiabatic passage, which incorporates the advantages of both the adiabatic passage and the model of trapped ions in thermal motion. Our scheme is immune from the decoherence due to spontaneous emission from excited states as the system in our scheme evolves along a dark state. In our scheme the vibrational degrees of freedom are not required to be cooled to their ground states because they are only virtually excited. It is shown that the fidelity of the resultant gate operation is still high even when the magnitude of the effective Rabi frequency moderately deviates from the desired value.
Adiabatic Quantum Optimization for Associative Memory Recall
NASA Astrophysics Data System (ADS)
Seddiqi, Hadayat; Humble, Travis
2014-12-01
Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are stored in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.
Shortcuts to adiabaticity from linear response theory
NASA Astrophysics Data System (ADS)
Acconcia, Thiago V.; Bonança, Marcus V. S.; Deffner, Sebastian
2015-10-01
A shortcut to adiabaticity is a finite-time process that produces the same final state as would result from infinitely slow driving. We show that such shortcuts can be found for weak perturbations from linear response theory. With the help of phenomenological response functions, a simple expression for the excess work is found—quantifying the nonequilibrium excitations. For two specific examples, i.e., the quantum parametric oscillator and the spin 1/2 in a time-dependent magnetic field, we show that finite-time zeros of the excess work indicate the existence of shortcuts. Finally, we propose a degenerate family of protocols, which facilitates shortcuts to adiabaticity for specific and very short driving times.
Adiabatic quantum optimization for associative memory recall
Seddiqi, Hadayat; Humble, Travis S.
2014-12-22
Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are storedmore » in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.« less
Adiabatic quantum optimization for associative memory recall
Seddiqi, Hadayat; Humble, Travis S.
2014-12-22
Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are stored in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.
Shortcuts to adiabaticity from linear response theory
Acconcia, Thiago V.; Bonança, Marcus V. S.; Deffner, Sebastian
2015-10-23
A shortcut to adiabaticity is a finite-time process that produces the same final state as would result from infinitely slow driving. We show that such shortcuts can be found for weak perturbations from linear response theory. Moreover, with the help of phenomenological response functions, a simple expression for the excess work is found—quantifying the nonequilibrium excitations. For two specific examples, i.e., the quantum parametric oscillator and the spin 1/2 in a time-dependent magnetic field, we show that finite-time zeros of the excess work indicate the existence of shortcuts. We finally propose a degenerate family of protocols, which facilitates shortcuts to adiabaticity for specific and very short driving times.
Shortcuts to adiabaticity from linear response theory
Acconcia, Thiago V.; Bonança, Marcus V. S.; Deffner, Sebastian
2015-10-23
A shortcut to adiabaticity is a finite-time process that produces the same final state as would result from infinitely slow driving. We show that such shortcuts can be found for weak perturbations from linear response theory. Moreover, with the help of phenomenological response functions, a simple expression for the excess work is found—quantifying the nonequilibrium excitations. For two specific examples, i.e., the quantum parametric oscillator and the spin 1/2 in a time-dependent magnetic field, we show that finite-time zeros of the excess work indicate the existence of shortcuts. We finally propose a degenerate family of protocols, which facilitates shortcuts tomore » adiabaticity for specific and very short driving times.« less
Adiabatic Quantization of Andreev Quantum Billiard Levels
NASA Astrophysics Data System (ADS)
Silvestrov, P. G.; Goorden, M. C.; Beenakker, C. W.
2003-03-01
We identify the time T between Andreev reflections as a classical adiabatic invariant in a ballistic chaotic cavity (Lyapunov exponent λ), coupled to a superconductor by an N-mode constriction. Quantization of the adiabatically invariant torus in phase space gives a discrete set of periods Tn, which in turn generate a ladder of excited states ɛnm=(m+1/2)πℏ/Tn. The largest quantized period is the Ehrenfest time T0=λ-1ln(N. Projection of the invariant torus onto the coordinate plane shows that the wave functions inside the cavity are squeezed to a transverse dimension W/(N), much below the width W of the constriction.
Pulse sequences in photoassociation via adiabatic passage
NASA Astrophysics Data System (ADS)
Li, Xuan; Dupre, William; Parker, Gregory A.
2012-07-01
We perform a detailed study of pulse sequences in a photoassociation via adiabatic passage (PAP) process to transfer population from an ensemble of ultracold atomic clouds to a vibrationally cold molecular state. We show that an appreciable final population of ultracold NaCs molecules can be achieved with optimized pulses in either the ‘counter-intuitive’ (tP > tS) or ‘intuitive’ (tP < tS) PAP pulse sequences, with tP and tS denoting the temporal centers of the pump and Stokes pulses, respectively. By investigating the dependence of the reactive yield on pulse sequences, in a wide range of tP-tS, we show that there is not a fundamental preference to either pulse sequence in a PAP process. We explain this no-sequence-preference phenomenon by analyzing a multi-bound model so that an analogy can be drawn to the conventional stimulated Raman adiabatic passage.
Adiabatic charging of nickel-hydrogen batteries
NASA Technical Reports Server (NTRS)
Lurie, Chuck; Foroozan, S.; Brewer, Jeff; Jackson, Lorna
1995-01-01
Battery management during prelaunch activities has always required special attention and careful planning. The transition from nickel-cadium to nickel-hydrogen batteries, with their high self discharge rate and lower charge efficiency, as well as longer prelaunch scenarios, has made this aspect of spacecraft battery management even more challenging. The AXAF-I Program requires high battery state of charge at launch. The use of active cooling, to ensure efficient charging, was considered and proved to be difficult and expensive. Alternative approaches were evaluated. Optimized charging, in the absence of cooling, appeared promising and was investigated. Initial testing was conducted to demonstrate the feasibility of the 'Adiabatic Charging' approach. Feasibility was demonstrated and additional testing performed to provide a quantitative, parametric data base. The assumption that the battery is in an adiabatic environment during prelaunch charging is a conservative approximation because the battery will transfer some heat to its surroundings by convective air cooling. The amount is small compared to the heat dissipated during battery overcharge. Because the battery has a large thermal mass, substantial overcharge can occur before the cells get too hot to charge efficiently. The testing presented here simulates a true adiabatic environment. Accordingly the data base may be slightly conservative. The adiabatic charge methodology used in this investigation begins with stabilizing the cell at a given starting temperature. The cell is then fully insulated on all sides. Battery temperature is carefully monitored and the charge terminated when the cell temperature reaches 85 F. Charging has been evaluated with starting temperatures from 55 to 75 F.
Advanced Adiabatic Demagnetization Refrigerators for Continuous Cooling
NASA Technical Reports Server (NTRS)
Chu, Paul C. W.
2004-01-01
The research at Houston was focused on optimizing the design of superconducting magnets for advanced adiabatic demagnetization refrigerators (ADRs), assessing the feasibility of using high temperature superconducting (HTS) magnets in ADRs in the future, and developing techniques to deposit HTS thin and thick films on high strength, low thermal conductivity substrates for HTS magnet leads. Several approaches have been tested for the suggested superconducting magnets.
Computer Code For Turbocompounded Adiabatic Diesel Engine
NASA Technical Reports Server (NTRS)
Assanis, D. N.; Heywood, J. B.
1988-01-01
Computer simulation developed to study advantages of increased exhaust enthalpy in adiabatic turbocompounded diesel engine. Subsytems of conceptual engine include compressor, reciprocator, turbocharger turbine, compounded turbine, ducting, and heat exchangers. Focus of simulation of total system is to define transfers of mass and energy, including release and transfer of heat and transfer of work in each subsystem, and relationship among subsystems. Written in FORTRAN IV.
El-Qulity, Said Ali; Mohamed, Ali Wagdy
2016-01-01
This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness. PMID:26819583
El-Qulity, Said Ali; Mohamed, Ali Wagdy
2016-01-01
This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness. PMID:26819583
Siphon flows in isolated magnetic flux tubes. II - Adiabatic flows
NASA Technical Reports Server (NTRS)
Montesinos, Benjamin; Thomas, John H.
1989-01-01
This paper extends the study of steady siphon flows in isolated magnetic flux tubes surrounded by field-free gas to the case of adiabatic flows. The basic equations governing steady adiabatic siphon flows in a thin, isolated magnetic flux tube are summarized, and qualitative features of adiabatic flows in elevated, arched flux tubes are discussed. The equations are then cast in nondimensional form and the results of numerical computations of adiabatic siphon flows in arched flux tubes are presented along with comparisons between isothermal and adiabatic flows. The effects of making the interior of the flux tube hotter or colder than the surrounding atmosphere at the upstream footpoint of the arch is considered. In this case, is it found that the adiabatic flows are qualitatively similar to the isothermal flows, with adiabatic cooling producing quantitative differences. Critical flows can produce a bulge point in the rising part of the arch and a concentration of magnetic flux above the bulge point.
Li, Bai; Chiong, Raymond; Lin, Mu
2015-02-01
Protein structure prediction is a fundamental issue in the field of computational molecular biology. In this paper, the AB off-lattice model is adopted to transform the original protein structure prediction scheme into a numerical optimization problem. We present a balance-evolution artificial bee colony (BE-ABC) algorithm to address the problem, with the aim of finding the structure for a given protein sequence with the minimal free-energy value. This is achieved through the use of convergence information during the optimization process to adaptively manipulate the search intensity. Besides that, an overall degradation procedure is introduced as part of the BE-ABC algorithm to prevent premature convergence. Comprehensive simulation experiments based on the well-known artificial Fibonacci sequence set and several real sequences from the database of Protein Data Bank have been carried out to compare the performance of BE-ABC against other algorithms. Our numerical results show that the BE-ABC algorithm is able to outperform many state-of-the-art approaches and can be effectively employed for protein structure optimization. PMID:25463349
Adiabatic heating in impulsive solar flares
NASA Technical Reports Server (NTRS)
Maetzler, C.; Bai, T.; Crannell, C. J.; Frost, K. J.
1978-01-01
A study is made of adiabatic heating in two impulsive solar flares on the basis of dynamic X-ray spectra in the 28-254 keV range, H-alpha, microwave, and meter-wave radio observations. It is found that the X-ray spectra of the events are like those of thermal bremsstrahlung from single-temperature plasmas in the 10-60 keV range if photospheric albedo is taken into account. The temperature-emission correlation indicates adiabatic compression followed by adiabatic expansion and that the electron distribution remains isotropic. H-alpha data suggest compressive energy transfer. The projected areas and volumes of the flares are estimated assuming that X-ray and microwave emissions are produced in a single thermal plasma. Electron densities of about 10 to the 9th/cu cm are found for homogeneous, spherically symmetric sources. It is noted that the strong self-absorption of hot-plasma gyrosynchrotron radiation reveals low magnetic field strengths.
Non-adiabatic effect on quantum pumping
NASA Astrophysics Data System (ADS)
Uchiyama, Chikako
2014-03-01
We study quantum pumping for an anharmonic junction model which interacts with two kinds of bosonic environments. We provide an expression for the quantum pumping under a piecewise modulation of environmental temperatures with including non-adiabatic effect under Markovian approximation. The obtained formula is an extension of the one expressed with the geometrical phase(Phys. Rev. Lett. 104,170601 (2010)). This extension shows that the quantum pumping depends on the initial condition of the anharmonic junction just before the modulation, as well as the characteristic environmental parameters such as interaction strength and cut-off frequencies of spectral density other than the conditions of modulation. We clarify that the pumping current including non-adiabatic effect can be larger than that under the adiabatic condition. This means that we can find the optimal condition of the current by adjusting these parameters. (The article has been submitted as http://arxiv.org/submit/848201 and will be appeared soon.) This work is supported by a Grant-in-Aid for Scientific Research (B) (KAKENHI 25287098).
An adiabatic approximation for grain alignment theory
NASA Astrophysics Data System (ADS)
Roberge, W. G.
1997-10-01
The alignment of interstellar dust grains is described by the joint distribution function for certain `internal' and `external' variables, where the former describe the orientation of the axes of a grain with respect to its angular momentum, J, and the latter describe the orientation of J relative to the interstellar magnetic field. I show how the large disparity between the dynamical time-scales of the internal and external variables - which is typically 2-3 orders of magnitude - can be exploited to simplify calculations of the required distribution greatly. The method is based on an `adiabatic approximation' which closely resembles the Born-Oppenheimer approximation in quantum mechanics. The adiabatic approximation prescribes an analytic distribution function for the `fast' dynamical variables and a simplified Fokker-Planck equation for the `slow' variables which can be solved straightforwardly using various techniques. These solutions are accurate to O(epsilon), where epsilon is the ratio of the fast and slow dynamical time-scales. As a simple illustration of the method, I derive an analytic solution for the joint distribution established when Barnett relaxation acts in concert with gas damping. The statistics of the analytic solution agree with the results of laborious numerical calculations which do not exploit the adiabatic approximation.
An Adiabatic Approximation for Grain Alignment Theory
NASA Astrophysics Data System (ADS)
Roberge, W. G.
1997-12-01
The alignment of interstellar dust grains is described by the joint distribution function for certain ``internal'' and ``external'' variables, where the former describe the orientation of a grain's axes with respect to its angular momentum, J, and the latter describe the orientation of J relative to the interstellar magnetic field. I show how the large disparity between the dynamical timescales of the internal and external variables--- which is typically 2--3 orders of magnitude--- can be exploited to greatly simplify calculations of the required distribution. The method is based on an ``adiabatic approximation'' which closely resembles the Born-Oppenheimer approximation in quantum mechanics. The adiabatic approximation prescribes an analytic distribution function for the ``fast'' dynamical variables and a simplified Fokker-Planck equation for the ``slow'' variables which can be solved straightforwardly using various techniques. These solutions are accurate to cal {O}(epsilon ), where epsilon is the ratio of the fast and slow dynamical timescales. As a simple illustration of the method, I derive an analytic solution for the joint distribution established when Barnett relaxation acts in concert with gas damping. The statistics of the analytic solution agree with the results of laborious numerical calculations which do not exploit the adiabatic approximation.