Design Automation and Design Space Exploration for Quantum Computers
Mathias Soeken, Martin Roetteler, Nathan Wiebe, Giovanni De Micheli

TL;DR
This paper presents a method to automate the design of reversible arithmetic circuits for quantum computing using classical design tools, enabling efficient synthesis of components like reciprocals for quantum algorithms.
Contribution
It introduces a novel approach combining classical and reversible logic synthesis to automatically generate large reversible circuits from hardware description languages.
Findings
Successfully synthesized reciprocal circuits for quantum algorithms
Demonstrated integration of classical and reversible logic synthesis
Enabled automatic design of complex reversible components
Abstract
A major hurdle to the deployment of quantum linear systems algorithms and recent quantum simulation algorithms lies in the difficulty to find inexpensive reversible circuits for arithmetic using existing hand coded methods. Motivated by recent advances in reversible logic synthesis, we synthesize arithmetic circuits using classical design automation flows and tools. The combination of classical and reversible logic synthesis enables the automatic design of large components in reversible logic starting from well-known hardware description languages such as Verilog. As a prototype example for our approach we automatically generate high quality networks for the reciprocal , which is necessary for quantum linear systems algorithms.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
