Transformations for accelerator-based quantum circuit simulation in Haskell
Youssef Moawad, Wim Vanderbauwhede, Ren\'e Steijl

TL;DR
This paper presents a Haskell-based functional programming approach for analyzing and transforming quantum circuits to optimize hardware utilization in FPGA-based simulations, forming part of a larger quantum computing simulation toolchain.
Contribution
It introduces a novel Haskell implementation for quantum circuit analysis and transformation tailored for hardware acceleration, particularly FPGA-based simulation.
Findings
Demonstrated FPGA-based simulation of quantum arithmetic circuits
Developed a Haskell toolchain for quantum circuit transformation and optimization
Outlined future development directions for the toolchain
Abstract
For efficient hardware-accelerated simulations of quantum circuits, we can define hardware-specific quantum-circuit transformations. We use a functional programming approach to create a quantum-circuit analysis and transformation method implemented in Haskell. This tool forms a key part of our larger quantum-computing simulation toolchain. As an example of hardware acceleration, we discuss FPGA-based simulations of selected quantum arithmetic circuits, including the transformation steps to optimise the hardware utilisation. Future development steps in the Haskell-based analysis and transformation tool are outlined. The described toolchain can be found on GitHub: https://github.com/DevdudeSami/fqt.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Low-power high-performance VLSI design · Advancements in Semiconductor Devices and Circuit Design
