On Friday October 17, this site was moved to a new server, https://mw.hh.se. The original address will continue to work. Whithin a week or two this site will return to the original address. /Peo HH IT-dep

W211/M25Shan

From WG 2.11
Revision as of 14:40, 11 December 2025 by Jacques (talk | contribs) (Created page with "Yafei Yang and Chung-chieh Shan Developing quantum programs requires not only running them on quantum hardware but also simulating them on classical hardware. Because the semantics of a quantum program can be defined in terms of complex state vectors, it can in principle be simulated using any implementation of probabilistic or weighted programming that supports complex or at least negative weights. In this study, we compile a high-level quantum programming language to...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

Yafei Yang and Chung-chieh Shan

Developing quantum programs requires not only running them on quantum hardware but also simulating them on classical hardware. Because the semantics of a quantum program can be defined in terms of complex state vectors, it can in principle be simulated using any implementation of probabilistic or weighted programming that supports complex or at least negative weights. In this study, we compile a high-level quantum programming language to one such implementation---the _factor graph grammar_ solver for probabilistic programming---and benchmark its simulation performance. We prove that our compiler preserves the denotational semantics of the source language. To bring this simulation performance into the ballpark of the popular Qiskit toolkit, we enhance the solver with an optimization that commutes the tensor operations einsum and expand.

Retrieved from "http://mw.hh.se/wg211/index.php?title=W211/M25Shan&oldid=2870"