Search on a hypercubic lattice using a quantum random walk. I. d > 2

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighboring locations. We construct a quantum random walk algorithm, based on discretization of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, that is, to find a marked vertex on a d-dimensional hypercubic lattice. The restriction on movement hardly matters for d > 2, and scaling behavior close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimize the proportionality constants of the scaling behavior, and demonstrate the approach to that for Grover's algorithm (equivalent to the mean-field theory or the d -> infinity limit). In particular, the scaling behavior for d = 3 is only about 25% higher than the optimal d -> infinity value.

Relaxation system based sub-grid scale modelling for large eddy simulation of Burgers' equation

An implicit sub-grid scale model for large eddy simulation is presented by utilising the concept of a relaxation system for one dimensional Burgers' equation in a novel way. The Burgers' equation is solved for three different unsteady flow situations by varying the ratio of relaxation parameter (epsilon) to time step. The coarse mesh results obtained with a relaxation scheme are compared with the filtered DNS solution of the same problem on a fine mesh using a fourth-order CWENO discretisation in space and third-order TVD Runge-Kutta discretisation in time. The numerical solutions obtained through the relaxation system have the same order of accuracy in space and time and they closely match with the filtered DNS solutions.

A monolithic strategy for fluid-structure interaction problems

In this work, we present a new monolithic strategy for solving fluid-structure interaction problems involving incompressible fluids, within the context of the finite element method. This strategy, similar to the continuum dynamics, conserves certain properties, and thus provides a rational basis for the design of the time-stepping strategy; detailed proofs of the conservation of these properties are provided. The proposed algorithm works with displacement and velocity variables for the structure and fluid, respectively, and introduces no new variables to enforce velocity or traction continuity. Any existing structural dynamics algorithm can be used without change in the proposed method. Use of the exact tangent stiffness matrix ensures that the algorithm converges quadratically within each time step. An analytical solution is presented for one of the benchmark problems used in the literature, namely, the piston problem. A number of benchmark problems including problems involving free surfaces such as sloshing and the breaking dam problem are used to demonstrate the good performance of the proposed method. Copyright (C) 2010 John Wiley & Sons, Ltd.

On the spurious increase in particle volume fraction during coarsening simulations

The problem of spurious increase in volume fraction of second-phase particles during computer simulations of coarsening is examined. The origin of this problem is traced to the use of too long a time step (used for numerical integration of growth rates with respect to time) which leads to small particles with large negative growth rates shrinking to negative radii at the end of the time step. Such a shrinkage to negative sizes has the effect of pumping solute into the system. It is therefore suggested that the length of the time step be chosen in accordance with the size of the smallest particle present in the system. It is shown that spurious increase in particle Volume has a significant effect on the particle size distributions in the scaling regime (making them broader and more skewed in the Lifshitz-Slyozov-Wagner model). Its effect on coarsening kinetics, however, is found to be small.

Coupled Climate Model on Grids

Community Climate System Model (CCSM) is a Multiple Program Multiple Data (MPMD) parallel global climate model comprising atmosphere, ocean, land, ice and coupler components. The simulations have a time-step of the order of tens of minutes and are typically performed for periods of the order of centuries. These climate simulations are highly computationally intensive and can take several days to weeks to complete on most of today’s multi-processor systems. ExecutingCCSM on grids could potentially lead to a significant reduction in simulation times due to the increase in number of processors. However, in order to obtain performance gains on grids, several challenges have to be met. In this work,we describe our load balancing efforts in CCSM to make it suitable for grid enabling.We also identify the various challenges in executing CCSM on grids. Since CCSM is an MPI application, we also describe our current work on building a MPI implementation for grids to grid-enable CCSM.

Algorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of quantum state transfer

We propose an iterative algorithm to simulate the dynamics generated by any n-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator U (unitary) into a product of different time-step unitaries. The algorithm product-decomposes U in a chosen operator basis by identifying a certain symmetry of U that is intimately related to the number of gates in the decomposition. We illustrate the algorithm by first obtaining a polynomial decomposition in the Pauli basis of the n-qubit quantum state transfer unitary by Di Franco et al. [Phys. Rev. Lett. 101, 230502 (2008)] that transports quantum information from one end of a spin chain to the other, and then implement it in nuclear magnetic resonance to demonstrate that the decomposition is experimentally viable. We further experimentally test the resilience of the state transfer to static errors in the coupling parameters of the simulated Hamiltonian. This is done by decomposing and simulating the corresponding imperfect unitaries.

Decoherence suppression by parallelization

Decoherence as an obstacle in quantum computation is viewed as a struggle between two forces [1]: the computation which uses the exponential dimension of Hilbert space, and decoherence which destroys this entanglement by collapse. In this model of decohered quantum computation, a sequential quantum computer loses the battle, because at each time step, only a local operation is carried out but g*(t) number of gates collapse. With quantum circuits computing in parallel way the situation is different- g(t) number of gates can be applied at each time step and number gates collapse because of decoherence. As g(t) ≈ g*(t) competition here is even [1]. Our paper improves on this model by slowing down g*(t) by encoding the circuit in parallel computing architectures and running it in Single Instruction Multiple Data (SIMD) paradigm. We have proposed a parallel ion trap architecture for single-bit rotation of a qubit.

A Nearly Exact Reformulation of the Girsanov Linearization for Stochastically Driven Nonlinear Oscillators

The Girsanov linearization method (GLM), proposed earlier in Saha, N., and Roy, D., 2007, ``The Girsanov Linearisation Method for Stochastically Driven Nonlinear Oscillators,'' J. Appl. Mech., 74, pp. 885-897, is reformulated to arrive at a nearly exact, semianalytical, weak and explicit scheme for nonlinear mechanical oscillators under additive stochastic excitations. At the heart of the reformulated linearization is a temporally localized rejection sampling strategy that, combined with a resampling scheme, enables selecting from and appropriately modifying an ensemble of locally linearized trajectories while weakly applying the Girsanov correction (the Radon-Nikodym derivative) for the linearization errors. The semianalyticity is due to an explicit linearization of the nonlinear drift terms and it plays a crucial role in keeping the Radon-Nikodym derivative ``nearly bounded'' above by the inverse of the linearization time step (which means that only a subset of linearized trajectories with low, yet finite, probability exceeds this bound). Drift linearization is conveniently accomplished via the first few (lower order) terms in the associated stochastic (Ito) Taylor expansion to exclude (multiple) stochastic integrals from the numerical treatment. Similarly, the Radon-Nikodym derivative, which is a strictly positive, exponential (super-) martingale, is converted to a canonical form and evaluated over each time step without directly computing the stochastic integrals appearing in its argument. Through their numeric implementations for a few low-dimensional nonlinear oscillators, the proposed variants of the scheme, presently referred to as the Girsanov corrected linearization method (GCLM), are shown to exhibit remarkably higher numerical accuracy over a much larger range of the time step size than is possible with the local drift-linearization schemes on their own.

A Kushner-Stratonovich Monte Carlo filter applied to nonlinear dynamical system identification

A Monte Carlo filter, based on the idea of averaging over characteristics and fashioned after a particle-based time-discretized approximation to the Kushner-Stratonovich (KS) nonlinear filtering equation, is proposed. A key aspect of the new filter is the gain-like additive update, designed to approximate the innovation integral in the KS equation and implemented through an annealing-type iterative procedure, which is aimed at rendering the innovation (observation prediction mismatch) for a given time-step to a zero-mean Brownian increment corresponding to the measurement noise. This may be contrasted with the weight-based multiplicative updates in most particle filters that are known to precipitate the numerical problem of weight collapse within a finite-ensemble setting. A study to estimate the a-priori error bounds in the proposed scheme is undertaken. The numerical evidence, presently gathered from the assessed performance of the proposed and a few other competing filters on a class of nonlinear dynamic system identification and target tracking problems, is suggestive of the remarkably improved convergence and accuracy of the new filter. (C) 2013 Elsevier B.V. All rights reserved.

An extended finite element model coupled with level set method for stable pitting corrosion

Mass balance between metal and electrolytic solution, separated by a moving interface, in stable pit growth results in a set of governing equations which are solved for concentration field and interface position (pit boundary evolution), which requires only three inputs, namely the solid metal concentration, saturation concentration of the dissolved metal ions and diffusion coefficient. A combined eXtended Finite Element Model (XFEM) and level set method is developed in this paper. The extended finite element model handles the jump discontinuity in the metal concentrations at the interface, by using discontinuous-derivative enrichment formulation for concentration discontinuity at the interface. This eliminates the requirement of using front conforming mesh and re-meshing after each time step as in conventional finite element method. A numerical technique known as level set method tracks the position of the moving interface and updates it over time. Numerical analysis for pitting corrosion of stainless steel 304 is presented. The above proposed method is validated by comparing the numerical results with experimental results, exact solutions and some other approximate solutions.

An extended finite-element model coupled with level set method for analysis of growth of corrosion pits in metallic structures

Mass balance between metal and electrolytic solution, separated by a moving interface, in stable pit growth results in a set of governing equations which are solved for concentration field and interface position (pit boundary evolution). The interface experiences a jump discontinuity in metal concentration. The extended finite-element model (XFEM) handles this jump discontinuity by using discontinuous-derivative enrichment formulation, eliminating the requirement of using front conforming mesh and re-meshing after each time step as in the conventional finite-element method. However, prior interface location is required so as to solve the governing equations for concentration field for which a numerical technique, the level set method, is used for tracking the interface explicitly and updating it over time. The level set method is chosen as it is independent of shape and location of the interface. Thus, a combined XFEM and level set method is developed in this paper. Numerical analysis for pitting corrosion of stainless steel 304 is presented. The above proposed model is validated by comparing the numerical results with experimental results, exact solutions and some other approximate solutions. An empirical model for pitting potential is also derived based on the finite-element results. Studies show that pitting profile depends on factors such as ion concentration, solution pH and temperature to a large extent. Studying the individual and combined effects of these factors on pitting potential is worth knowing, as pitting potential directly influences corrosion rate.

Volume conservation issues in incompressible smoothed particle hydrodynamics

A divergence-free velocity field is usually sought in numerical simulations of incompressible fluids. We show that the particle methods that compute a divergence-free velocity field to achieve incompressibility suffer from a volume conservation issue when a finite time-step position update scheme is used. Further, we propose a deformation gradient based approach to arrive at a velocity field that reduces the volume conservation issues in free surface flows and maintains density uniformity in internal flows while retaining the simplicity of first order time updates. (C) 2015 Elsevier Inc. All rights reserved.

Crack propagation in graphene

The crack initiation and growth mechanisms in an 2D graphene lattice structure are studied based on molecular dynamics simulations. Crack growth in an initial edge crack model in the arm-chair and the zig-zag lattice configurations of graphene are considered. Influence of the time steps on the post yielding behaviour of graphene is studied. Based on the results, a time step of 0.1 fs is recommended for consistent and accurate simulation of crack propagation. Effect of temperature on the crack propagation in graphene is also studied, considering adiabatic and isothermal conditions. Total energy and stress fields are analyzed. A systematic study of the bond stretching and bond reorientation phenomena is performed, which shows that the crack propagates after significant bond elongation and rotation in graphene. Variation of the crack speed with the change in crack length is estimated. (C) 2015 AIP Publishing LLC.

Weakly corrected numerical solutions to stochastically driven nonlinear dynamical systems

A method to weakly correct the solutions of stochastically driven nonlinear dynamical systems, herein numerically approximated through the Eule-Maruyama (EM) time-marching map, is proposed. An essential feature of the method is a change of measures that aims at rendering the EM-approximated solution measurable with respect to the filtration generated by an appropriately defined error process. Using Ito's formula and adopting a Monte Carlo (MC) setup, it is shown that the correction term may be additively applied to the realizations of the numerically integrated trajectories. Numerical evidence, presently gathered via applications of the proposed method to a few nonlinear mechanical oscillators and a semi-discrete form of a 1-D Burger's equation, lends credence to the remarkably improved numerical accuracy of the corrected solutions even with relatively large time step sizes. (C) 2015 Elsevier Inc. All rights reserved.

Numerical simulation of rock failure and earthquake process on mesoscopic scale

On the basis of the lattice model of MORA and PLACE, Discrete Element Method, and Molecular Dynamics approach, another kind of numerical model is developed. The model consists of a 2-D set of particles linked by three kinds of interactions and arranged into triangular lattice. After the fracture criterion and rules of changes between linking states are given, the particle positions, velocities and accelerations at every time step are calculated using a finite-difference scheme, and the configuration of particles can be gained step by step. Using this model, realistic fracture simulations of brittle solid (especially under pressure) and simulation of earthquake dynamics are made.