Efficient Implementation of Randomized Quantum Algorithms With Dynamic Circuits

Shu Kanno

doi:10.1109/TQE.2026.3671723

Efficient Implementation of Randomized Quantum Algorithms With Dynamic Circuits

2026-01-01

0

PRE

AI

DOI：10.1109/TQE.2026.3671723

Original

Original request for help

Save

Abstract

En 中文

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. In addition, 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.

Keywords:

Circuits

Qubit

Heuristic algorithms

Logic gates

Registers

Probability distribution

Quantum computing

Quantum circuit

Prevention and mitigation

Extraterrestrial measurements

Dynamic circuit

quantum computing

randomized algorithm

Efficient Implementation of Randomized Quantum Algorithms With Dynamic Circuits

Abstract

Journal

Organization