English
Related papers

Related papers: Expanding the reach of quantum optimization with f…

200 papers

Constrained optimization plays a crucial role in the fields of quantum physics and quantum information science and becomes especially challenging for high-dimensional complex structure problems. One specific issue is that of quantum process…

Quantum Physics · Physics 2024-04-30 Daniel Volya , Andrey Nikitin , Prabhat Mishra

Polynomial approximations to the inverse of the fermion matrix are used to filter the dynamics of the upper energy scales in HMC simulations. The use of a multiple time-scale integration scheme allows the filtered pseudofermions to be…

High Energy Physics - Lattice · Physics 2015-05-28 Waseem Kamleh , Mike Peardon

The strongly correlated fermions play a vital role in modern physics. For a given fermionic Hamiltonian system, the most widely used approach to explore the underlying physics is to study the wave function that incorporates Fermi-Dirac…

Strongly Correlated Electrons · Physics 2026-04-08 Jian-Gang Kong , Zhi Yuan Xie

Maximum entropy inference and learning of graphical models are pivotal tasks in learning theory and optimization. This work extends algorithms for these problems, including generalized iterative scaling (GIS) and gradient descent (GD), to…

Machine Learning · Computer Science 2024-07-17 Minbo Gao , Zhengfeng Ji , Fuchao Wei

$ \newcommand{\cclass}[1]{{\textsf{#1}}} $The classical Grothendieck inequality has applications to the design of approximation algorithms for $\cclass{NP}$-hard optimization problems. We show that an algorithmic interpretation may also be…

Data Structures and Algorithms · Computer Science 2022-02-24 Assaf Naor , Oded Regev , Thomas Vidick

Local Hamiltonian Problems (LHPs) are important problems that are computationally QMA-complete and physically relevant for many-body quantum systems. Quantum MaxCut (QMC), which equates to finding ground states of the quantum Heisenberg…

Quantum Physics · Physics 2024-12-13 Ishaan Kannan , Robbie King , Leo Zhou

Classical information loading is an essential task for many processing quantum algorithms, constituting a cornerstone in the field of quantum machine learning. In particular, the embedding techniques based on Hamiltonian simulation…

In the lattice approach to Loop Quantum Gravity on a fixed graph computations tend to be involved and are rarely analytically manageable. But, when interested in the expectation values of coherent states on the lattice which are sharply…

General Relativity and Quantum Cosmology · Physics 2021-11-01 Klaus Liegener , Łukasz Rudnicki

Simulating quantum many-body systems is a highly demanding task since the required resources grow exponentially with the dimension of the system. In the case of fermionic systems, this is even harder since nonlocal interactions emerge due…

We propose a randomized algorithm with quadratic convergence rate for convex optimization problems with a self-concordant, composite, strongly convex objective function. Our method is based on performing an approximate Newton step using a…

Optimization and Control · Mathematics 2021-05-18 Jonathan Lacotte , Yifei Wang , Mert Pilanci

We study semidefinite programming (SDP) relaxations for the NP-hard problem of globally optimizing a quadratic function over the Stiefel manifold. We introduce a strengthened relaxation based on two recent ideas in the literature: (i) a…

Optimization and Control · Mathematics 2022-08-08 Samuel Burer , Kyungchan Park

Recent strides in nonlinear model predictive control (NMPC) underscore a dependence on numerical advancements to efficiently and accurately solve large-scale problems. Given the substantial number of variables characterizing typical…

Robotics · Computer Science 2024-06-04 Wilson Jallet , Ewen Dantec , Etienne Arlaud , Justin Carpentier , Nicolas Mansard

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer…

Optimization and Control · Mathematics 2026-01-06 Sven Leyffer , Paul Manns

This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models, within a range of alternative quantum bases. We focus on transitioning these states from the…

Quantum Physics · Physics 2024-06-24 Babak Tarighi , Reyhaneh Khasseh , M. A. Rajabpour

We propose a (theoretical ;-) model for quantum computation where the result can be read out from the time average of the Hamiltonian dynamics of a 2-dimensional crystal on a cylinder. The Hamiltonian is a spatially local interaction among…

Quantum Physics · Physics 2007-05-23 Dominik Janzing , Pawel Wocjan

Simulation of fermionic Hamiltonians with gate-based quantum computers requires the selection of an encoding from fermionic operators to quantum gates, the most widely used being the Jordan-Wigner transform. Many alternative encodings…

Quantum Physics · Physics 2026-05-01 Michael Williams de la Bastida , Thomas M. Bickley , Peter V. Coveney

We revisit the problem of fitting Lindbladian models to the outputs of quantum process tomography. A sequence of prior theoretical works approached the problem by considering whether there exists a Lindbladian generator close to a matrix…

Quantum Physics · Physics 2025-07-11 Yinchen Liu , James R. Seddon , Tamara Kohler , Emilio Onorati , Toby S. Cubitt

We consider the strictly correlated electron (SCE) limit of the fermionic quantum many-body problem in the second-quantized formalism. This limit gives rise to a multi-marginal optimal transport (MMOT) problem. Here the marginal state space…

Optimization and Control · Mathematics 2020-09-17 Yuehaw Khoo , Lin Lin , Michael Lindsey , Lexing Ying

In this paper the old problem of determining the discrete spectrum of a multi-particle Hamiltonian is reconsidered. The aim is to bring a fermionic Hamiltonian for large numbers N of particles by analytical means into a shape such that…

Mathematical Physics · Physics 2013-06-13 Joachim Schröter

In the numerical linear algebra community, it was suggested that to obtain nearly optimal bounds for various problems such as rank computation, finding a maximal linearly independent subset of columns (a basis), regression, or low-rank…

Data Structures and Algorithms · Computer Science 2021-11-04 Nadiia Chepurko , Kenneth L. Clarkson , Praneeth Kacham , David P. Woodruff