Fully Quantum Lattice Gas Automata Building Blocks for Computational Basis State Encodings

• URL: http://arxiv.org/abs/2506.12662v2
• Date: Wed, 18 Jun 2025 10:50:10 GMT
• Title: Fully Quantum Lattice Gas Automata Building Blocks for Computational Basis State Encodings
• Authors: Călin A. Georgescu, Merel A. Schalkers, Matthias Möller,
• Abstract summary: We introduce novel building blocks for QLGA algorithms that rely on computational basis state encodings.<n>We provide intuitive examples and open-source implementations of the underlying quantum circuits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Lattice Gas Automata (LGA) is a classical method for simulating physical phenomena, including Computational Fluid Dynamics (CFD). Quantum LGA (QLGA) is the family of methods that implement LGA schemes on quantum computers. In recent years, QLGA has garnered attention from researchers thanks to its potential of efficiently modeling CFD processes by either reducing memory requirements or providing simultaneous representations of exponentially many LGA states. In this work, we introduce novel building blocks for QLGA algorithms that rely on computational basis state encodings. We address every step of the algorithm, from initial conditions to measurement, and provide detailed complexity analyses that account for all discretization choices of the system under simulation. We introduce multiple ways of instantiating initial conditions, efficient boundary condition implementations for novel geometrical patterns, a novel collision operator that models less restricted interactions than previous implementations, and quantum circuits that extract quantities of interest out of the quantum state. For each building block, we provide intuitive examples and open-source implementations of the underlying quantum circuits.

Related papers

• Quantum Search in Superposed Quantum Lattice Gas Automata and Lattice Boltzmann Systems [0.0]
  Quantum Lattice Gas Automata and Quantum Lattice Boltzmann Methods emerge as promising candidates for quantum-native implementations of CFD solvers.<n>We propose an application based on discrete optimization and quantum search, which circumvents flow field measurement altogether.
  arXiv  Detail & Related papers  (2025-10-15T20:04:06Z)
• Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies [0.0]
  QBKSP is a multireference quantum Lanczos method designed to accurately compute low-lying eigenenergies, including degenerate ones, of quantum systems.<n>We present three compact quantum circuits tailored to different problem settings for evaluating the required expectation values.
  arXiv  Detail & Related papers  (2025-06-11T17:47:22Z)
• Quantum Approximate Optimisation Applied to Graph Similarity [0.0]
  We introduce a novel quantum optimisation simulation package facilitating investigation of all constituent components of the QAOA.<n>We investigate eight classical optimisation methods each at six levels of decomposition.<n>An encoding for permutation based problems such as graph similarity through edge overlap to the QAOA allows for significant quantum memory savings.
  arXiv  Detail & Related papers  (2024-12-23T06:04:08Z)
• Block encoding bosons by signal processing [0.0]
  We demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU) can themselves be efficiently utilized for BE implementation.<n>We present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons.<n>We find that, while using QSVT for BE results in the best gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to $lesssim11$ qubits.
  arXiv  Detail & Related papers  (2024-08-29T18:00:02Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
  In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
  arXiv  Detail & Related papers  (2023-11-06T18:53:50Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm [1.439946676159516]
  In this work, we investigate the verification of ReLU networks, which involves solving a robustness many-variable mixed-integer programs (MIPs) To alleviate this issue, we propose to use QC for neural network verification and introduce a hybrid quantum procedure to compute provable certificates. We show that, in a simulated environment, our certificate is sound, and provide bounds on the minimum number of qubits necessary to approximate the problem.
  arXiv  Detail & Related papers  (2022-05-02T13:23:56Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• QuaSiMo: A Composable Library to Program Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-05-17T16:17:57Z)
• Composable Programming of Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-01-20T14:20:14Z)

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.