2022
DOI: 10.1088/2058-9565/ac5a0e
|View full text |Cite
|
Sign up to set email alerts
|

Phase polynomials synthesis algorithms for NISQ architectures and beyond

Abstract: 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 o… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 42 publications
0
13
0
Order By: Relevance
“…82 It includes a wide variety of low-level tools useful for writing, compiling and optimizing quantum circuits. [83][84][85][86][87] These tools come in the form of so-called "plugins" that can be combined or stacked upon another to construct a quantum compilation chain.…”
Section: A Quantum Programming Environment and A Powerful Simulatormentioning
confidence: 99%
“…82 It includes a wide variety of low-level tools useful for writing, compiling and optimizing quantum circuits. [83][84][85][86][87] These tools come in the form of so-called "plugins" that can be combined or stacked upon another to construct a quantum compilation chain.…”
Section: A Quantum Programming Environment and A Powerful Simulatormentioning
confidence: 99%
“…This class is also called phase polynomials and are described by the set of parities at which each R z occurs as well as a parity matrix describing the output parities of the quantum circuit, this is also called the sum-over-paths notation [1]. The key here is that various Steiner-tree-based methods have been proposed for synthesizing the parities for each R z gate [15,14,21]. The remaining parity matrix can then be synthesized by PermRowCol.…”
Section: Extensions To Arbitrary Quantum Circuitsmentioning
confidence: 99%
“…As a result, it will take much longer to execute a quantum circuit, and thus introduce more errors to the computation. Alternatively, a recent paradigm shift in routing strategies has introduced Steiner-tree based synthesis [2,11,15,14,21,8] as a tool for changing the circuit to fit the connectivity constraints of the quantum hardware. The intuition behind these techniques is that by lifting the rigid representation of the quantum circuit to a more flexible representation and then synthesizing a new circuit from the flexible representation, we can make global improvements to the circuit more easily.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…QLM is a complete environment designed for quantum software programmers, engineers and researchers 79 . It includes a wide variety of low-level tools useful for writing, compiling and optimizing quantum circuits 80,81,82,83,84 . These tools come in the form of so-called "plugins" that can be combined or stacked upon another to construct a quantum compilation chain.…”
Section: A Quantum Programming Environment and A Powerful Simulatormentioning
confidence: 99%