Related papers: Polylogarithmic-Depth Quantum Algorithm for Simula…
Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based…
In this work we study the Hubbard model on a bi-partite lattice using the coupled-cluster method (CCM). We first investigate what, within this approach, allows us to reproduce the zero order parameter in the 1D model, as predicted by the…
Scattering processes are fundamental for understanding the structure of matter, yet simulating their real-time dynamics remains challenging for classical computers. Quantum computing and quantum-inspired methods offer a promising avenue for…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
Motivated by recent experiment on the Na$_4$Ir$_3$O$_8$ compound we study the Hubbard model on the "hyper-kagome lattice", which forms a three-dimensional network of corner sharing triangles, using dynamical cluster approximation (DCA)…
We develop a workflow to use current quantum computing hardware for solving quantum many-body problems, using the example of the fermionic Hubbard model. Concretely, we study a four-site Hubbard ring that exhibits a transition from a…
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and physical qubit estimates using the surface code. We achieve…
We provide an extension to lattice systems of the reptation quantum Monte Carlo algorithm, originally devised for continuous Hamiltonians. For systems affected by the sign problem, a method to systematically improve upon the so-called…
Using a dual representation of lattice fermion models that is based on spin-charge transformation and fermionisation of the original description, I derive an algorithm for diagrammatic Monte Carlo simulation of strongly correlated systems.…
Hamiltonian simulation is a central task in quantum computing, with wide-ranging applications in quantum chemistry, condensed matter physics, and combinatorial optimization. A fundamental challenge lies in approximating the unitary…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
We present an efficient quantum algorithm for simulating the evolution of a sparse Hamiltonian H for a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a…
In the case of a two-leg Hubbard ladder we present a procedure which allows the exact deduction of the ground state for the four particle problem in arbitrary large lattice system, in a tractable manner, which involves only a reduced…
The competition of different length scales in quantum many-body systems leads to various novel phenomena, including the emergence of correlated dynamics or non-local order. To access and investigate such effects in an itinerant…
Large-scale quantum devices provide insights beyond the reach of classical simulations. However, for a reliable and verifiable quantum simulation, the building blocks of the quantum device require exquisite benchmarking. This benchmarking…
We develop randomized quantum algorithms to simulate quantum collision models, also known as repeated interaction schemes, which provide a rich framework to model various open-system dynamics. The underlying technique involves composing…
We introduce a method that ensures efficient computation of one-dimensional quantum systems with long-range interactions across all temperatures. Our algorithm operates within a quasi-polynomial runtime for inverse temperatures up to…
We present a theoretical scheme to simulate quantum field theory in a discrete curved spacetime based on the Bose-Hubbard model describing a Bose-Einstein condensate trapped inside an optical lattice. Using the Bose-Hubbard Hamiltonian, we…
We present a numerical study of the Hubbard model on simply stacked honeycomb and square lattices, motivated by a recent experimental realization of such models with ultracold atoms in optical lattices. We perform simulations with different…
Quantum computing holds great promise to accelerate scientific computations in fluid dynamics and other classical physical systems. While various quantum algorithms have been proposed for linear flows, developing quantum algorithms for…