SearcharxivSearch

arXiv subjects

Hilbert Kappen

Publications and source records attributed to Hilbert Kappen.

13 recordsLinked to original sources

A Bayesian formulation of hybrid quantum-classical dynamics

We develop a Bayesian formulation of diffusive quantum-classical dynamics by treating the wave function and classical variables as components of an ordinary stochastic process. The joint probability density P(\psi,x,t) obeys a classical Fokker-Planck equation, while the quantum state appears as its second moment. Requiring this second moment to evolve linearly and autonomously yields the hybrid Lindblad equation and its stochastic unravelings. This construction makes positivity and unraveling freedom immediate and gives a unified description of quantum noise, classical noise, and their correlations through the covariance matrices (C,\Gamma,Q). The same stochastic representation turns quantum-classical state estimation into a classical hidden-state inference problem. Filtering and smoothing are Bayesian conditioning on the observed classical trajectory. We recover the stochastic master equation from the Kushner-Stratonovich equation with correlated noise and show how the quantum effect operator is related to the Bayesian backward message through the adjoint dynamics of the linear unraveling. The Bayesian posterior also defines a smoothed density matrix and, more generally, a posterior distribution over latent quantum-classical trajectories. These quantities can be approximated with standard particle filtering and smoothing methods. Numerical examples show that smoothing improves reconstruction of a hidden quantum-classical trajectory and that the full trajectory posterior can retain structure, such as multimodality, that is absent from its density-matrix second moment. The resulting framework connects quantum filtering, retrodiction, and smoothing to the standard forward-backward machinery of Bayesian time-series inference.

quant-ph

Contracting Tensor Networks with Generalized Belief Propagation

Recent years have seen a growing interest in the use of belief propagation - an algorithm originally introduced for performing statistical inference on graphical models - for approximate, but highly efficient, tensor network contraction. Here, we detail how to apply generalized belief propagation (GBP) - where messages are passed within a hierarchy of overlapping regions of the tensor network - to approximately contract tensor networks and obtain accurate results. The original belief propagation algorithm is a corner case of this approach, corresponding to a particularly simple choice of regions of the tensor network. We implement the GBP algorithm for a number of different region choices on a range of two- and three-dimensional, infinite and finite tensor networks, solving the corresponding fixed point equations both numerically and, in certain tractable cases, analytically. Our examples include calculating the partition function of the fully frustrated Ising model, computing the ground state degeneracy of three-dimensional ice models, measuring observables on the deformed AKLT quantum state and evaluating the norm of randomly generated tensor network states.

quant-ph

Path Integral Quantum Control for Quantum Chemistry Applications

The Path integral Quantum Control (PiQC) algorithm was recently introduced by Villanueva et al. (2025) as a new approach for computing optimal controls in open and closed quantum systems. Originally proposed for pulse-based quantum control, PiQC estimates optimal controls through global averages over quantum trajectories. In this work, we adapt the PiQC algorithm to optimize parametrized quantum circuits by showing that the quantum circuit can be randomized using a continuous dynamics governed by a stochastic Schr\"odinger equation that is compatible with the path integral control framework. In this adaptation, the circuit parameters become the controls to be optimized within PiQC. We refer to this instance of PiQC as the Gate-based PiQC (GB-PiQC) algorithm. We apply GB-PiQC for ground state preparation of electronic structure problems. We benchmark the gate-based and pulse-based versions of PiQC against the Variational Quantum Eigensolver (VQE), which is optimized using the common Simultaneous Perturbation Stochastic Approximation (SPSA) optimizer, on a set of standard molecular Hamiltonians: H2, LiH, BeH2, and H4, mapped to 2-, 4-, 6-, and 6-qubit systems, respectively. For each molecule, the benchmark is implemented at different bond distances, after performing a hyperparameter tuning of each algorithm at a fixed bond distance near the equilibrium geometry. We find that both PiQC algorithms exhibit greater robustness than SPSA to variations in the target Hamiltonian induced by changes in molecular bond distances. Furthermore, PiQC algorithms also achieve superior performance compared to SPSA in most instances, particularly at stretched bond lengths, where the Hartree-Fock solution becomes less accurate and its error grows relative to equilibrium.

quant-ph

Path integral control of open quantum systems

We investigate open-loop quantum state preparation for a class of open quantum systems whose dynamics follow a Gorini-Kossakowski-Lindblad-Sudarshan (GKLS) master equation that admits a trajectory-based stochastic representation. The deterministic control objective is reformulated as a stochastic optimal control problem -- interpreting stochasticity as a methodological tool akin to stochastic Schr\"odinger equation unravelings -- which situates the problem within the path integral control framework. For the class of GKLS generators under consideration, this reformulation leads to an explicit expression for the optimal control as a weighted average over stochastic quantum trajectories, thereby eliminating the need for gradient evaluations. Building on this theoretical result, we derive a control update rule for piecewise-constant control pulses and demonstrate that adaptive importance sampling progressively enhances the control estimator during optimization, culminating in the algorithm we term Path integral Quantum Control (PiQC). We further introduce an annealed variant of PiQC, wherein a synthetic noise schedule gradually steers open-system trajectories toward closed-system dynamics, enabling high-fidelity unitary state preparation. Numerical studies on a dissipative single-qubit system and a multi-qubit Nuclear Magnetic Resonance model verify that PiQC yields precise open-loop controls and displays robustness to Hamiltonian perturbations. We propose PiQC as a trajectory-based alternative to gradient-based approaches, which might offer a viable solution in quantum control problems where gradient computation is infeasible or computationally demanding.

quant-ph

Local Histogram Matching for Efficient Optical Flow Computation Applied to Velocity Estimation on Pocket Drones

Autonomous flight of pocket drones is challenging due to the severe limitations on on-board energy, sensing, and processing power. However, tiny drones have great potential as their small size allows maneuvering through narrow spaces while their small weight provides significant safety advantages. This paper presents a computationally efficient algorithm for determining optical flow, which can be run on an STM32F4 microprocessor (168 MHz) of a 4 gram stereo-camera. The optical flow algorithm is based on edge histograms. We propose a matching scheme to determine local optical flow. Moreover, the method allows for sub-pixel flow determination based on time horizon adaptation. We demonstrate velocity measurements in flight and use it within a velocity control-loop on a pocket drone.

cs.RO

Efficient Optical flow and Stereo Vision for Velocity Estimation and Obstacle Avoidance on an Autonomous Pocket Drone

Miniature Micro Aerial Vehicles (MAV) are very suitable for flying in indoor environments, but autonomous navigation is challenging due to their strict hardware limitations. This paper presents a highly efficient computer vision algorithm called Edge-FS for the determination of velocity and depth. It runs at 20 Hz on a 4 g stereo camera with an embedded STM32F4 microprocessor (168 MHz, 192 kB) and uses feature histograms to calculate optical flow and stereo disparity. The stereo-based distance estimates are used to scale the optical flow in order to retrieve the drone's velocity. The velocity and depth measurements are used for fully autonomous flight of a 40 g pocket drone only relying on on-board sensors. The method allows the MAV to control its velocity and avoid obstacles.

cs.RO

Approximate inference on planar graphs using Loop Calculus and Belief Propagation

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a finite sum of terms that can be evaluated once the belief propagation (BP) solution is known. In general, full summation over all correction terms is intractable. We develop an algorithm for the approach presented in Chertkov et al. (2008) which represents an efficient truncation scheme on planar graphs and a new representation of the series in terms of Pfaffians of matrices. We analyze in detail both the loop series and the Pfaffian series for models with binary variables and pairwise interactions, and show that the first term of the Pfaffian series can provide very accurate approximations. The algorithm outperforms previous truncation schemes of the loop series and is competitive with other state-of-the-art methods for approximate inference.

cs.AI

General Lower Bounds based on Computer Generated Higher Order Expansions

In this article we show the rough outline of a computer algorithm to generate lower bounds on the exponential function of (in principle) arbitrary precision. We implemented this to generate all necessary analytic terms for the Boltzmann machine partition function thus leading to lower bounds of any order. It turns out that the extra variational parameters can be optimized analytically. We show that bounds upto nineth order are still reasonably calculable in practical situations. The generated terms can also be used as extra correction terms (beyond TAP) in mean field expansions.

math.NA

Approximate Inference and Constrained Optimization

Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspond to extrema of the Bethe and Kikuchi free energy. However, belief propagation does not always converge, which explains the need for approaches that explicitly minimize the Kikuchi/Bethe free energy, such as CCCP and UPS. Here we describe a class of algorithms that solves this typically nonconvex constrained minimization of the Kikuchi free energy through a sequence of convex constrained minimizations of upper bounds on the Kikuchi free energy. Intuitively one would expect tighter bounds to lead to faster algorithms, which is indeed convincingly demonstrated in our simulations. Several ideas are applied to obtain tight convex bounds that yield dramatic speed-ups over CCCP.

cs.LG

Sufficient conditions for convergence of Loopy Belief Propagation

We derive novel sufficient conditions for convergence of Loopy Belief Propagation (also known as the Sum-Product algorithm) to a unique fixed point. Our results improve upon previously known conditions. For binary variables with (anti-)ferromagnetic interactions, our conditions seem to be sharp.

cs.AI

Stochastic Optimal Control in Continuous Space-Time Multi-Agent Systems

Recently, a theory for stochastic optimal control in non-linear dynamical systems in continuous space-time has been developed (Kappen, 2005). We apply this theory to collaborative multi-agent systems. The agents evolve according to a given non-linear dynamics with additive Wiener noise. Each agent can control its own dynamics. The goal is to minimize the accumulated joint cost, which consists of a state dependent term and a term that is quadratic in the control. We focus on systems of non-interacting agents that have to distribute themselves optimally over a number of targets, given a set of end-costs for the different possible agent-target combinations. We show that optimal control is the combinatorial sum of independent single-agent single-target optimal controls weighted by a factor proportional to the end-costs of the different combinations. Thus, multi-agent control is related to a standard graphical model inference problem. The additional computational cost compared to single-agent control is exponential in the tree-width of the graph specifying the combinatorial sum times the number of targets. We illustrate the result by simulations of systems with up to 42 agents.

cs.MA

Hybrid Variational/Gibbs Collapsed Inference in Topic Models

Variational Bayesian inference and (collapsed) Gibbs sampling are the two important classes of inference algorithms for Bayesian networks. Both have their advantages and disadvantages: collapsed Gibbs sampling is unbiased but is also inefficient for large count values and requires averaging over many samples to reduce variance. On the other hand, variational Bayesian inference is efficient and accurate for large count values but suffers from bias for small counts. We propose a hybrid algorithm that combines the best of both worlds: it samples very small counts and applies variational updates to large counts. This hybridization is shown to significantly improve testset perplexity relative to variational inference at no computational cost.

cs.LG

Risk Sensitive Path Integral Control

Recently path integral methods have been developed for stochastic optimal control for a wide class of models with non-linear dynamics in continuous space-time. Path integral methods find the control that minimizes the expected cost-to-go. In this paper we show that under the same assumptions, path integral methods generalize directly to risk sensitive stochastic optimal control. Here the method minimizes in expectation an exponentially weighted cost-to-go. Depending on the exponential weight, risk seeking or risk averse behaviour is obtained. We demonstrate the approach on risk sensitive stochastic optimal control problems beyond the linear-quadratic case, showing the intricate interaction of multi-modal control with risk sensitivity.

eess.SY