3 citations · 6 across the 5 of their papers we have counts for
5 papers
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…
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…
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…
Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial
I J David, I Sinayskiy, F Petruccione
One of the first proposals for the use of quantum computers was the simulation of quantum systems. Over the past three decades, great strides have been made in the development of a…
Digital simulation of convex mixtures of Markovian and non-Markovian single qubit Pauli channels on NISQ devices
I J David, I Sinayskiy, F Petruccione
Quantum algorithms for simulating quantum systems provide a clear and provable advantage over classical algorithms in fault-tolerant settings. There is also interest in quantum alg…