REVIEW 1 cited by
Relating the multi-angle quantum approximate optimization algorithm and continuous-time quantum walks on dynamic graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In this work, we show that ma-QAOA is equivalent to a restriction of continuous-time quantum walks on dynamic graphs. We then show it is universal for computation by finding the appropriate $B$ and $C$ operators and angles that implement the universal gate set consisting of the Hadamard, $\pi/8$ and Controlled-Not gates in the ma-QAOA framework. This result begins to bridge the gap between the continuous-time quantum walk model and gate model of quantum computation.
Forward citations
Cited by 1 Pith paper
-
A matching decomposition algorithm for simulating quantum walk Hamiltonians
Matching decomposition with edge compression builds quantum-walk circuits that need up to 43% fewer CX gates and 54% less depth than Pauli decomposition on tested sparse graphs.
Discussion (0). Continue with ORCID to comment.