Among various algorithms designed to exploit the specific properties of quantum computers
with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to …

We study tensor network states defined on an underlying graph which is sparsely
connected. Generic sparse graphs are expander graphs with a high probability, and one can …

We propose a message-passing algorithm to compute the Hamiltonian expectation with
respect to an appropriate class of trial wave functions for an interacting system of fermions …

We propose the variational quantum cavity method to construct a minimal energy subspace
of wavevectors that are used to obtain some upper bounds for the energy cost of the low …

The study of quantum information provides a common lens to our investigation of quantum
mechanical phenomena in various fields, including condensed matter, high energy, and …

We present a general framework to study quantum disordered systems in the context of the
Kikuchi's cluster variational method (CVM). The method relies in the solution of message …

Given a locally consistent set of reduced density matrices, we construct approximate density
matrices which are globally consistent with the local density matrices we started from when …

Finding a succinct representation to describe the ground state of a disordered interacting
system could be very helpful in understanding the interplay between the interactions that is …

Cavity algorithms under global constraints: classical and quantum problems Page 1 Politecnico
di Torino Doctoral Thesis Cavity algorithms under global constraints: classical and quantum …