Quantum time-marching algorithms adapt LCU for diffusive dynamics and use method of images or direct unitary encoding for boundaries, achieving optimal success probabilities and linear complexity, shown via heat equation simulations.
10 depict the QM solution of ϕϕϕt computed for Nt = 12000 explicit time steps with rh = 0 .2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum time-marching algorithms for solving linear transport problems including boundary conditions
Quantum time-marching algorithms adapt LCU for diffusive dynamics and use method of images or direct unitary encoding for boundaries, achieving optimal success probabilities and linear complexity, shown via heat equation simulations.