Related papers: Some Comments on Unitary Qubit Lattice Algorithms …
A rigorous theoretical investigation has been made on electron acoustic wave propagating in unmagnetized collisionless plasma consisting of a cold electron fluid, non-thermal hot electrons and stationary ions. Based on the pseudo-potential…
Hybrid classical-quantum algorithms aim at variationally solving optimisation problems, using a feedback loop between a classical computer and a quantum co-processor, while benefitting from quantum resources. Here we present experiments…
Quantized nonlinear lattice models are considered for two different classes, boson and fermionic ones. The quantum discrete nonlinear Schroedinger model (DNLS) is our main objective, but its so called modified discrete nonlinear (MDNLS)…
Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is…
A Quantum Cellular Automaton (QCA) is essentially an operator driving the evolution of particles on a lattice, through local unitaries. Because $\Delta_t=\Delta_x = \epsilon$, QCAs constitute a privileged framework to cast the digital…
We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is…
This study examines the potential for fault-tolerant quantum computers to provide utility in fluid dynamics simulations, with a focus on drag force calculations for ship hull design. We assess whether quantum algorithms can surpass…
Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed…
Numerical methods for the 1-D Dirac equation based on operator splitting and on the quantum lattice Boltzmann (QLB) schemes are reviewed. It is shown that these discretizations fall within the class of quantum walks, i.e. discrete maps for…
Quantum Annealing (QA) can efficiently solve combinatorial optimization problems whose objective functions are represented by Quadratic Unconstrained Binary Optimization (QUBO) formulations. For broader applicability of QA, quadratization…
This paper presents quasilinear theory (QLT) for classical plasma interacting with inhomogeneous turbulence. The particle Hamiltonian is kept general; for example, relativistic, electromagnetic, and gravitational effects are subsumed. A…
Using the Madelung transformation on a generalized scalar Gross-Pitaevski equation, a nonlinear continuum fluid equations are derived for a classical fluid. A unitary quantum lattice algorithm is then determined as a second order discrete…
The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight…
Realizing non-unitary transformations on unitary-gate based quantum devices is critically important for simulating a variety of physical problems including open quantum systems and subnormalized quantum states. We present a dilation based…
A numerical simulation algorithm for lattice QCD is described, in which the short- and long-distance effects of the sea quarks are treated separately. The algorithm can be regarded, to some extent, as an implementation at the quantum level…
In 2013, Clader, Jacobs, and Sprouse developed a quantum computing algorithm that solves electromagnetic scattering problems exponentially faster than the best known classical algorithm for that problem. We examine this quantum algorithm's…
Solving linear systems is at the foundation of many algorithms. Recently, quantum linear system algorithms (QLSAs) have attracted great attention since they converge to a solution exponentially faster than classical algorithms in terms of…
Previously proposed quantum algorithms for solving linear systems of equations cannot be implemented in the near term due to the required circuit depth. Here, we propose a hybrid quantum-classical algorithm, called Variational Quantum…
Numerical studies of lattice quantum field theories are conducted in finite spatial volumes, typically with cubic symmetry in the spatial coordinates. Motivated by these studies, this work presents a general algorithm to construct…
In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in…