Search results for "algorithm."
showing 10 items of 4617 documents
Dynamical learning of a photonics quantum-state engineering process
2021
Abstract. Experimental engineering of high-dimensional quantum states is a crucial task for several quantum information protocols. However, a high degree of precision in the characterization of the noisy experimental apparatus is required to apply existing quantum-state engineering protocols. This is often lacking in practical scenarios, affecting the quality of the engineered states. We implement, experimentally, an automated adaptive optimization protocol to engineer photonic orbital angular momentum (OAM) states. The protocol, given a target output state, performs an online estimation of the quality of the currently produced states, relying on output measurement statistics, and determine…
Variable time amplitude amplification and quantum algorithms for linear algebra problems
2012
Quantum amplitude amplification is a method of increasing a success probability of an algorithm from a small epsilon>0 to Theta(1) with less repetitions than classically. In this paper, we generalize quantum amplitude amplification to the case when parts of the algorithm that is being amplified stop at different times. We then apply the new variable time amplitude amplification to give two new quantum algorithms for linear algebra problems. Our first algorithm is an improvement of Harrow et al. algorithm for solving systems of linear equations. We improve the running time of the algorithm from O(k^2 log N) to O(k log^3 k log N) where k is the condition number of the system of equations. …
A comprehensive probabilistic analysis of approximate SIR‐type epidemiological models via full randomized discrete‐time Markov chain formulation with…
2020
Spanish Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P; Generalitat Valenciana, Grant/Award Number: APOSTD/2019/128; Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P
Impact of the erase algorithms on flash memory lifetime
2017
This paper presents a comparative study on the impact of the erase algorithm on flash memory lifetime, to demonstrate how the reduction of overall stress, suffered by memories, will increase their lifetime, thanks to a smart management of erase operations. To this purpose a fixed erase voltage, equal to the maximum value and the maximum time-window, was taken as the reference test; while an algorithm with adaptive voltage levels and the same overall time-window was designed and implemented in order to compare their experimental results. This study was carried out by using an innovative Automated Test Equipment, named Portable-ATE, tailored for Memory Test Chip and designed for performance e…
Maximum Torque Per Ampere control algorithm for low saliency ratio interior permanent magnet synchronous motors
2017
This paper presents an investigation on the comparison between the Maximum Torque Per Ampere (MTPA) and the Field Orientation Control (FOC) algorithms for interior permanent magnet synchronous machines (IPMSMs). In particular, this study was carried out on a small-power IPMSM with low salience ratio. Both control algorithms have been implemented in the Matlab/Simulink environment, obtaining promising results.
Experimental comparison of two control algorithms for low-saliency ratio interior permanent magnet synchronous motors
2018
In this paper, an experimental investigation on the comparison between the Maximum Torque Per Ampere (MTPA) and the Field Orientation Control (FOC) algorithms for interior permanent magnet synchronous machines (IPMSMs) is described, analyzed and discussed. This investigation was carried out on a small-power IPMSM with low saliency ratio. More in detail, after a previous simulation study, the control techniques have been experimentally implemented and validated through means of a dSPACE® rapid prototyping system. The performances of the two algorithms have been evaluated and compared, obtaining interesting results.
Enhanced loss model algorithm for interior permanent magnet synchronous machines
2017
This paper presents an experimental study on the impact of the parameter variations over the performances of a LMA (Loss Model Algorithm) designed for an IPMSM (Interior Permanent Magnet Synchronous Machine). In a previous work, the characterization was carried out by assessing, for several working conditions, the motor parameters that influence the motor efficiency. The proposed enhanced loss model algorithm is implemented in a rapid prototyping system and its performances, in term of efficiency, are compared with other control systems, obtaining promising results.
Data Reweighting in Metadynamics Simulations.
2020
The data collected along a metadynamics simulation can be used to recover information about the underlying unbiased system by means of a reweighting procedure. Here, we analyze the behavior of several reweighting techniques in terms of the quality of the reconstruction of the underlying unbiased free energy landscape in the early stages of the simulation and propose a simple reweighting scheme that we relate to the other techniques. We then show that the free energy landscape reconstructed from reweighted data can be more accurate than the negative bias potential depending on the reweighting technique, the stage of the simulation, and the adoption of well-tempered or standard metadynamics. …
Smoothed Spherical Truncation based on Fuzzy Membership Functions: Application to the Molecular Encoding.
2019
A novel spherical truncation method, based on fuzzy membership functions, is introduced to truncate interatomic (or interaminoacid) relations according to smoothing values computed from fuzzy membership degrees. In this method, the molecules are circumscribed into a sphere, so that the geometric centers of the molecules are the centers of the spheres. The fuzzy membership degree of each atom (or aminoacid) is computed from its distance with respect to the geometric center of the molecule, by using a fuzzy membership function. So, the smoothing value to be applied in the truncation of a relation (or interaction) is computed by averaging the fuzzy membership degrees of the atoms (or aminoacid…
Contextuality-by-Default: A Brief Overview of Ideas, Concepts, and Terminology
2016
This paper is a brief overview of the concepts involved in measuring the degree of contextuality and detecting contextuality in systems of binary measurements of a finite number of objects. We discuss and clarify the main concepts and terminology of the theory called “contextuality-by-default,” and then discuss generalizations of the theory to arbitrary systems of arbitrary random variables.