arXiv (All)
open access
Representation-split Carleman lattice Boltzmann with near-unit step success probability on quantum computers
The Carleman lattice Boltzmann method replaces the quadratic collision of the lattice Boltzmann equation by a linear map on a lifted state. Existing block encodings of this map succeed with probability $10^{-5}$ to $10^{-2}$ per step, so that the probability of a multi-step evolution decays exponent
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Near-optimal quantum simulation of lattice Lindbladian dynamics#1131045
- Distances between pure quantum states induced by a distance matrix#1200787
- Practical Scalability of Tensor Network Quantum Emulators for Molecular Hamiltonian Simulation#684221
- Practical Scalability of Tensor Network Quantum Emulators for Molecular Hamiltonian Simulation#682446
- Classical Cellular Automaton for Measurement-Only Entanglement Transitions#1076399
Record · ID 1355609
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive