arXiv:2102.01682 · Physical Review Letters

Exploiting Dynamic Quantum Circuits in a Quantum Algorithm with Superconducting Qubits

Antonio D. Corcoles, Maika Takita, Ken Inoue, Scott Lekuch, Zlatko Minev, Jerry M. Chow, Jay Gambetta

Published Aug 31, 2021• 167 citations

Abstract

To date, quantum computation on real, physical devices has largely been limited to simple, time-ordered sequences of unitary operations followed by a final projective measurement. As hardware platforms for quantum computing continue to mature in size and capability, it is imperative to enable quantum circuits beyond their conventional construction. Here we break into the realm of dynamic quantum circuits on a superconducting-based quantum system. Dynamic quantum circuits not only involve the evolution of the quantum state throughout the computation but also periodic measurements of qubits midcircuit and concurrent processing of the resulting classical information on timescales shorter than the execution times of the circuits. Using noisy quantum hardware, we explore one of the most fundamental quantum algorithms, quantum phase estimation, in its adaptive version, which exploits dynamic circuits, and compare the results to a nonadaptive implementation of the same algorithm. We demonstrate that the version of real-time quantum computing with dynamic circuits can yield results comparable to an approach involving classical asynchronous postprocessing, thus opening the door to a new realm of available algorithms on real quantum systems.

DOI: 10.1103/physrevlett.127.100501

Related papers

Quantum Fourier Transform Using Dynamic Circuits

Elisa Bäumer, Vinay Tripathi, Alireza Seif +2 more

In dynamic quantum circuits, classical information from midcircuit 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) midcircuit 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 midcircuit measurements and feed forward within a dynamic quantum circuit that we call "feed-forward-compensated dynamical decoupling." Our results demonstrate the advantages of leveraging dynamic circuits in optimizing the compilation of quantum algorithms.

arXiv:2403.09514Physical Review LettersOct 8, 202449 citations

Demonstrating advantages of dynamic quantum circuits on a hybrid superconducting qubit-cavity processor

Hongbo Wu, Ling Hu, Jiasheng Mai +10 more

Dynamic quantum circuits (DQCs) provide a hardware-efficient route to quantum computing by reducing physical-qubit overhead and compressing circuit topology through mid-circuit measurements, qubit reset and reuse, and classical feed-forward control. Here, we demonstrate the advantages of DQCs on a single hybrid superconducting qubit-cavity processor by implementing a hierarchy of algorithms with increasing complexity. This hybrid architecture consists of a high-dimensional cavity qudit serving as the computational register and a dispersively coupled superconducting transmon ancilla that is repeatedly measured, reset, and reused to enable dynamic control. Using this device, we implement a 10-bit Bernstein-Vazirani algorithm with an average success probability of 82%, surpassing state-of-the-art dynamic and static implementations in both scale and performance; an 8-bit quantum phase-estimation protocol with estimation errors below 10-3; and the first dynamic-circuit implementation of Shor's algorithm on a superconducting platform, factoring 15 over all coprime bases with squared statistical overlap values above 99.8%. These results provide concrete benchmarks for future DQC implementations and highlight the versatile advantages of DQCs with the hybrid qubit-qudit architecture, establishing it as a promising route toward scalable, programmable quantum computation.

quant-pharXiv:2608.04780Aug 6, 20260 citations

Dynamically Reconfigurable Quantum Circuits for Algorithm Optimization

Jincheng Zhang

This paper proposes a novel approach to quantum algorithm optimization through dynamically reconfigurable quantum circuits. The core concept involves adapting the structure of a quantum circuit during its execution, responding to real-time feedback derived from quantum state analysis. Traditional quantum circuit design often relies on static, pre-defined architectures, limiting their adaptability and potential for optimization. This work introduces a control system capable of monitoring qubit states and dynamically altering circuit topology – specifically, adjusting gate sequences and potentially even adding or removing qubits – to minimize gate count and maximize coherence, thereby improving overall algorithm efficiency. The theoretical framework presented here outlines the key components and operational principles of such a system, highlighting its potential to overcome the limitations of static circuits and usher in a new era of adaptive quantum computation. We demonstrate, through a mathematical model, how this dynamic reconfiguration can be strategically implemented to address specific algorithmic challenges, focusing on reducing circuit complexity and enhancing the fidelity of quantum computations. The key to this approach lies in continuous feedback loops and a sophisticated control algorithm that leverages quantum state information to guide circuit modifications. This allows for a more tailored and efficient execution of quantum algorithms compared to static designs.

Sep 7, 20260 citations

An FPGA-based Emulation Process for Dynamic Quantum Circuits

Yicheng Song, Željko Žilić

The current quantum computation on physical devices has predominantly been constrained to basic, time-ordered sequences of unitary quantum operations culminating in a final projective measurement. As quantum computing hardware evolves in scale and functionality, it becomes crucial to facilitate the construction of quantum circuits beyond their traditional confines. Recent progress in quantum hardware has brought about mid-circuit measurements and resets, allowing for the recycling of measured qubits and notably decreasing the qubit demands for running quantum algorithms. We propose an FPGA-based dynamic quantum circuit emulation process to provide an emulation platform for designing and verifying dynamic quantum circuits.

International Symposium on Quality Electronic Design (ISQED)Apr 23, 20253 citations

Efficient Implementation of Randomized Quantum Algorithms With Dynamic Circuits

Shu Kanno, Ikko Hamamura, Rudy Raymond +2 more

Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an engineering method to reduce the executing time for randomized algorithms using dynamic circuits, i.e., quantum circuits involving intermediate measurement and feedback processes. The main idea is to generate the probability distribution defining a target randomized algorithm on a quantum computer, instead of a classical computer, which enables us to implement a variety of static circuits on a single dynamic circuit with many measurements. We applied the proposed method to the task of random Pauli measurement for one qubit on an IBM superconducting device, showing that a 14,000-fold acceleration of executing time was observed compared with a conventional method using static circuits. Additionally, for the problem of estimating expectation values of 28- and 40-qubit hydrogen chain models, we successfully applied the proposed method to realize the classical shadow with 10 million random circuits, which is the largest demonstration of classical shadow. This work significantly simplifies the execution of randomized algorithms on real quantum hardware.

arXiv:2503.17833IEEE Transactions on Quantum EngineeringJan 1, 20260 citations

Dynamically Reconfigurable Quantum Circuits for Real-Time Algorithm Adaptation

Jincheng Zhang

This paper investigates the design and implementation of dynamically reconfigurable quantum circuits, a crucial step towards realizing truly adaptive quantum computation. The core concept involves utilizing programmable quantum hardware alongside machine learning techniques to monitor and respond to the evolving demands of a quantum algorithm during its execution. Traditional quantum circuit design typically relies on static topologies, leading to inefficiencies and limitations in handling unforeseen complexities or errors. This work proposes a system where circuit topology – specifically gate selection and qubit routing – is adjusted in real-time based on predictive analysis of computational bottlenecks. The primary mechanism leverages machine learning models trained to identify performance bottlenecks and subsequently trigger reconfiguration. This dynamic adaptation allows for optimized resource utilization, enhanced error correction capabilities, and ultimately, the potential for achieving superior performance compared to pre-designed, static circuits. The presented framework represents a significant departure from conventional quantum circuit design, paving the way for algorithms that can intrinsically adapt to their environment, significantly improving the prospects for practical quantum computation.

Sep 5, 20260 citations