The scope is narrow: it is established that the Succi-Dellar theory can be implemented on a (gate-model) quantum computer, and the associated gate counts are reported.
Abstract
The quantum lattice Boltzmann (QLB) scheme of Succi and Dellar advances a four-component Dirac spinor on a lattice by a fixed sequence of local, exactly norm-preserving operations: a basis rotation, a collision, a streaming shift, and the inverse rotation. This unitarity is a structural property of the scheme, not an approximation, which suggests that a QLB time step should map onto a sequence of quantum gates. Here we make that mapping explicit. We give a gate-level construction of every operation of the three-dimensional Dirac QLB scheme: the fixed rotation gates, the collision gate, the streaming shift as a controlled increment on a position register, the position-dependent potential as a phase oracle, and periodic and reflecting (bounce-back) boundary conditions as unitary circuits. We then compose them into single-axis, two- and three-dimensional time steps. On a state-vector emulator the resulting circuits reproduce the classical QLB solver to machine precision (maximum density deviation between $3.7\times10^{-12}$ and $1.0\times10^{-17}$ across the one-, two-, and three-dimensional tests), so the circuits are the scheme rather than an approximation of it. The scope is narrow: we establish that the Succi-Dellar theory can be implemented on a (gate-model) quantum computer, and report the associated gate counts. We make no claim of computational advantage; state preparation, measurement, and asymptotic cost are discussed as open questions. All operators, circuits, tests, and figures are reproducible from the open-source quantumKineticMethods library.
In the existing quantum algorithms for the lattice Boltzmann method, resolving the unitarity problem of the BGK collision operator from first principles remains a fundamental challenge, and a systematically constructed unitary alternative that reproduces the BGK relaxation structure to leading order has not yet been es...
Kang-Yang Zeng, Chang-Sheng Huang, Xi Liu et al.· 0 citations
Wetterich showed that certain 1+1D probabilistic cellular automata are equivalent to fermionic QFTs and posed the 3D construction as an open problem. We construct one: a layered automaton ("coincube") whose conversion blocks form the real quaternion representation of Cl(0,3), controlled by binary environment fields who...
We introduce a new class of p-adic Dirac equations, formulated in the standard axiomatic framework of quantum mechanics, in which the ordinary spatial derivatives are replaced by non-local operators built from arbitrary integrable kernels. We diagonalize the resulting free Dirac Hamiltonian in momentum space, construct...
The pseudo-quantum representation re-encodes a finite, irreducible, reversible continuous-time Markov chain with $M$ states as a complex-orthogonal flow on a doubled space of dimension $2M$. After uniformisation, a square-root gauge, a doubling of the state space and a diagonal unitary twist, the chain generates an ent...
Precise control of multi-qubit architectures remains a critical bottleneck in superconducting quantum processors. In this work, we investigate the synthesis of high-fidelity quantum operations and state transfer protocols within an extended superconducting linear chain, scaling from three to seven sites. Using Floquet...
A. De Luca, Carola Ciaramelletti, Simone Paganelli· 0 citations
The quantum harmonic oscillator (QHO) is normally built on a structure that contains a Hilbert space, ladder operators, and a Born rule. Here we derive it from counting. We adopt three information-theoretic postulates: information is carried by binary sequences of length $n$; only symbol counts, not the sequences thems...
Sam Powers, D. Skrgic, D. Stojkovic· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.