Binary search on diamond-norm error functions yields far fewer Trotter steps than closed-form analytic bounds for deterministic and randomised TS product formulas on Markovian open systems, with second-order randomised usually cheapest.
Title resolution pending
1 Pith paper cite this work, alongside 75 external citations. Polarity classification is still indexing.
1
Pith paper citing it
75
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimising Trotter-Suzuki Simulations of Markovian Open Quantum Systems via Classical Search
Binary search on diamond-norm error functions yields far fewer Trotter steps than closed-form analytic bounds for deterministic and randomised TS product formulas on Markovian open systems, with second-order randomised usually cheapest.