Related papers: Complexity and efficiency of minimum entropy produ…
Given a smooth Riemannian manifold $(M,g)$, compact and without boundary, we analyze the dynamical optimal mass transport problem where the cost is given by the sum of the kinetic energy and the relative entropy with respect to a reference…
Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support…
Mean-field molecular dynamics based on path integrals is used to approximate canonical quantum observables for particle systems consisting of nuclei and electrons. A computational bottleneck is the sampling from the Gibbs density of the…
We consider a discrete-time linear-quadratic Gaussian control problem in which we minimize a weighted sum of the directed information from the state of the system to the control input and the control cost. The optimal control and sensing…
We describe a robust and efficient chain-of-states method for computing Minimum Energy Paths~(MEPs) associated to barrier-crossing events in poly-atomic systems. The path is parametrized in terms of a continuous variable $t \in [0,1]$ that…
We formulate and investigate the simplest version of time-optimal quantum computation theory (t-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions. This version…
A path information is defined in connection with the probability distribution of paths of nonequilibrium hamiltonian systems moving in phase space from an initial cell to different final cells. On the basis of the assumption that these…
The path integral of a quantum system with an exact symmetry can be written as a sum of functional integrals each giving the contribution from quantum states with definite symmetry properties. We propose a strategy to compute each of them,…
We discuss in general how to geometrically visualize a qudit system, with a particular interest in thermal states. The principle of maximum entropy is used to study the geometric properties of an ensemble of finite dimensional Hamiltonian…
Transportation systems such as urban logistics, vehicle routing, and infrastructure planning require solving large-scale combinatorial optimization problems under complex constraints. Problems such as the vehicle routing problem (VRP),…
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present here a near-optimal, robust, and end-to-end quantum…
Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are…
An informative measurement is the most efficient way to gain information about an unknown state. We present a first-principles derivation of a general-purpose dynamic programming algorithm that returns an optimal sequence of informative…
In this paper, we explore a scenario where a sender provides an information policy and a receiver, upon observing a realization of this policy, decides whether to take a particular action, such as making a purchase. The sender's objective…
We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. For a given quantum state, our methods find the best local Hamiltonian for which the state outperforms separable…
Simulating the dynamics of open quantum systems is a crucial task in quantum computing, offering wide-ranging applications but remaining computationally challenging. In this paper, we propose two quantum algorithms for simulating the…
This paper proposes a quantum framework for the design of communication topologies in consensus-based multi-agent systems. The communication graph is selected online by solving a mixed-integer quadratic program (MIQP) that minimizes a cost…
We present new distributed quantum algorithms for fundamental distributed computing problems, namely, leader election, broadcast, Minimum Spanning Tree (MST), and Breadth-First Search (BFS) tree, in arbitrary networks. These algorithms are…
We demonstrate the relation between a global phase of the quantum gate and the layout of energy levels of its effective Hamiltonian required for implementing the gate for minimum time. By an example of the quantum Fourier transform gate for…
This article provides a review of recent developments in the formulation and execution of optimal control strategies for the dynamics of quantum systems. A brief introduction to the concept of optimal control, the dynamics of of open…