English
Related papers

Related papers: Learning fermionic linear optics with Heisenberg s…

200 papers

In this work we consider active local learning: given a query point $x$, and active access to an unlabeled training set $S$, output the prediction $h(x)$ of a near-optimal $h \in H$ using significantly fewer labels than would be needed to…

Machine Learning · Computer Science 2020-09-07 Arturs Backurs , Avrim Blum , Neha Gupta

We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…

In the sensitive distance oracle problem, there are three phases. We first preprocess a given directed graph $G$ with $n$ nodes and integer weights from $[-W,W]$. Second, given a single batch of $f$ edge insertions and deletions, we update…

Data Structures and Algorithms · Computer Science 2019-07-23 Jan van den Brand , Thatchaphol Saranurak

In this work, we initiate the study of learning quantum processes from quantum statistical queries. We focus on two fundamental learning tasks in this new access model: shadow tomography of quantum processes and process tomography with…

Quantum Physics · Physics 2025-05-14 Chirag Wadhwa , Mina Doosti

Making the most of next-generation galaxy clustering surveys requires overcoming challenges in complex, non-linear modelling to access the significant amount of information at smaller cosmological scales. Field-level inference has provided…

Cosmology and Nongalactic Astrophysics · Physics 2025-10-02 Ludvig Doeser , Metin Ata , Jens Jasche

Federated learning has attracted increasing attention with the emergence of distributed data. While extensive federated learning algorithms have been proposed for the non-convex distributed problem, federated learning in practice still…

Machine Learning · Computer Science 2023-03-10 Xidong Wu , Feihu Huang , Zhengmian Hu , Heng Huang

We show that quantum number preserving Ans\"{a}tze for variational optimization in quantum chemistry find an elegant mapping to ultracold fermions in optical superlattices. Using native Hubbard dynamics, trial ground states of molecular…

Quantum Gases · Physics 2025-02-26 Fotios Gkritsis , Daniel Dux , Jin Zhang , Naman Jain , Christian Gogolin , Philipp M. Preiss

Simulating fermionic systems on qubit hardware involves many nonlocal interactions, and efficient routing of these interactions is critical to the overall cost of fermionic simulation algorithms. Recent works reduce this Jordan-Wigner…

Quantum Physics · Physics 2026-05-26 Dantong Li , Shifan Xu , Yongshan Ding

We consider the problems of testing and learning an unknown $n$-qubit Hamiltonian $H$ from queries to its evolution operator $e^{-iHt}$ under the normalized Frobenius norm. We prove: 1. Local Hamiltonians: We give a tolerant testing…

Quantum Physics · Physics 2025-06-09 Srinivasan Arunachalam , Arkopal Dutt , Francisco Escudero Gutiérrez

We address the issue of precisely estimating small parameters encoded in a general linear transformation of the modes of a bosonic quantum field. Such Bogoliubov transformations frequently appear in the context of quantum optics. We provide…

Quantum Physics · Physics 2015-08-10 Nicolai Friis , Michalis Skotiniotis , Ivette Fuentes , Wolfgang Dür

We introduce an ordinary differential equation (ODE) based deep generative method for learning conditional distributions, named Conditional F\"ollmer Flow. Starting from a standard Gaussian distribution, the proposed flow could approximate…

Machine Learning · Statistics 2025-10-14 Jinyuan Chang , Zhao Ding , Yuling Jiao , Ruoxuan Li , Jerry Zhijian Yang

We develop new accelerated first-order algorithms in the Frank-Wolfe (FW) family for minimizing smooth convex functions over compact convex sets, with a focus on two prominent constraint classes: (1) polytopes and (2) matrix domains given…

Optimization and Control · Mathematics 2025-11-05 Dan Garber

While recent state-of-the-art results for adversarial imitation-learning algorithms are encouraging, recent works exploring the imitation learning from observation (ILO) setting, where trajectories \textit{only} contain expert observations,…

Machine Learning · Computer Science 2020-06-22 Dilip Arumugam , Debadeepta Dey , Alekh Agarwal , Asli Celikyilmaz , Elnaz Nouri , Bill Dolan

Structured light, light tailored in its internal degrees of freedom, has become topical in numerous quantum and classical information processing protocols. In this work, we harness the high dimensional nature of structured light modulated…

In Optics it is common to split up the formal analysis of diffraction according to two convenient approximations, in the near and far fields (also known as the Fresnel and Fraunhofer regimes, respectively). Within this scenario, geometrical…

Classical Physics · Physics 2022-04-25 Almudena García-Sánchez , Ángel S. Sanz

Fermi--L\"owdin orbitals (FLO) are a special set of localized orbitals, which have become commonly used in combination with the Perdew--Zunger self-interaction correction (SIC) in the FLO-SIC method. The FLOs are obtained for a set of…

Identification of a linear time-invariant dynamical system from partial observations is a fundamental problem in control theory. Particularly challenging are systems exhibiting long-term memory. A natural question is how learn such systems…

Machine Learning · Computer Science 2022-03-08 Holden Lee

Electronic computers have evolved drastically over the past years with an ever-growing demand for improved performance. However, the transfer of information from memory and high energy consumption have emerged as issues that require…

We introduce a new numerical strategy to solve a class of oscillatory transport PDE models which is able to captureaccurately the solutions without numerically resolving the high frequency oscillations {\em in both space and time}.Such PDE…

Numerical Analysis · Mathematics 2016-06-01 Nicolas Crouseilles , Shi Jin , Mohammed Lemou

Let $\mathscr{F}_{n,d}$ be the class of all functions $f:\{-1,1\}^n\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which…

Machine Learning · Computer Science 2024-10-23 Alexandros Eskenazis , Paata Ivanisvili , Lauritz Streck