6 citations · 6 across the 3 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Complexity of Quadratic Bosonic Hamiltonian Simulation: BQP-Completeness and PostBQP-Hardness
Lilith Zschetzsche, Refik Mansuroglu, Norbert Schuch
The computational complexity of simulating the dynamics of physical quantum systems is a central question at the interface of quantum physics and computer science. In this work, we…
quant-ph2025
Direct Equivalence between Dynamics of Quantum Walks and Coupled Classical Oscillators
Lilith Zschetzsche, Refik Mansuroglu, András Molnár +1
Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing: On the one hand, they can be efficiently simulated on a quantum…