Phase polynomials synthesis algorithms for NISQ architectures and beyond

We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-04
Main Authors: Vandaele, Vivien, Martiel, Simon, Timothée Goubault de Brugière
Format: Article
Language:English
Subjects:
Algorithms
Polynomials
Synthesis
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller running time for similar performances. We also provide methods that can be applied to our algorithms in order to trade an increase in the CNOT count for a decrease in execution time, thereby filling the gap between our algorithms and faster ones.
ISSN:2331-8422
DOI:10.48550/arxiv.2104.00934