Programming Quantum Computers Using Design Automation
Mathias Soeken, Thomas H\"aner, Martin Roetteler

TL;DR
This paper discusses the challenges of fully-automatic quantum program compilation and demonstrates a workflow that translates high-level algorithms into hardware-specific instructions for quantum computers, using existing tools.
Contribution
It introduces two tool flows that automate the quantum programming process from algorithm to hardware, addressing current limitations in quantum compilation methods.
Findings
Successfully automated quantum programming flow for a benchmark algorithm
Utilized RevKit with ProjectQ and Q# tool flows for different quantum platforms
Highlighted future research directions for fully-automatic quantum compilation
Abstract
Recent developments in quantum hardware indicate that systems featuring more than 50 physical qubits are within reach. At this scale, classical simulation will no longer be feasible and there is a possibility that such quantum devices may outperform even classical supercomputers at certain tasks. With the rapid growth of qubit numbers and coherence times comes the increasingly difficult challenge of quantum program compilation. This entails the translation of a high-level description of a quantum algorithm to hardware-specific low-level operations which can be carried out by the quantum device. Some parts of the calculation may still be performed manually due to the lack of efficient methods. This, in turn, may lead to a design gap, which will prevent the programming of a quantum computer. In this paper, we discuss the challenges in fully-automatic quantum compilation. We motivate…
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.
