Quantum Fourier Transform using Dynamic Circuits

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.

4 pages, 2 figures (main text) + 4 pages, 2 figures (appendix)

References in corpus (4)

• Robust dynamical decoupling for quantum computing and quantum memory
• Arbitrarily Accurate Pulse Sequences for Robust Dynamical Decoupling
• An Experimental Study of Shor's Factoring Algorithm on IBM Q
• Quantum Fourier Addition, Simplified to Toffoli Addition

Cited by in corpus (20)

• Qudit Dynamical Decoupling on a Superconducting Quantum Processor
• Benchmarking quantum gates and circuits
• Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem
• Teleporting two-qubit entanglement across 19 qubits on a superconducting quantum computer
• Fourier Quantum Process Tomography
• A modular entanglement-based quantum computer architecture
• Readout Error Mitigation for Mid-Circuit Measurements and Feedforward
• Virtual Z gates and symmetric gate compilation
• Man-in-the-Middle Attacks Targeting Quantum Cryptography
• Perspectives on Utilization of Measurements in Quantum Algorithms
• Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems
• KLiNQ: Knowledge Distillation-Assisted Lightweight Neural Network for Qubit Readout on FPGA
• Mitigating errors in state preparation and measurement with noncomputational states
• General many-body entanglement swapping protocol: opportunities for distributed quantum computing
• Long-ranged gates in quantum computation architectures with limited connectivity
• Quantum Circuits for Matrix-Product Unitaries
• Frustration-Free Control and Absorbing-State Transport in Entangled State Preparation
• Error Mitigation in Dynamic Circuits for Hamiltonian Simulation
• Measurement-and Feedback-Driven Non-Equilibrium Phase Transitions on a Quantum Processor
• Passive leakage removal unit based on a disordered transmon array