1000 resultados para Solovay-Kitaev algorithm


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the scaling behavior of the fidelity (F) in the thermodynamic limit using the examples of a system of Dirac fermions in one dimension and the Kitaev model on a honeycomb lattice. We show that the thermodynamic fidelity inside the gapless as well as gapped phases follow power-law scalings, with the power given by some of the critical exponents of the system. The generic scaling forms of F for an anisotropic quantum critical point for both the thermodynamic and nonthermodynamic limits have been derived and verified for the Kitaev model. The interesting scaling behavior of F inside the gapless phase of the Kitaev model is also discussed. Finally, we consider a rotation of each spin in the Kitaev model around the z axis and calculate F through the overlap between the ground states for the angle of rotation eta and eta + d eta, respectively. We thereby show that the associated geometric phase vanishes. We have supplemented our analytical calculations with numerical simulations wherever necessary.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the scaling behavior of the fidelity (F) in the thermodynamic limit using the examples of a system of Dirac fermions in one dimension and the Kitaev model on a honeycomb lattice.We show that the thermodynamic fidelity inside the gapless as well as gapped phases follow power-law scalings, with the power given by some of the critical exponents of the system. The generic scaling forms of F for an anisotropic quantum critical point for both the thermodynamic and nonthermodynamic limits have been derived and verified for the Kitaev model. The interesting scaling behavior of F inside the gapless phase of the Kitaev model is also discussed. Finally, we consider a rotation of each spin in the Kitaev model around the z axis and calculate F through the overlap between the ground states for the angle of rotation η and η + dη, respectively. We thereby show that the associated geometric phase vanishes. We have supplemented our analytical calculations with numerical simulations wherever necessary

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Genetic Algorithms (GAs) are recognized as an alternative class of computational model, which mimic natural evolution to solve problems in a wide domain including machine learning, music generation, genetic synthesis etc. In the present study Genetic Algorithm has been employed to obtain damage assessment of composite structural elements. It is considered that a state of damage can be modeled as reduction in stiffness. The task is to determine the magnitude and location of damage. In a composite plate that is discretized into a set of finite elements, if a jth element is damaged, the GA based technique will predict the reduction in Ex and Ey and the location j. The fact that the natural frequency decreases with decrease in stiffness is made use of in the method. The natural frequency of any two modes of the damaged plates for the assumed damage parameters is facilitated by the use of Eigen sensitivity analysis. The Eigen value sensitivities are the derivatives of the Eigen values with respect to certain design parameters. If ωiu is the natural frequency of the ith mode of the undamaged plate and ωid is that of the damaged plate, with δωi as the difference between the two, while δωk is a similar difference in the kth mode, R is defined as the ratio of the two. For a random selection of Ex,Ey and j, a ratio Ri is obtained. A proper combination of Ex,Ey and j which makes Ri−R=0 is obtained by Genetic Algorithm.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Stirred tank bioreactors, employed in the production of a variety of biologically active chemicals, are often operated in batch, fed-batch, and continuous modes of operation. The optimal design of bioreactor is dependent on the kinetics of the biological process, as well as the performance criteria (yield, productivity, etc.) under consideration. In this paper, a general framework is proposed for addressing the two key issues related to the optimal design of a bioreactor, namely, (i) choice of the best operating mode and (ii) the corresponding flow rate trajectories. The optimal bioreactor design problem is formulated with initial conditions and inlet and outlet flow rate trajectories as decision variables to maximize more than one performance criteria (yield, productivity, etc.) as objective functions. A computational methodology based on genetic algorithm approach is developed to solve this challenging multiobjective optimization problem with multiple decision variables. The applicability of the algorithm is illustrated by solving two challenging problems from the bioreactor optimization literature.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This letter presents a microprocessor-based algorithm for calculating symmetrical components from the distorted transient voltage and current signals in a power system. The fundamental frequency components of the 3-phase signals are first extracted using an algorithm based on Haar functions and then "symmetrical-component transformation is applied to obtain the sequence components. The algorithm presented is computationally efficient and fast. This algorithm is better suited for application in microprocessor-based protection schemes of synchronous and induction machines.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper reports the results of employing an artificial bee colony search algorithm for synthesizing a mutually coupled lumped-parameter ladder-network representation of a transformer winding, starting from its measured magnitude frequency response. The existing bee colony algorithm is suitably adopted by appropriately defining constraints, inequalities, and bounds to restrict the search space and thereby ensure synthesis of a nearly unique ladder network corresponding to each frequency response. Ensuring near-uniqueness while constructing the reference circuit (i.e., representation of healthy winding) is the objective. Furthermore, the synthesized circuits must exhibit physical realizability. The proposed method is easy to implement, time efficient, and problems associated with the supply of initial guess in existing methods are circumvented. Experimental results are reported on two types of actual, single, and isolated transformer windings (continuous disc and interleaved disc).