Optimal Layout Synthesis for Quantum Computing

by   Bochen Tan, et al.

Recent years have witnessed the fast development of quantum computing. Researchers around the world are eager to run larger and larger quantum algorithms that promise speedups impossible to any classical algorithm. However, the available quantum computers are still volatile and error-prone. Thus, layout synthesis, which transforms quantum programs to meet these hardware limitations, is a crucial step in the realization of quantum computing. In this paper, we present two synthesizers, one optimal and one approximate but nearly optimal. Although a few optimal approaches to this problem have been published, our optimal synthesizer explores a larger solution space, thus is optimal in a stronger sense. In addition, it reduces time and space complexity exponentially compared to some leading optimal approaches. The key to this success is a more efficient spacetime-based variable encoding of the layout synthesis problem as a mathematical programming problem. By slightly changing our formulation, we arrive at an approximate synthesizer that is even more efficient and outperforms some leading heuristic approaches, in terms of additional gate cost, by up to 100 comprehensive set of benchmark programs and architectures. For a specific family of quantum programs named QAOA, which is deemed to be a promising application for near-term quantum computers, we further adjust the approximate synthesizer by taking commutation into consideration, achieving up to 75 reduction in depth and up to 65 tool used in a leading QAOA study.



There are no comments yet.


page 1

page 2

page 3

page 4


Optimality Study of Existing Quantum Computing Layout Synthesis Tools

Layout synthesis, an important step in quantum computing, processes quan...

Challenge: Quantum Computing for Location Determination

Quantum computing provides a new way for approaching problem solving, en...

Towards an Antivirus for Quantum Computers

Researchers are today exploring models for cloud-based usage of quantum ...

Formal Verification of Quantum Programs: Theory, Tools and Challenges

Over the past 27 years, quantum computing has seen a huge rise in intere...

Is Your Quantum Program Bug-Free?

Quantum computers are becoming more mainstream. As more programmers are ...

Adversarial quantum circuit learning for pure state approximation

Adversarial learning is one of the most successful approaches to modelli...

ROS: Resource-constrained Oracle Synthesis for Quantum Computers

We present a completely automatic synthesis framework for oracle functio...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.