Related papers: An efficient quantum algorithm for the one-dimensi…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
Entropic lattice Boltzmann methods have been developed to alleviate intrinsic stability issues of lattice Boltzmann models for under-resolved simulations. Its reliability in combination with moving objects was established for various…
Gaussian Boson Sampling (GBS) generate random samples of photon-click patterns from a class of probability distributions that are hard for a classical computer to sample from. Despite heroic demonstrations for quantum supremacy using GBS,…
The ability to extract relevant information is critical to learning. An ingenious approach as such is the information bottleneck, an optimisation problem whose solution corresponds to a faithful and memory-efficient representation of…
An unconventional approach is applied to solve the one-dimensional Burgers' equation. It is based on spline polynomial interpolations and Hopf-Cole transformation. Taylor expansion is used to approximate the exponential term in the…
Quantum heuristics have shown promise in solving various optimization problems, including lattice protein folding. Equally relevant is the inverse problem, protein design, where one seeks sequences that fold to a given target structure. The…
Recent works have shown that quantum computers can polynomially speed up certain SAT-solving algorithms even when the number of available qubits is significantly smaller than the number of variables. Here we generalise this approach. We…
We introduce evolved quantum Boltzmann machines as a variational ansatz for quantum optimization and learning tasks. Given two parameterized Hamiltonians $G(\theta)$ and $H(\phi)$, an evolved quantum Boltzmann machine consists of preparing…
We present a wide array of quantum measures on numerical solutions of 1D Bose- and Fermi-Hubbard Hamiltonians for finite-size systems with open boundary conditions. Finite size effects are highly relevant to ultracold quantum gases in…
We propose a neural-network variational quantum algorithm to simulate the time evolution of quantum many-body systems. Based on a modified restricted Boltzmann machine (RBM) wavefunction ansatz, the proposed algorithm can be efficiently…
The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in…
We present a quantum-inspired classical algorithm that can be used for graph-theoretical problems, such as finding the densest $k$-subgraph and finding the maximum weight clique, which are proposed as applications of a Gaussian boson…
We present an exact solution of the quantum kinetic equation of a weakly interacting Fermi gas in the crossover from the degenerate Fermi-liquid regime to the classical Boltzmann gas. We construct families of orthogonal polynomials tailored…
The Vlasov-Maxwell system of equations, which describes classical plasma physics, is extremely challenging to solve, even by numerical simulation on powerful computers. By linearizing and assuming a Maxwellian background distribution…
Classical optimization is a cornerstone of the success of variational quantum algorithms, which often require determining the derivatives of the cost function relative to variational parameters. The computation of the cost function and its…
We propose a complete quantum-classical hybrid branch-and-bound algorithm (QCBB) to solve binary linear programs with equality constraints. That includes bound calculation, convergence metrics and optimality guarantee to the quantum…
The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing…
We prove a generalised second-order Boltzmann-Gibbs principle for conservative interacting particle systems on a lattice whose stationary measures are not of product type and not invariant under particle jumps. The result, which requires…
The problem of simulating the thermal behavior of quantum systems remains a central open challenge in quantum computing. Unlike well-established quantum algorithms for unitary dynamics, \emph{provably efficient} algorithms for preparing…
Recently, a new connection between density functional theory and kinetic theory has been proposed. In particular, it was shown that the Kohn-Sham (KS) equations can be reformulated as a macroscopic limit of the steady-state solution of a…