The reviewed record of science sign in
Pith

arxiv: 2403.09514 · v2 · pith:63VQLORW · submitted 2024-03-14 · quant-ph

Quantum Fourier Transform using Dynamic Circuits

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:63VQLORWrecord.jsonopen to challenge →

classification quant-ph
keywords quantumdynamiccircuitsfouriermeasurementsmid-circuittransformadvantages
0
0 comments X
read the original abstract

In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful protocols by drastically reducing the resource requirements for certain core algorithmic primitives. In particular, in the case of the $n$-qubit quantum Fourier transform followed immediately by measurement, the scaling of resource requirements is reduced from $O(n^2)$ two-qubit gates in an all-to-all connectivity in the standard unitary formulation to $O(n)$ mid-circuit measurements in its dynamic counterpart without any connectivity constraints. Here, we demonstrate the advantage of dynamic quantum circuits for the quantum Fourier transform on IBM's superconducting quantum hardware with certified process fidelities of $>50\%$ on up to $16$ qubits and $>1\%$ on up to $37$ qubits, exceeding previous reports across all quantum computing platforms. These results are enabled by our contribution of an efficient method for certifying the process fidelity, as well as of a dynamical decoupling protocol for error suppression during mid-circuit measurements and feed-forward within a dynamic quantum circuit that we call ``feed-forward-compensated dynamical decoupling" (FC-DD). Our results demonstrate the advantages of leveraging dynamic circuits in optimizing the compilation of quantum algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. $\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing

    quant-ph 2026-05 conditional novelty 6.0

    HP-1 circuits achieve O(n) depth while preserving shift invariance and exponentially growing Fisher information, enabling numerical replacement of the QFT in Shor's algorithm with neural net classical post-processing.