Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Optimising Trotter-Suzuki Simulations of Markovian Open Quantum Systems via Classical Search
S. M. Pillay, I. J. David, I. Sinayskiy +1
Simulating an open quantum system on a digital quantum computer often involves the use of Trotter-Suzuki (TS) Product Formulas (PF) to approximate the system's time evolution. Prec…
quant-ph2025
Tighter Error Bounds for the qDRIFT Algorithm
I. J. David, I. Sinayskiy, F. Petruccione
Randomized algorithms such as qDRIFT provide an efficient framework for quantum simulation by sampling terms from a decomposition of the system's generator. However, existing error…
quant-ph2024
Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation
I. J. David, I. Sinayskiy, F. Petruccione
When simulating the dynamics of open quantum systems with quantum computers, it is essential to accurately approximate the system's behaviour while preserving the physicality of it…