Bonn 2025 – scientific programme
Parts | Days | Selection | Search | Updates | Downloads | Help
QI: Fachverband Quanteninformation
QI 12: Quantum Computing Theory II
QI 12.1: Invited Talk
Tuesday, March 11, 2025, 11:00–11:30, HS IV
Classical reasoning methods for quantum circuit analysis — •Tim Coopmans1,2, Lieuwe Vinkhuijzen3, Arend-Jan Quist3, Jingyi Mei3, and Alfons Laarman3 — 1QuTech, Delft, The Netherlands — 2EEMCS, Delft University of Technology, The Netherlands — 3Leiden University, Leiden, the Netherlands
Simulating, evaluating and optimizing quantum circuits is provably difficult, yet we will still need to do so to bring theoretical proposals for scalable quantum computers closer to what can be demonstrated in experiments. Fortunately, computationally-hard tasks also feature heavily in the well-established field of classical reasoning, a branch of classical computer science which focus on developing logic-based algorithms for searching large yet structured spaces.
In this talk, I will show how we merged one such classical-reasoning technique, decision diagrams, with the stabilizer formalism for quantum circuit simulation. And that, asymptotically, the resulting decision diagram provably scales incomparably to other techniques such as Matrix Product States and Clifford+T circuit simulation. If time allows, I will also show how quantum-circuit simulation can also be done using another classical-reasoning technique, weighted #SAT.
Keywords: simulation of quantum circuits; decision diagrams; classical reasoning