Related papers: Simulation of the Burgers equation by NMR quantum …
The Burgers' equation is a one-dimensional momentum equation for a Newtonian fluid. The Cole-Hopf transformation solves the equation for a given initial and boundary condition. However, in most cases the resulting integral equation can only…
The improved quantum scheduling algorithm proposed by Grover has been generalized using the generalized quantum search algorithm, in which a unitary operator replaces the Walsh-Hadamard transform, and $\pi/2$ phase rotations replace the…
We prove the existence and uniqueness of positive analytical solutions with positive initial data to the mean field equation (the Dyson equation) of the Dyson Brownian motion through the complex Burgers equation with a force term on the…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
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…
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…
We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an…
The Fermi-Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum…
We propose the encoding of memristive quantum dynamics on a digital quantum computer. Using a set of auxiliary qubits, we simulate an effective non-Markovian environment inspired by a collisional model, reproducing memristive features…
Recent demonstrations of superconducting quantum computers by Google and IBM and trapped-ion computers from IonQ fueled new research in quantum algorithms, compilation into quantum circuits, and empirical algorithmics. While online access…
We present a theoretical and numerical study of Fourier space triad phase dynamics in one-dimensional stochastically forced Burgers equation at Reynolds number $\mathrm{Re} \approx 2.7 \times 10^4$. We demonstrate that Fourier triad phases…
The purpose of this article is to derive the crossover from the Ornstein-Uhlenbeck process to energy solutions of the stochastic Burgers equation with characteristic operators given in terms of fractional operators, such as the regional…
Methods to control errors will be essential for quantum information processing. It is widely believed that fault-tolerant quantum error correction is the leading contender to achieve this goal. Although the theory of fault-tolerant quantum…
Self-similarity of Burgers' equation with some stochastic advection is studied. In self-similar variables a stationary solution is constructed which establishes the existence of a stochastically self-similar solution for the stochastic…
Quantum computing has shown great potential in various quantum chemical applications such as drug discovery, material design, and catalyst optimization. Although significant progress has been made in quantum simulation of simple molecules,…
We consider one-dimensional exclusion processes with long jumps given by a transition probability of the form $p_n(\cdot)=s(\cdot)+\gamma_na(\cdot)$, such that its symmetric part $s(\cdot)$ is irreducible with finite variance and its…
Quantum computers hold great promise for arriving at exact simulations of nuclear dynamical processes (e.g., scattering and reactions) that are paramount to the study of nuclear matter at the limit of stability and to explaining the…
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to…
The coupled Burgers equation is solved by way of the trigonometric B-spline collocation method. The unknown of the coupled Burgers equation is integrated in time by aid of the Crank-Nicolson method. Resulting time-integrated coupled Burgers…
In this work, we investigate the capability of known quantum-computing algorithms for fault-tolerant quantum computing to simulate the laser-driven electron dynamics in small molecules such as lithium hydride. These computations are…