Related papers: Carleman-lattice-Boltzmann quantum circuit with ma…
Feynman's circuit-to-Hamiltonian construction enables the mapping of a quantum circuit to a time-independent Hamiltonian. This model introduces a Hilbert space made from an ancillary clock register tracking the progress of the computation.…
We present the first computationally-efficient algorithm for average-case learning of shallow quantum circuits with many-qubit gates. Specifically, we provide a quasi-polynomial time and sample complexity algorithm for learning unknown…
We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely…
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…
Quantum generative modeling using quantum circuit Born machines (QCBMs) shows promising potential for practical quantum advantage. However, discovering ans\"atze that are both expressive and hardware-efficient remains a key challenge,…
Wall-driven flow in square cavity has been studied extensively, yet it is more frequently for the rectangular cavity flow occurring in practical problems, and some flow characteristics about rectangular cavity have not been fully…
We present a systematic procedure for the construction of relativistic lattice Boltzmann models (R-SLB) appropriate for the simulation of flows of massless particles. Quadrature rules are used for the discretization of the momentum space in…
This paper presents a novel strategy for constructing body source terms in the high-order lattice Boltzmann method (LBM), designed to efficiently introduce various physical phenomena by modifying the non-equilibrium distribution function.…
A fluid flow in a simple dense liquid, passing an obstacle in a two-dimensional thin film geometry, is simulated by Molecular Dynamics (MD) computer simulation and compared to results of Lattice Boltzmann (LB) simulations. By the…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…
We discuss an efficient physical realization of topological quantum walks on a finite lattice. The $N$-point lattice is realized with $\log_2 N$ qubits, and the quantum circuit utilizes a number of quantum gates which is polynomial in the…
A number of quantum algorithms have been performed on small quantum computers; these include Shor's prime factorization algorithm, error correction, Grover's search algorithm and a number of analog and digital quantum simulations. Because…
The pseudopotential lattice Boltzmann method (LBM) is a prominent approach for simulating multiphase flows, valued for its physical intuitiveness and computational tractability. However, existing immiscible pseudopotential methods for…
Block-encodings have become one of the most common oracle assumptions in the circuit model. I present an algorithm that uses von Neumann's measurement procedure to measure a phase, using time evolution on a block-encoded Hamiltonian as a…
Nonlinear boolean equation systems play an important role in a wide range of applications. Grover's algorithm is one of the best-known quantum search algorithms in solving the nonlinear boolean equation system on quantum computers. In this…
We present a systematic pathway for solving differential equations within the quantum linear systems framework by combining block encoding with Quantum Singular Value Transformation (QSVT). The approach is demonstrated on a complex…
In fault-tolerant quantum circuit synthesis, T gates supplied via magic states dominate space-time cost, while Clifford gates incur negligible overhead. Conventional flows minimize AND count in an {XOR, AND, NOT} basis as a proxy for T,…
In this paper, a new progressive mesh algorithm is introduced in order to perform fast physical simulations by the use of a lattice Boltzmann method (LBM) on a single-node multi-GPU architecture. This algorithm is able to mesh automatically…
The lattice Boltzmann method exhibits excellent scalability on current supercomputing systems and has thus increasingly become an alternative method for large-scale non-stationary flow simulations, reaching up to a trillion grid nodes.…
Continuous gate sets are a key ingredient for near-term quantum algorithms. Here, we demonstrate a hardware-efficient, continuous set of controlled arbitrary-phase ($\mathrm{C}Z_{\theta}$) gates acting on flux-tunable transmon qubits. This…