Search results for "Speedup"
showing 10 items of 97 documents
Slowdown and speedup of light pulses using the self-compensating photorefractive response
2011
We study theoretically the effects of pulse slowdown and speedup in ferroelectric Sn2P2S6 possessing a self-compensating photorefractive response. It is shown that both these effects can be implemented in one sample for sufficiently large values of the coupling strength. In contrast to other types of the photorefractive response (local and nonlocal), the output pulses do not suffer from strong spatial amplification and broadening.
Time-optimal control of the purification of a qubit in contact with a structured environment
2019
We investigate the time-optimal control of the purification of a qubit interacting with a structured environment, consisting of a strongly coupled two-level defect in interaction with a thermal bath. On the basis of a geometric analysis, we show for weak and strong interaction strengths that the optimal control strategy corresponds to a qubit in resonance with the reservoir mode. We investigate under which conditions qubit coherence and correlation between the qubit and the environment can speed up the control process.
Memory expansion for diffusion coefficients
1998
We present a memory expansion for macroscopic transport coefficients such as the collective and tracer diffusion coefficients ${D}_{C}$ and ${D}_{T},$ respectively. The successive terms in this expansion for ${D}_{C}$ describe rapidly decaying memory effects of the center-of-mass motion, leading to fast convergence when evaluated numerically. For ${D}_{T},$ one obtains an expansion of similar form that contains terms describing memory effects in single-particle motion. As an example we evaluate ${D}_{C}$ and ${D}_{T}$ for three strongly interacting surface systems through Monte Carlo simulations, and for a simple model diffusion system via molecular dynamics calculations. We show that the n…
Charge dynamics in molecular junctions: nonequilibrium Green's function approach made fast
2014
Real-time Green's function simulations of molecular junctions (open quantum systems) are typically performed by solving the Kadanoff-Baym equations (KBE). The KBE, however, impose a serious limitation on the maximum propagation time due to the large memory storage needed. In this work we propose a simplified Green's function approach based on the Generalized Kadanoff-Baym Ansatz (GKBA) to overcome the KBE limitation on time, significantly speed up the calculations, and yet stay close to the KBE results. This is achieved through a twofold advance: first we show how to make the GKBA work in open systems and then construct a suitable quasi-particle propagator that includes correlation effects …
Quantum Property Testing for Bounded-Degree Graphs
2011
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion, we also prove an Omega(N^(1/4)) quantum query lower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness. The quantum lower bound is obtained by the polynomial method, using novel algebraic techniques and combinatorial analysis to accommodate the graph s…
Parallelization of the Wolff single-cluster algorithm.
2010
A parallel [open multiprocessing (OpenMP)] implementation of the Wolff single-cluster algorithm has been developed and tested for the three-dimensional (3D) Ising model. The developed procedure is generalizable to other lattice spin models and its effectiveness depends on the specific application at hand. The applicability of the developed methodology is discussed in the context of the applications, where a sophisticated shuffling scheme is used to generate pseudorandom numbers of high quality, and an iterative method is applied to find the critical temperature of the 3D Ising model with a great accuracy. For the lattice with linear size L=1024, we have reached the speedup about 1.79 times …
Retrained Classification of Tyrosinase Inhibitors and “In Silico” Potency Estimation by Using Atom-Type Linear Indices
2012
In this paper, the authors present an effort to increase the applicability domain (AD) by means of retraining models using a database of 701 great dissimilar molecules presenting anti-tyrosinase activity and 728 drugs with other uses. Atom-based linear indices and best subset linear discriminant analysis (LDA) were used to develop individual classification models. Eighteen individual classification-based QSAR models for the tyrosinase inhibitory activity were obtained with global accuracy varying from 88.15-91.60% in the training set and values of Matthews correlation coefficients (C) varying from 0.76-0.82. The external validation set shows globally classifications above 85.99% and 0.72 fo…
Quantumness and speedup limit of a qubit under transition frequency modulation
2022
Controlling and maintaining quantum properties of an open quantum system along its evolution is essential for both fundamental and technological aims. We assess the capability of a frequency-modulated qubit embedded in a leaky cavity to exhibit enhancement of its dynamical quantum features. The qubit transition frequency is sinusoidally modulated by an external driving field. We show that a properly optimized quantum witness effectively identifies quantum coherence protection due to frequency modulation while a standard quantum witness fails. We also find an evolution speedup of the qubit through proper manipulation of the modulation parameters of the driving field. Importantly, by introduc…
Cost-effective Multiresolution schemes for Shock Computations
2009
Harten's Multiresolution framework has provided a fruitful environment for the development of adaptive codes for hyperbolic PDEs. The so-called cost-effective alternative [4,8,21] seeks to achieve savings in the computational cost of the underlying numerical technique, but not in the overall memory requirements of the code. Since the data structure of the basic algorithm does not need to be modified, it provides a set of tools that can be easily implemented into existing codes and that can be very useful in order to speed up the numerical simulations involved in the testing process that is associated to the development of new numerical schemes. In this paper we present two different applica…
Well-Balanced Adaptive Mesh Refinement for shallow water flows
2014
Well-balanced shock capturing (WBSC) schemes constitute nowadays the state of the art in the numerical simulation of shallow water flows. They allow to accurately represent discontinuous behavior, known to occur due to the non-linear hyperbolic nature of the shallow water system, and, at the same time, numerically maintain stationary solutions. In situations of practical interest, these schemes often need to be combined with some kind of adaptivity, in order to speed up computing times. In this paper we discuss what ingredients need to be modified in a block-structured AMR technique in order to ensure that, when combined with a WBSC scheme, the so-called 'water at rest' stationary solutions…