Related papers: Polylogarithmic-Depth Quantum Algorithm for Simula…
We present a nonequilibrium strong-coupling approach to inhomogeneous systems of ultracold atoms in optical lattices. We demonstrate its application to the Mott-insulating phase of a two-dimensional Fermi-Hubbard model in the presence of a…
The Fermi-Hubbard model (FHM) on a two dimensional square lattice has long been an important testbed and target for simulating fermionic Hamiltonians on quantum hardware. We present an alternative for quantum simulation of FHMs based on an…
We present an algorithm to compute Green's functions on quantum computers for interacting electron systems, which is a challenging task on conventional computers. It uses a continued fraction representation based on the Lanczos method,…
Recent developments in analog quantum simulators based on cold atoms and trapped ions call for cross-validating the accuracy of quantum-simulation experiments with use of quantitative numerical methods; however, it is particularly…
A hybrid computational method coupling the lattice-Boltzmann (LB) method and a Langevin-dynamics (LD) method is developed to simulate nanoscale particle and polymer (NPP) suspensions in the presence of both thermal fluctuation and…
An algorithm for simulation of quantum many-body dynamics having su(2) spectrum-generating algebra is developed. The algorithm is based on the idea of dynamical coarse-graining. The original unitary dynamics of the target observables, the…
In this paper, we study Bose-Hubbard models on the square and honeycomb lattices with complex hopping amplitudes, which are feasible by recent experiments of cold atomic gases in optical lattices. To clarify phase diagrams, we use an…
The Schwinger model (quantum electrodynamics in 1+1 dimensions) is a testbed for the study of quantum gauge field theories. We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and…
Simulating real-time dynamics of gauge theories represents a paradigmatic use case to test the hardware capabilities of a quantum computer, since it can involve non-trivial input states preparation, discretized time evolution, long-distance…
Dynamic simulation of materials is a promising application for near-term quantum computers. Current algorithms for Hamiltonian simulation, however, produce circuits that grow in depth with increasing simulation time, limiting feasible…
The linear combination of unitaries (LCU) method has proven to scale better than existing product formulas in simulating long time Hamiltonian dynamics. However, given the number of multi-control gate operations in the standard…
Motivated by the experimental realisation of the two-dimensional triangular spin lattice at the National Instate of Standards and Technology in 2012, we developed a new algorithm which allows a time evolution of an MPS with a Hamiltonian…
We describe here a quantum simulator of extended bipartite Hubbard model with broken sublattice symmetry. The simulator consists of a structured lateral gate confining two dimensional electrons in a quantum well into artificial minima…
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. Synthesizing the corresponding quantum circuit is typically done by breaking the evolution into small time steps, also known as…
Electrons in artificial lattices enable explorations of the impact of repulsive Coulomb interactions in a tunable system. We have trapped two-dimensional electrons belonging to a gallium arsenide quantum well in a nanofabricated lattice…
While LDPC codes have been demonstrated with desirable error correcting properties, this has come at a cost of diverging from the geometrical constraints of many hardware platforms. Viewing codes as the groundspace of a Hamiltonian, we…
Accurate time-dependent quantum dynamics of Coulombic systems on grid-based representations remains computationally demanding due to the singularity of the Coulomb potential, which necessitates extremely fine spatial grids to mitigate…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
Multiscale is a hallmark feature of complex nonlinear systems. While the simulation using the classical numerical methods is restricted by the local \textit{Taylor} series constraints, the multiscale techniques are often limited by finding…
We investigate a hybrid numerical algorithm aimed at the large-scale cosmological N-body simulation for the on-going and the future high precious sky surveys. It makes use of a truncated Fast Multiple Method (FMM) for short-range gravity,…