search

TeamGraphix / graphix

measurement-based quantum computing (MBQC) compiler and simulator
https://graphix.readthedocs.io
Apache License 2.0
55 stars 20 forks source link

Pauli Flow finding algorithm #93

Closed masa10-f closed 2 months ago

masa10-f commented 8 months ago

Is your feature request related to a problem? Please describe.

Graphix incorporates both flow and gflow finding algorithm. I think that the implementation of the Pauli flow finding algorithm would enhance its utility.

Describe the feature you'd like

Following the algorithm described in EPTCS 343, 2021, pp. 50-101.

Additional context Add any other context or screenshots about the feature request here.

na

masa10-f commented 8 months ago

I paste the link to the paper on arXiv

d1ssk commented 2 months ago

I benchmarked 'find_pauliflow()' using patterns which were transpiled from random circuits and removed Pauli measurements, as shown in the following code. The computational complexity indicated in the paper is O(N^5) with respect to the number of nodes N, but I understand this is a theoretical upper bound, and typically, as shown in the results below, it can be achieved with much less complexity. output pauliflow_benchmark_py.txt