相关论文: Optimal identification of non-Markovian environmen…
Detuned systems can spontaneously achieve a synchronous dynamics and display robust quantum correlations in different local and global dissipation regimes. Beyond the Markovian limit, information backflow from the environment becomes a…
In this paper, a gradient-free distributed algorithm is introduced to solve a set constrained optimization problem under a directed communication network. Specifically, at each time-step, the agents locally compute a so-called…
Non-Markovian local in time master equations give a relatively simple way to describe the dynamics of open quantum systems with memory effects. Despite their simple form, there are still many misunderstandings related to the physical…
In this paper, we propose a stochastic search algorithm for solving general optimization problems with little structure. The algorithm iteratively finds high quality solutions by randomly sampling candidate solutions from a parameterized…
The identification of environmental changes is crucial in many fields. The present research is aimed at investigating the optimal performance for detecting change points in a quantum system when its Hamiltonian suddenly changes at a…
A new method for stochastic control based on neural networks and using randomisation of discrete random variables is proposed and applied to optimal stopping time problems. The method models directly the policy and does not need the…
Master equations describing open quantum dynamics are typically first order differential equations. When such dynamics brings the trajectories in state space of more than one initial state to the same point at finite instants in time, the…
We consider stochastic systems of interacting particles or agents, with dynamics determined by an interaction kernel which only depends on pairwise distances. We study the problem of inferring this interaction kernel from observations of…
We put forward a measure based on Gaussian steering to quantify the non-Markovianity of continuous-variable (CV) Gaussian quantum channels. We employ the proposed measure to assess and compare the non-Markovianity of a quantum Brownian…
We discuss convergence and coupling of Markov chains, and present general relations between the transfer matrices describing these two processes. We then analyze a recently developed local-patch algorithm, which computes rigorous upper…
A crucial task in system identification problems is the selection of the most appropriate model class, and is classically addressed resorting to cross-validation or using asymptotic arguments. As recently suggested in the literature, this…
Accessing the physical mechanisms behind non-Markovian phenomena in open quantum dynamics requires the study of the statistical properties of the joint system-environment dynamics. This is impossible at the level of the reduced dynamics of…
Stochastic optimization naturally arises in machine learning. Efficient algorithms with provable guarantees, however, are still largely missing, when the objective function is nonconvex and the data points are dependent. This paper studies…
The identification of electrical, mechanical, and biological systems using data can benefit greatly from prior knowledge extracted from physical modeling. Parametric continuous-time identification methods can naturally incorporate this…
We study an open quantum spin chain with non-reciprocal dissipation using a theoretical approach known as time-dependent generalized Gibbs ensemble. In the regime of weak dissipation the system is fully characterized by its rapidity…
This paper considers a distributed stochastic non-convex optimization problem, where the nodes in a network cooperatively minimize a sum of $L$-smooth local cost functions with sparse gradients. By adaptively adjusting the stepsizes…
We consider the problem of identifying a dissipative linear model of an unknown nonlinear system that is known to be dissipative, from time domain input-output data. We first learn an approximate linear model of the nonlinear system using…
I investigate the problem of optimally discriminating between two open quantum dynamical processes in a single-shot scenario, with the goal of minimizing the error probability of identification. This task involves optimising both the input…
We develop a first-order (pseudo-)gradient approach for optimizing functions over the stationary distribution of discrete-time Markov chains (DTMC). We give insights into why solving this optimization problem is challenging and show how…
Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This paper presents a unified analysis framework for distributed…