-
-
Notifications
You must be signed in to change notification settings - Fork 28
Description
Problem Statement
The Quantum Fourier Transform is one of the most important subroutines in quantum circuits, particularly in Shor's factoring algorithm. The QFT algorithm, however, uses many 2-qubit gates (O(N^2)) and assumes all-to-all connectivity, which is not applicable to most hardware platforms. To this end, a dynamical circuit version of this algorithm has been developed to resolve some of these issues.
This dynamical circuit version of the QFT immediately followed by measurement (QFT + M) uses O(n) mid-circuit measurements and classical feed-forward instead of O(n^2) 2-qubit gates and removes the assumption of all-to-all connectivity.
Relevant Literature
https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.133.150602
Proposed Solution
With the growing relevance of dynamical circuits, I think that a dynamical QFT could be a suitable addition to the list of benchmarking circuits.