Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

RIVF International Conference on Computing and Communication Technologies (RIVF)

Efficient Random Quantum Circuit Generator: A Benchmarking Approach for Quantum Simulators

Vu Tuan Hai, Vu Trung Duong Le, Pham Hoai Luan, Yasuhiko Nakashima

Published Dec 21, 2024• 3 citations
Publisher

Abstract

Recently, many proposed simulators have been proposed. However, they lack a standard evaluation, including a benchmarking dataset and metrics set, leading to low confidence. To solve this problem, in this research, we propose a general random quantum circuit (RQC) generator. The proposed generator consumes fewer resources than the Haar random generator. When increasing the number of qubits, the resources used by the RQC generator remain constant, while the resources for Haar increase exponentially. To demonstrate the applicability of RQC, we evaluated on 14GB dataset of 15,000 generated quantum circuits through four simulators and three hardware-based simulators. Moreover, the evaluation metrics have been clarified for the benchmarking process of quantum simulators. The experiment results based on these metrics demonstrate that the RQC generator is a practical component for random quantum circuit benchmarking.

DOI
10.1109/rivf64335.2024.11009047

Related papers

Random Quantum Circuits and Pseudo-Random Unitary Operators

Joseph Emerson, Etera R. Livine, Seth Lloyd

Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudo-random ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group and describe how the rate of convergence may be calculated for specific applications.

•Mar 28, 2005•4 citations

Convergence conditions for random quantum circuits

Joseph Emerson, Etera R. Livine, Seth Lloyd

Efficient methods for generating pseudorandomly distributed unitary operators are needed for the practical application of Haar-distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudorandom ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group, though the rate for uniform convergence must decrease exponentially with the number of qubits. We describe how the rate of convergence for test functions associated with specific randomization tasks leads to weaker convergence conditions that may allow efficient random circuit constructions.

arXiv:quant-ph/0503210•Physical Review A•Dec 2, 2005•91 citations

Benchmarking Simulated and Physical Quantum Processing Units Using Quantum and Hybrid Algorithms

Alexey A. Melnikov

Summary Quantum computing is a rapidly growing technology field with increasingly useful applications across industry and research. This new paradigm of computing has the potential to solve classically intractable problems by exploiting an exponentially increasing computational space. This allows quantum algorithms to dramatically reduce the runtime for solving computationally resource-intensive problems. Quantum Neural Networks (QNNs) [ 1 - 4 ] present a promising opportunity for overcoming the scaling problem in classical machine learning. However, training QNNs requires significant circuit evaluations, making them a resource-intensive use case for quantum processing units (QPUs). This study compares software development kits (SDKs) and hardware platforms to determine the fastest and most cost-efficient combination for developing novel quantum algorithms and uses QNNs as a general benchmark. The aim is to find the optimal balance of runtime, cost, and accuracy for executing quantum circuits.

EAGE High Performance Computing Workshop•Jan 1, 2023•0 citations

Efficient Classical Simulation of Random Shallow 2D Quantum Circuits

John C. Napp, Rolando L. La Placa, Alexander M. Dalzell +2 more

A central question of quantum computing is determining the source of the advantage of quantum computation over classical computation.Even though simulating quantum dynamics on a classical computer is thought to require exponential overhead in the worst case, efficient simulations are known to exist in several special cases.It was widely assumed that these easy-to-simulate cases as well as any yetundiscovered ones could be avoided by choosing a quantum circuit at random.We prove that this intuition is false by showing that certain families of constant-depth, 2D random circuits can be approximately simulated on a classical computer in time only linear in the number of qubits and gates, even though the same families are capable of universal quantum computation and are hard to exactly simulate in the worst case (under standard hardness assumptions).While our proof applies to specific random circuit families, we demonstrate numerically that typical instances of more general families of sufficiently shallow constantdepth 2D random circuits are also efficiently simulable.We propose two classical simulation algorithms.One is based on first simulating spatially local regions which are then "stitched" together via recovery maps.The other reduces the 2D simulation problem to a problem of simulating a form of 1D dynamics consisting of alternating rounds of random local unitaries and weak measurements.Similar processes have recently been the subject of an intensive research focus, which has observed that the dynamics generally undergo a phase transition from a low-entanglement (and efficient-to-simulate) regime to a highentanglement (and inefficient-to-simulate) regime as measurement strength is varied.Via a mapping from random quantum circuits to classical statistical mechanical models, we give analytical evidence that a similar computational phase transition occurs for both of our algorithms as parameters of the circuit architecture like the local Hilbert space dimension and circuit depth are varied and, additionally, that the effective 1D dynamics corresponding to sufficiently shallow random quantum circuits falls within the efficient-to-simulate regime.Implementing the latter algorithm for the depth-3 "brickwork" architecture, for which exact simulation is hard, we find that a laptop could simulate typical instances on a 409 × 409 grid with a total variation distance error less than 0.01 in approximately one minute per sample, a task intractable for previously known circuit simulation algorithms.Numerical results support our analytic evidence that the algorithm is asymptotically efficient.

arXiv:2001.00021•Physical Review X•Apr 27, 2022•180 citations

Design of an Efficient Quantum Circuit Simulator

S Maity, A Pal, Tushar Kanti Roy +2 more

Work is in progress throughout the globe to efficiently use the potential of the quantum theory of computation over their classical counterpart and hence there is a need of building quantum computing hardware. The target of building quantum computers can be achieved if we have better tools for the design of quantum hardware. Quantum circuit simulators are tools for the logic verification of quantum circuits and they can be an essential component of quantum CAD tools in the future. This work is the extension of the previous work by the authors, in order to increase the efficiency of the simulator and to incorporate more components in the gate library. In this paper we have proposed an efficient simulator which can simulate a quantum circuit specified using the proposed quantum hardware descriptive language (QHDL).

International Symposium on Electronic System Design•Dec 1, 2010•3 citations

A Near Optimal Quantum Resource Allocation Using Hybrid Quantum Machine Learning Classifiers

P Vimal Suresh, M. Kowsigan

Hybrid Quantum-Classical Machine Learning (HQML) is an emerging technology that can be used for solving problems with higher computational intensity. This paradigm is designed to solve problems that remain challenging to classical machine learning approaches. Noisy Intermediate-Scale Quantum (NISQ) devices (which are today’s quantum computers) are prone to frequent errors and cannot perform fault-tolerant quantum computation. NISQ devices have a limited number of qubits, and as the number of qubits increases, circuit depth also increases, leading to increase in noise. Therefore, selecting the optimal number of qubits remains a challenge. The goal is to develop a framework that tests a Variational Quantum Classifier (VQC) with a different numbers of qubits. For each configuration, the model’s prediction accuracy and the hardware resources it consumes (gate count and circuit depth) are evaluated. Using this data, the best qubit configuration that provides the optimal balance between accuracy and resource utilization can be identified. Experiments were conducted using the Wisconsin Breast Cancer dataset, where benign and malignant tumors are classified. The dataset was preprocessed by applying Principal Component Analysis (PCA) to reduce the feature space to a maximum of six principal components. A ZZFeatureMap was used to encode the reduced features, which were then processed by a VQC with a RealAmplitudes ansatz. The COBYLA optimizer was used to train the VQC, and the experiment was repeated using different numbers of qubits from 2 to 6. Quantum circuits were transpiled into realistic IBM fake backends (FakeManilaV2 and FakeJakartaV2) for hardware-aware analysis, obtaining two key metrics: CNOT gate count and circuit depth. An AerSimulator configured with the FakeManilaV2 noise model was used to carry out the noise-aware simulation. The framework was evaluated using classification accuracy, training time, circuit depth, CNOT gate count, and noise-aware accuracy. Based on these criteria, the optimal qubit configuration that balances predictive performance with quantum hardware resource utilization was identified. The results identify 2 qubits as the optimal “sweet spot,” achieving 83.21% accuracy under ideal simulation and 81.75% under noise-aware simulation while maintaining lower resource requirements. These findings provide practical guidelines for resource-efficient hybrid quantum machine learning on NISQ hardware.

International Conference on Next-Gen Intelligent Computing and Applications (ICONICA)•Aug 1, 2026•0 citations
Recently, many proposed simulators have been proposed. However, they lack a standard evaluation, including a benchmarking dataset and metrics set, leading to low confidence. To solve this problem, in this research, we propose a general random quantum circuit (RQC) generator. The proposed generator consumes fewer resources than the Haar random generator. When increasing the number of qubits, the resources used by the RQC generator remain constant, while the resources for Haar increase exponentially. To demonstrate the applicability of RQC, we evaluated on 14GB dataset of 15,000 generated quantum circuits through four simulators and three hardware-based simulators. Moreover, the evaluation metrics have been clarified for the benchmarking process of quantum simulators. The experiment results based on these metrics demonstrate that the RQC generator is a practical component for random quantum circuit benchmarking.
Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudo-random ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group and describe how the rate of convergence may be calculated for specific applications.
Efficient methods for generating pseudorandomly distributed unitary operators are needed for the practical application of Haar-distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudorandom ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group, though the rate for uniform convergence must decrease exponentially with the number of qubits. We describe how the rate of convergence for test functions associated with specific randomization tasks leads to weaker convergence conditions that may allow efficient random circuit constructions.
Summary Quantum computing is a rapidly growing technology field with increasingly useful applications across industry and research. This new paradigm of computing has the potential to solve classically intractable problems by exploiting an exponentially increasing computational space. This allows quantum algorithms to dramatically reduce the runtime for solving computationally resource-intensive problems. Quantum Neural Networks (QNNs) [ 1 - 4 ] present a promising opportunity for overcoming the scaling problem in classical machine learning. However, training QNNs requires significant circuit evaluations, making them a resource-intensive use case for quantum processing units (QPUs). This study compares software development kits (SDKs) and hardware platforms to determine the fastest and most cost-efficient combination for developing novel quantum algorithms and uses QNNs as a general benchmark. The aim is to find the optimal balance of runtime, cost, and accuracy for executing quantum circuits.
A central question of quantum computing is determining the source of the advantage of quantum computation over classical computation.Even though simulating quantum dynamics on a classical computer is thought to require exponential overhead in the worst case, efficient simulations are known to exist in several special cases.It was widely assumed that these easy-to-simulate cases as well as any yetundiscovered ones could be avoided by choosing a quantum circuit at random.We prove that this intuition is false by showing that certain families of constant-depth, 2D random circuits can be approximately simulated on a classical computer in time only linear in the number of qubits and gates, even though the same families are capable of universal quantum computation and are hard to exactly simulate in the worst case (under standard hardness assumptions).While our proof applies to specific random circuit families, we demonstrate numerically that typical instances of more general families of sufficiently shallow constantdepth 2D random circuits are also efficiently simulable.We propose two classical simulation algorithms.One is based on first simulating spatially local regions which are then "stitched" together via recovery maps.The other reduces the 2D simulation problem to a problem of simulating a form of 1D dynamics consisting of alternating rounds of random local unitaries and weak measurements.Similar processes have recently been the subject of an intensive research focus, which has observed that the dynamics generally undergo a phase transition from a low-entanglement (and efficient-to-simulate) regime to a highentanglement (and inefficient-to-simulate) regime as measurement strength is varied.Via a mapping from random quantum circuits to classical statistical mechanical models, we give analytical evidence that a similar computational phase transition occurs for both of our algorithms as parameters of the circuit architecture like the local Hilbert space dimension and circuit depth are varied and, additionally, that the effective 1D dynamics corresponding to sufficiently shallow random quantum circuits falls within the efficient-to-simulate regime.Implementing the latter algorithm for the depth-3 "brickwork" architecture, for which exact simulation is hard, we find that a laptop could simulate typical instances on a 409 × 409 grid with a total variation distance error less than 0.01 in approximately one minute per sample, a task intractable for previously known circuit simulation algorithms.Numerical results support our analytic evidence that the algorithm is asymptotically efficient.
Work is in progress throughout the globe to efficiently use the potential of the quantum theory of computation over their classical counterpart and hence there is a need of building quantum computing hardware. The target of building quantum computers can be achieved if we have better tools for the design of quantum hardware. Quantum circuit simulators are tools for the logic verification of quantum circuits and they can be an essential component of quantum CAD tools in the future. This work is the extension of the previous work by the authors, in order to increase the efficiency of the simulator and to incorporate more components in the gate library. In this paper we have proposed an efficient simulator which can simulate a quantum circuit specified using the proposed quantum hardware descriptive language (QHDL).
Hybrid Quantum-Classical Machine Learning (HQML) is an emerging technology that can be used for solving problems with higher computational intensity. This paradigm is designed to solve problems that remain challenging to classical machine learning approaches. Noisy Intermediate-Scale Quantum (NISQ) devices (which are today’s quantum computers) are prone to frequent errors and cannot perform fault-tolerant quantum computation. NISQ devices have a limited number of qubits, and as the number of qubits increases, circuit depth also increases, leading to increase in noise. Therefore, selecting the optimal number of qubits remains a challenge. The goal is to develop a framework that tests a Variational Quantum Classifier (VQC) with a different numbers of qubits. For each configuration, the model’s prediction accuracy and the hardware resources it consumes (gate count and circuit depth) are evaluated. Using this data, the best qubit configuration that provides the optimal balance between accuracy and resource utilization can be identified. Experiments were conducted using the Wisconsin Breast Cancer dataset, where benign and malignant tumors are classified. The dataset was preprocessed by applying Principal Component Analysis (PCA) to reduce the feature space to a maximum of six principal components. A ZZFeatureMap was used to encode the reduced features, which were then processed by a VQC with a RealAmplitudes ansatz. The COBYLA optimizer was used to train the VQC, and the experiment was repeated using different numbers of qubits from 2 to 6. Quantum circuits were transpiled into realistic IBM fake backends (FakeManilaV2 and FakeJakartaV2) for hardware-aware analysis, obtaining two key metrics: CNOT gate count and circuit depth. An AerSimulator configured with the FakeManilaV2 noise model was used to carry out the noise-aware simulation. The framework was evaluated using classification accuracy, training time, circuit depth, CNOT gate count, and noise-aware accuracy. Based on these criteria, the optimal qubit configuration that balances predictive performance with quantum hardware resource utilization was identified. The results identify 2 qubits as the optimal “sweet spot,” achieving 83.21% accuracy under ideal simulation and 81.75% under noise-aware simulation while maintaining lower resource requirements. These findings provide practical guidelines for resource-efficient hybrid quantum machine learning on NISQ hardware.