Decomposition of Nonlinear Collision Operator in Quantum Lattice Boltzmann Algorithm

• URL: http://arxiv.org/abs/2408.00387v1
• Date: Thu, 1 Aug 2024 08:56:38 GMT
• Title: Decomposition of Nonlinear Collision Operator in Quantum Lattice Boltzmann Algorithm
• Abstract summary: We propose a quantum algorithm to tackle the quadratic nonlinearity in the Lattice Boltzmann (LB) collision operator. The proposed algorithm has been verified through the one-dimensional flow discontinuity and two-dimensional Kolmogrov-like flow test cases.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We propose a quantum algorithm to tackle the quadratic nonlinearity in the Lattice Boltzmann (LB) collision operator. The key idea is to build the quantum gates based on the particle distribution functions (PDF) within the coherence time for qubits. Thus, both the operator and a state vector are linear functions of PDFs, and upon quantum state evolution, the resulting PDFs will have quadraticity. To this end, we decompose the collision operator for a $DmQn$ lattice model into a product of $2(n+1)$ operators, where $n$ is the number of lattice velocity directions. After decomposition, the $(n+1)$ operators with constant entries remain unchanged throughout the simulation, whereas the remaining $(n+1)$ will be built based on the statevector of the previous time step. Also, we show that such a decomposition is not unique. Compared to the second-order Carleman-linearized LB, the present approach reduces the circuit width by half and circuit depth by exponential order. The proposed algorithm has been verified through the one-dimensional flow discontinuity and two-dimensional Kolmogrov-like flow test cases.

Related papers

• A Provable Oracle-Free Quantum Algorithm for Nonlinear Dynamics on Hybrid Oscillator-Qubit Processors [14.814423713691623]
  We develop a hybrid qubit-qumode algorithm for nonlinear ordinary differential equations of the form $dotmathbfx=mathbff(mathbfx)$ with warped degree$L$.<n>The algorithm propagates the state density and returns the trajectory as the peak of that density in the small-noise limit.
  arXiv  Detail & Related papers  (2026-07-30T17:10:47Z)
• Quantum Speedups for Stochastic Optimization with Heavy-Tailed Noise [49.730496294398726]
  We develop a novel quantum mean estimator for heavy-tailed random variables.<n>We derive stronger lower bounds for tail index>4/3$, showing that a nontrivial dependence on a dimension is unavoidable.<n>For a convex objective function, we propose a quantum projected gradient descent method.
  arXiv  Detail & Related papers  (2026-07-28T09:29:37Z)
• Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth [73.08853228981701]
  Matrix chain multiplication is a problem in scientific computing, machine learning, and graph analysis.<n>We present emphTwo-Tower Matrix, a quantum subroutine that encodes the product $mathcalW$ of the $K$ matrices into a quantum state in circuit depth.
  arXiv  Detail & Related papers  (2026-07-14T18:42:40Z)
• Efficient Pauli-decomposition and multistage state-refinement for tensor network based differential equation solver [0.0]
  tensor network (TN) methods can be highly productive for PDEs giving rise to Sturm--Liouville problems.<n>Most methods for generating MPOs of large operators without explicit tensor-product structure require prohibitively large memory.<n>We present techniques to mitigate both challenges for certain sparse, structured differential operators.
  arXiv  Detail & Related papers  (2026-07-09T07:10:01Z)
• Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation [0.0]
  We decompose an arbitrary square matrix into a linear combination of non-unitaries (LCNU) where each non-unitary term is embedded into a unitary matrix.<n>We provide an estimate of our LCNU strategy's T gate cost in conjunction with (1) encoding block oracles, and (2) the variational quantum linear solver.
  arXiv  Detail & Related papers  (2026-05-01T00:10:50Z)
• Transmutation based Quantum Simulation for Non-unitary Dynamics [35.35971148847751]
  We present a quantum algorithm for simulating dissipative diffusion dynamics generated by positive semidefinite operators of the form $A=Ldagger L$.<n>Our main tool is the Kannai transform, which represents the diffusion semigroup $e-TA$ as a Gaussian-weighted superposition of unitary wave propagators.
  arXiv  Detail & Related papers  (2026-01-07T05:47:22Z)
• Universal initial state preparation for first quantized quantum simulations [1.6089851562703383]
  Preparation of symmetry-adapted initial states is a principal bottleneck in first-quantized quantum simulation.<n>We present a universal approach that efficiently maps any-size superposition of occupation-number configurations to the first bijquantized representation on a digital quantum computer.
  arXiv  Detail & Related papers  (2025-10-08T17:41:08Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• A Novel Finite Fractional Fourier Transform and its Quantum Circuit Implementation on Qudits [0.0]
  We present a new number theoretic definition of discrete fractional Fourier transform (DFrFT) The DFrFT is defined as the $N times N$ dimensional unitary representation of the generator of the arithmetic rotational group $SO_2[mathbbZ_pn]$.
  arXiv  Detail & Related papers  (2024-09-09T16:15:53Z)
• On encoded quantum gate generation by iterative Lyapunov-based methods [0.0]
  The problem of encoded quantum gate generation is studied in this paper. The emphReference Input Generation Algorithm (RIGA) is generalized in this work.
  arXiv  Detail & Related papers  (2024-09-02T10:41:15Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Architectures and random properties of symplectic quantum circuits [0.0]
  Parametrized and random unitary $n$-qubit circuits play a central role in quantum information. We present a universal set of generators $mathcalG$ for the symplectic algebra $imathfraksp(d/2)$. We find that the operators in $mathcalG$ cannot generate arbitrary local symplectic unitaries. We then review the Schur-Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements can converge
  arXiv  Detail & Related papers  (2024-05-16T17:15:39Z)
• Quantum Unitary Matrix Representation of Lattice Boltzmann Model for Low Reynolds Fluid Flow Simulation [0.0]
  We propose a quantum algorithm for the Lattice Boltzmann (LB) method to simulate fluid flows in the low Reynolds number regime. We provide counts for two-qubit controlled-NOT (CNOT) and single-qubit U gates for test cases involving 9 to 12 qubits, with grid sizes ranging from 24 to 216 points.
  arXiv  Detail & Related papers  (2024-05-14T14:51:15Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Quantum simulation of dissipation for Maxwell equations in dispersive media [0.0]
  dissipation appears in the Schr"odinger representation of classical Maxwell equations as a sparse diagonal operator occupying an $r$-dimensional subspace. The unitary operators can be implemented through qubit lattice algorithm (QLA) on $n$ qubits. The non-unitary-dissipative part poses a challenge on how it should be implemented on a quantum computer.
  arXiv  Detail & Related papers  (2023-07-31T18:22:40Z)
• Small-time controllability for the nonlinear Schr\"odinger equation on $\mathbb{R}^N$ via bilinear electromagnetic fields [55.2480439325792]
  We address the small-time controllability problem for a nonlinear Schr"odinger equation (NLS) on $mathbbRN$ in the presence of magnetic and electric external fields. In detail, we study when it is possible to control the dynamics of (NLS) as fast as desired via sufficiently large control signals.
  arXiv  Detail & Related papers  (2023-07-28T21:30:44Z)
• Quantum Current and Holographic Categorical Symmetry [62.07387569558919]
  A quantum current is defined as symmetric operators that can transport symmetry charges over an arbitrary long distance. The condition for quantum currents to be superconducting is also specified, which corresponds to condensation of anyons in one higher dimension.
  arXiv  Detail & Related papers  (2023-05-22T11:00:25Z)
• Halving the cost of quantum multiplexed rotations [0.0]
  We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
  arXiv  Detail & Related papers  (2021-10-26T06:49:44Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.