Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections

This work focuses on the iterative solution of sequences of KKT linear systems arising in interior point methods applied to large convex quadratic programming problems. This task is the computational core of the interior point procedure and an efficient preconditioning strategy is crucial for the efficiency of the overall method. Constraint preconditioners are very effective in this context; nevertheless, their computation may be very expensive for large-scale problems, and resorting to approximations of them may be convenient. Here we propose a procedure for building inexact constraint preconditioners by updating a "seed" constraint preconditioner computed for a KKT matrix at a previous interior point iteration. These updates are obtained through low-rank corrections of the Schur complement of the (1,1) block of the seed preconditioner. The updated preconditioners are analyzed both theoretically and computationally. The results obtained show that our updating procedure, coupled with an adaptive strategy for determining whether to reinitialize or update the preconditioner, can enhance the performance of interior point methods on large problems.Comment: 22 page

Robust optimal quantum gates for Josephson charge qubits

Quantum optimal control theory allows to design accurate quantum gates. We employ it to design high-fidelity two-bit gates for Josephson charge qubits in the presence of both leakage and noise. Our protocol considerably increases the fidelity of the gate and, more important, it is quite robust in the disruptive presence of 1/f noise. The improvement in the gate performances discussed in this work (errors of the order of 10^{-3}-10^{-4} in realistic cases) allows to cross the fault tolerance threshold.Comment: 4 pages, 4 figure

Quasi-classical versus non-classical spectral asymptotics for magnetic Schroedinger operators with decreasing electric potentials

We consider the Schroedinger operator H on L^2(R^2) or L^2(R^3) with constant magnetic field and electric potential V which typically decays at infinity exponentially fast or has a compact support. We investigate the asymptotic behaviour of the discrete spectrum of H near the boundary points of its essential spectrum. If the decay of V is Gaussian or faster, this behaviour is non-classical in the sense that it is not described by the quasi-classical formulas known for the case where V admits a power-like decay.Comment: Corrected versio

Emergence of Consensus in a Multi-Robot Network: from Abstract Models to Empirical Validation

Consensus dynamics in decentralised multiagent systems are subject to intense studies, and several different models have been proposed and analysed. Among these, the naming game stands out for its simplicity and applicability to a wide range of phenomena and applications, from semiotics to engineering. Despite the wide range of studies available, the implementation of theoretical models in real distributed systems is not always straightforward, as the physical platform imposes several constraints that may have a bearing on the consensus dynamics. In this paper, we investigate the effects of an implementation of the naming game for the kilobot robotic platform, in which we consider concurrent execution of games and physical interferences. Consensus dynamics are analysed in the light of the continuously evolving communication network created by the robots, highlighting how the different regimes crucially depend on the robot density and on their ability to spread widely in the experimental arena. We find that physical interferences reduce the benefits resulting from robot mobility in terms of consensus time, but also result in lower cognitive load for individual agents

On the Joint Distribution of Energy Levels of Random Schroedinger Operators

We consider operators with random potentials on graphs, such as the lattice version of the random Schroedinger operator. The main result is a general bound on the probabilities of simultaneous occurrence of eigenvalues in specified distinct intervals, with the corresponding eigenfunctions being separately localized within prescribed regions. The bound generalizes the Wegner estimate on the density of states. The analysis proceeds through a new multiparameter spectral averaging principle

Predicting the cosmological constant with the scale-factor cutoff measure

It is well known that anthropic selection from a landscape with a flat prior distribution of cosmological constant Lambda gives a reasonable fit to observation. However, a realistic model of the multiverse has a physical volume that diverges with time, and the predicted distribution of Lambda depends on how the spacetime volume is regulated. We study a simple model of the multiverse with probabilities regulated by a scale-factor cutoff, and calculate the resulting distribution, considering both positive and negative values of Lambda. The results are in good agreement with observation. In particular, the scale-factor cutoff strongly suppresses the probability for values of Lambda that are more than about ten times the observed value. We also discuss several qualitative features of the scale-factor cutoff, including aspects of the distributions of the curvature parameter Omega and the primordial density contrast Q.Comment: 16 pages, 6 figures, 2 appendice

Optimal control technique for Many Body Quantum Systems dynamics

We present an efficient strategy for controlling a vast range of non-integrable quantum many body one-dimensional systems that can be merged with state-of-the-art tensor network simulation methods like the density Matrix Renormalization Group. To demonstrate its potential, we employ it to solve a major issue in current optical-lattice physics with ultra-cold atoms: we show how to reduce by about two orders of magnitudes the time needed to bring a superfluid gas into a Mott insulator state, while suppressing defects by more than one order of magnitude as compared to current experiments [1]. Finally, we show that the optimal pulse is robust against atom number fluctuations.Comment: 5 pages, 4 figures, published versio

SiPM and front-end electronics development for Cherenkov light detection

The Italian Institute of Nuclear Physics (INFN) is involved in the development of a demonstrator for a SiPM-based camera for the Cherenkov Telescope Array (CTA) experiment, with a pixel size of 6$\times$6 mm$^2$. The camera houses about two thousands electronics channels and is both light and compact. In this framework, a R&D program for the development of SiPMs suitable for Cherenkov light detection (so called NUV SiPMs) is ongoing. Different photosensors have been produced at Fondazione Bruno Kessler (FBK), with different micro-cell dimensions and fill factors, in different geometrical arrangements. At the same time, INFN is developing front-end electronics based on the waveform sampling technique optimized for the new NUV SiPM. Measurements on 1$\times$1 mm$^2$, 3$\times$3 mm$^2$, and 6$\times$6 mm$^2$ NUV SiPMs coupled to the front-end electronics are presentedComment: In Proceedings of the 34th International Cosmic Ray Conference (ICRC2015), The Hague, The Netherlands. All CTA contributions at arXiv:1508.0589

Properties making a chaotic system a good Pseudo Random Number Generator

We discuss two properties making a deterministic algorithm suitable to generate a pseudo random sequence of numbers: high value of Kolmogorov-Sinai entropy and high-dimensionality. We propose the multi dimensional Anosov symplectic (cat) map as a Pseudo Random Number Generator. We show what chaotic features of this map are useful for generating Pseudo Random Numbers and investigate numerically which of them survive in the discrete version of the map. Testing and comparisons with other generators are performed.Comment: 10 pages, 3 figures, new version, title changed and minor correction