Quantum lattice-gas model for computational fluid dynamics
The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
Quantum-computing ideas are applied to the practical and ubiquitous problem of fluid dynamics simulation. Hence, this paper addresses two separate areas of physics: quantum mechanics and fluid dynamics (or specifically, the computational simulation of fluid dynamics). The quantum algorithm is called a quantum lattice gas. An analytical treatment of the microscopic quantum lattice-gas system is carried out to predict its behavior at the mesoscopic scale. At the mesoscopic scale, a lattice Boltzmann equation with a nonlocal collision term that depends on the entire system wave function, governs the dynamical system. Numerical results obtained from an exact simulation of a one-dimensional quantum lattice model are included to illustrate the formalism. A symbolic mathematical method is used to implement the quantum mechanical model on a conventional workstation. The numerical simulation indicates that classical viscous damping is not present in the one-dimensional quantum lattice-gas system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779 · cited 1×
“At present, we do not know whether a quantum computer with many globally entangled qubits, say on the order of a million, will ever be constructed, although candidate architectures have been proposed [9, 10, 24, 32 ].”
BackgroundLogical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679 · cited 1×
“4A benet arises by restricting oneself to reversible algorithms, in principle heat production may be avoided [ 11 , 12].”
BackgroundLattice-gas automata for the Navier-Stokes equation
Frisch, U., Hasslacher, B., & Pomeau, Y. (1986) · Physical Review Letters · doi:10.1103/physrevlett.56.1505 · Cited by 2,788
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“This has spurred the development of scalable quantum error correction techniques, considered crucially important for the enterprise to continue [ 23 , 20, 24, 25].6 With a fully coherent quantum computer with a million qubits, quantum algorithms such as Shor’s factoring algorithm [26] or Grover’s search algorithm [27]…”
MethodThe thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006 · cited 1×
“4A benefit arises by restricting oneself to reversible algorithms, in principle heat production may be avoided [11, 12].”
BackgroundFeynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528 · cited 2×
“The method is called nuclear magnetic resonance (NMR) quantum computing [ 28 ].”
MethodQuantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
Quantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Feynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
From quantum cellular automata to quantum lattice gases
Meyer, D. A. (1996) · Journal of Statistical Physics · doi:10.1007/bf02199356 · Cited by 556
Nuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing
Cory, D. G., Price, M. D., & Havel, T. F. (1998) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00046-3 · Cited by 419 · cited 2×
“To date, NMR quantum computers with only a few qubits have been constructed and the Grover search algorithm [30, 31 ] and a quantum Fourier transform algorithm has been tested.”
BackgroundMethodQuantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402 · cited 1×
“3 Quantum Parallelism It is possible to use the principle of quantum mechanical superposition of states to formulate efficient numerical algorithms [16, 17, 18, 19, 20, 21, 22].”
MethodLattice Boltzmann equation for quantum mechanics
Succi, S., & Benzi, R. (1993) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(93)90096-j · Cited by 217
Weyl, Dirac, and Maxwell equations on a lattice as unitary cellular automata
Bialynicki-Birula, I. (1994) · Physical Review D · doi:10.1103/physrevd.49.6920 · Cited by 195 · cited 3×
“E 991 @1# I. Bialynicki-Birula, Phys.”
Background(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49208-9 · Cited by 185
Quantum mechanics of lattice gas automata: One-particle plane waves and potentials
Meyer, D. A. (1997) · Physical Review E · doi:10.1103/physreve.55.5261 · Cited by 101 · cited 4×
“2 Background Other types of quantum lattice gases have been studied, beginning in the mid 1990’s, by Bialynicki-Birula [3], Succi [4], Meyer [5], and Boghosian and Taylor [6] to model the relativistic Dirac equation and the nonrelativisitic Schrödinger equation.”
BackgroundInfluential
Cited by
Finding flows of a Navier–Stokes fluid through quantum computing
Gaitan, F. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00291-0 · Cited by 175
Propagating quantum walks: The origin of interference structures
Knight, P. L., Roldán, E., & Sipe, J. E. (2004) · Journal of Modern Optics · doi:10.1080/09500340408232489 · Cited by 42
Lidar, D. A. (2004) · New Journal of Physics · doi:10.1088/1367-2630/6/1/167 · Cited by 33
Metadata
- Authors
- Yepez, J.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2001-03-29
- Volume
- 63
- Issue
- 4
- Pages
- 046702-046702
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2027817813
- Cited by
- 105
- References
- 24
- FWCI
- 6.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.