English
Related papers

Related papers: Efficient higher-order matrix product operators fo…

200 papers

First-order stochastic methods are the state-of-the-art in large-scale machine learning optimization owing to efficient per-iteration complexity. Second-order methods, while able to provide faster convergence, have been much less explored…

Machine Learning · Statistics 2017-12-01 Naman Agarwal , Brian Bullins , Elad Hazan

We consider the problem of learning the evolution operator for the time-dependent Schr\"{o}dinger equation, where the Hamiltonian may vary with time. Existing neural network-based surrogates often ignore fundamental properties of the…

Machine Learning · Statistics 2026-04-07 Yash Patel , Unique Subedi , Ambuj Tewari

We present a multiscale integrator for Hamiltonian systems with slowly varying quadratic stiff potentials that uses coarse timesteps (analogous to what the impulse method uses for constant quadratic stiff potentials). This method is based…

Numerical Analysis · Mathematics 2011-04-14 Molei Tao , Houman Owhadi , Jerrold E. Marsden

A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…

Quantum Physics · Physics 2025-05-14 Qing-Song Li , Jiaxuan Zhang , Huan-Yu Liu , Qingchun Wang , Yu-Chun Wu , Guo-Ping Guo

In this work we start from a phenomenological Hamiltonian built from two known systems: the Hamiltonian of a pumped optomechanical system and the Jaynes Cummings Hamiltonian. Using algebraic techniques we construct an approximate time…

Quantum Physics · Physics 2020-12-30 L. Medina-Dozal , I. Ramos-Prieto , J. Récamier

Matrix Product States (MPS) and Operators (MPO) have been proven to be a powerful tool to study quantum many-body systems but are restricted to moderately entangled states as the number of parameters scales exponentially with the…

We present a new method for proving lower bounds on the expected running time of evolutionary algorithms. It is based on fitness-level partitions and an additional condition on transition probabilities between fitness levels. The method is…

Neural and Evolutionary Computing · Computer Science 2015-03-19 Dirk Sudholt

Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant…

Quantum Physics · Physics 2023-01-30 Reyhaneh Aghaei Saem , Ali Hamed Moosavian

We obtain a time-evolution operator for a forced optomechanical quantum system using Lie algebraic methods when the normalized coupling between the electromagnetic field and a mechanical oscillator, $G/\omega_m$, is not negligible compared…

This article studies the solutions of time-dependent differential inclusions which is motivated by their utility in the modeling of certain physical systems. The differential inclusion is described by a time-dependent set-valued mapping…

Optimization and Control · Mathematics 2021-07-05 Kanat Camlibel , Luigi Iannelli , Aneel Tanwani

By leveraging the natural geometry of a smooth probabilistic system, Hamiltonian Monte Carlo yields computationally efficient Markov Chain Monte Carlo estimation. At least provided that the algorithm is sufficiently well-tuned. In this…

Methodology · Statistics 2016-01-05 Michael Betancourt

A time evolution operator in the interaction picture is given by exponentiating an interaction Hamiltonian $H$. Important examples of Hamiltonians, often encountered in quantum optics, condensed matter and high energy physics, are of a…

Quantum Physics · Physics 2016-02-08 Kamil Bradler

We propose Hierarchical Optimization Time Integration (HOT) for efficient implicit time-stepping of the Material Point Method (MPM) irrespective of simulated materials and conditions. HOT is an MPM-specialized hierarchical optimization…

Graphics · Computer Science 2020-04-28 Xinlei Wang , Minchen Li , Yu Fang , Xinxin Zhang , Ming Gao , Min Tang , Danny M. Kaufman , Chenfanfu Jiang

McDonald, Pestana and Wathen (SIAM J. Sci. Comput. 40(2), pp. A2012-A1033, 2018) present a method for preconditioning of time-dependent PDEs via approximation by a nearby time-periodic problem, that is, they employ circulant-related…

Numerical Analysis · Mathematics 2018-10-02 Anthony Goddard , Andrew Wathen

As an important part of genetic algorithms (GAs), mutation operators is widely used in evolutionary algorithms to solve $\mathcal{NP}$-hard problems because it can increase the population diversity of individual. Due to limitations in…

Neural and Evolutionary Computing · Computer Science 2024-03-19 Yang Yang

Product formulas can be used to simulate Hamiltonian dynamics on a quantum computer by approximating the exponential of a sum of operators by a product of exponentials of the individual summands. This approach is both straightforward and…

Quantum Physics · Physics 2019-09-04 Andrew M. Childs , Aaron Ostrander , Yuan Su

A novel expansion of the evolution operator associated with a -- in general, time-dependent -- perturbed quantum Hamiltonian is presented. It is shown that it has a wide range of possible realizations that can be fitted according to…

Quantum Physics · Physics 2009-11-11 Paolo Aniello

A single-step high-order implicit time integration scheme with controllable numerical dissipation at high frequencies is presented for the transient analysis of structural dynamic problems. The amount of numerical dissipation is controlled…

Numerical Analysis · Mathematics 2023-09-29 Chongmin Song , Xiaoran Zhang , Sascha Eisenträger , Ankit Ankit

We consider a class of linear integral operators with impulse responses varying regularly in time or space. These operators appear in a large number of applications ranging from signal/image processing to biology. Evaluating their action on…

Numerical Analysis · Mathematics 2016-04-18 Paul Escande , Pierre Weiss

In solving multi-modal, multi-objective optimization problems (MMOPs), the objective is not only to find a good representation of the Pareto-optimal front (PF) in the objective space but also to find all equivalent Pareto-optimal subsets…

Neural and Evolutionary Computing · Computer Science 2022-10-24 Tapabrata Ray , Mohammad Mohiuddin Mamun , Hemant Kumar Singh