相关论文: Efficient optimization of perturbative gadgets

This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…

We present a method to calculate many-body states of interacting carriers in million atom quantum nanostructures based on atomistic tight-binding calculations and a combination of iterative selection of configurations and perturbation…

In this review we describe a non-trivial relationship between perturbative gauge theory and gravity scattering amplitudes. At the semi-classical or tree level, the scattering amplitudes of gravity theories in flat space can be expressed as…

Characterizing noisy quantum devices requires methods for learning the underlying quantum Hamiltonian which governs their dynamics. Often, such methods compare measurements to simulations of candidate Hamiltonians, a task which requires…

In many experimental settings, one is tasked with obtaining information about certain relationships by applying perturbations to a set of independent variables and noting the changes in the set of dependent ones. While traditional…

The implementation of reliable and efficient geometric algorithms is a challenging task. The reason is the following conflict: On the one hand, computing with rounded arithmetic may question the reliability of programs while, on the other…

This review is focused on the borderline region of theoretical physics and mathematics. First, we describe numerical methods for the acceleration of the convergence of series. These provide a useful toolbox for theoretical physics which has…

Programmable quantum systems based on Rydberg atom arrays have recently emerged as a promising testbed for combinatorial optimization. Indeed, the Maximum Weighted Independent Set problem on unit-disk graphs can be efficiently mapped to…

Combinatorial problems are formulated to find optimal designs within a fixed set of constraints. They are commonly found across diverse engineering and scientific domains. Understanding how to best use quantum computers for combinatorial…

Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…

In spite of missing dynamical correlations, the projected generator coordinate method (PGCM) was recently shown to be a suitable method to tackle the low-lying spectroscopy of complex nuclei. Still, describing absolute binding energies and…

In many cases of interest, the perturbative series based on conventional Feynman diagrams have a zero radius of convergence. Series with a finite radius of convergence can be obtained by either introducing a large field cutoff or by…

The successive perturbative estimates of the pressure of QCD at high temperature T show no sign of convergence, unless the coupling constant g is unrealistically small. Exploiting known results of an effective field theory which separates…

Extreme mass-ratio inspirals, in which solar-mass compact bodies spiral into supermassive black holes, are an important potential source for gravitational wave detectors. Because of the extreme mass-ratio, one can model these systems using…

We provide a systematic formula, in terms of integer partitions, that generates perturbation theory explicitly at an arbitrary order. Our approach naturally includes an infinite number of perturbations and uses a single matrix equation that…

We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower bound that show that, for constant estimation, the number…

Many robots are not equipped with a manipulator and many objects are not suitable for prehensile manipulation (such as large boxes and cylinders). In these cases, pushing is a simple yet effective non-prehensile skill for robots to interact…

Simulating quantum dynamics beyond the reach of classical computers is one of the main envisioned applications of quantum computers. The most promising quantum algorithms to this end in the near-term are the simplest, which use the Trotter…

In the field of quantum control, effective Hamiltonian engineering is a powerful tool that utilises perturbation theory to mitigate or enhance the effect that a variation in the Hamiltonian has on the evolution of the system. Here, we…

We present a hardware-native gadget framework for solving constraint satisfaction problems on Rydberg quantum computing architectures. Our approach introduces a compact $xor_1$ gadget that enforces exactly-one constraints, ubiquitous in…