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

A Controlled Single-Thread Benchmark of PennyLane, Qiskit, and Snowflurry for Ideal Statevector Circuit Simulation

Sayed Mohammad Badiezadegan

Published Sep 6, 2026• 0 citations
Publisher

Abstract

This study presents a reproducible, framework-level comparison of three open-source quantum software environments: PennyLane 0.45.1, Qiskit 2.5.2, and Snowflurry 0.6.0. Equivalent parameterized circuits were constructed in Python for PennyLane and Qiskit and in Julia for Snowflurry. Every circuit consisted of repeated layers of single-qubit rotations followed by a ring of controlled-NOT gates, and every framework returned the complete ideal statevector. Circuit construction time, first-execution time, warmed execution time, whole-process wall time, output probability, and state normalization were recorded. All common numerical thread controls were fixed to one, so the experiment measures controlled single-thread behavior rather than the maximum throughput of the tested computers. On the laptop, Snowflurry produced the lowest warmed median at 10 qubits, Qiskit at 12 qubits, PennyLane and Qiskit were nearly tied at 14 qubits, and PennyLane was fastest at 18 qubits. On an Intel Xeon E5-2697 v3 workstation, PennyLane was fastest at both 14 and 16 qubits. Snowflurry constructed circuits rapidly but exhibited greater simulation time as the statevector increased. Identical probabilities and unit state norms across all implementations support functional equivalence. The results characterize these particular built-in statevector paths; they do not constitute a general comparison of Python and Julia, nor of optimized accelerators such as PennyLane Lightning or Qiskit Aer.

DOI
10.6084/m9.figshare.33440497

Related papers

Benchmarking Qiskit and PennyLane Gradient-Computation Workflows for Variational Quantum Machine Learning

Viktoriia Hrodetska

Variational quantum machine learning (VQML) combines parameterized quantum circuits with classical optimization to train models on data-dependent cost functions. A central practical challenge in this workflow is that gradient evaluation can become a major computational bottleneck, and different quantum software frameworks provide different differentiation strategies. This paper shows that, in the tested statevector simulation setting, the choice of differentiation method has a stronger effect on one full gradient computation than the framework choice alone. To demonstrate this, the benchmark compares three configurations: Qiskit parameter-shift using Aer, PennyLane parameter-shift using lightning.qubit, and PennyLane adjoint differentiation using lightning.qubit. All configurations use the same four-qubit hardware-efficient ansatz, the same observable, and the same parameter scaling with circuit depth. Runtime is measured across increasing ansatz sizes, where increasing the number of layers also increases the number of trainable parameters and the circuit depth. The results show that simulator-specific adjoint differentiation scales substantially more efficiently than parameter-shift in this setting, while the comparison between Qiskit and PennyLane parameter-shift shows additional workflow-level performance differences under the same general differentiation rule. At 808 trainable parameters, PennyLane adjoint averaged 0.0598s, compared with 7.56s for Qiskit parameter-shift and 23.14s for PennyLane parameter-shift, corresponding to 126× and 387× lower mean runtime, respectively.

•Nov 2, 2026•0 citations

JAQSI: Just Another Quantum Simulator

Melvin Strobl, Maja Franz, Lukas Scheller +3 more

Classical simulation supports the development and validation of quantum algorithms through full-state inspection, controlled noise models and backpropagation, albeit for small quantum systems. Existing frameworks offer gate-level execution, differentiable pulse-level dynamics or optimised hardware execution. Just another quantum simulator (JAQSI) combines gate- and pulse-level simulation in one differentiable circuit model built upon JAX. Circuits are represented as pure functions of numerical inputs which support vectorised batches and JIT compilation. Within a single circuit, matrix-defined operations, gates synthesised from Hamiltonian time evolution and noise channels can be composed freely. For a fast simulation, gate and channel fusion reduces passes over the state, while adjoint differentiation computes expectation-value gradients with a constant number of statevectors. At pulse level, JAQSI reduces evolution under single-term Hamiltonians to a scalar pulse-area integral and reuses cached execution plans and compiled solvers. In a benchmark we compare JAQSI with PennyLane, Qiskit, Qibo, Qulacs, QuTiP and dynamiqs. At gate level, we observe performance either on par or an order of magnitude faster across statevector, density, noise and gradient simulation than the compared simulators up to 12 qubits. Beyond 18 qubits, JAQSI is on par with PennyLane Lightning in both statevector and gradient simulation. In the statevector and noisy density-matrix pulse benchmarks, it is at least 5 times faster than the other simulators, even with its closed-form solve disabled. Disabling the latter increases its runtime by at most a factor of 1.5. We provide JAQSI as open-source software on GitHub and PyPI.

quant-pharXiv:2610.05086•Oct 6, 2026•0 citations

Benchmarking quantum computing statevector simulators on high-performance computing

Jesús Cerrudo-Herrera, Daniel Talaván-Vega, Paloma Rodríguez-Oliver +2 more

The increasing complexity of quantum algorithms and the limitations of current Noisy Intermediate-Scale Quantum (NISQ) hardware underscore the importance of efficient classical simulators. To support informed decision-making by users of quantum circuit simulators, we benchmark seven statevector-based quantum circuit simulators (Qiskit, Qulacs, Qibo, Qsimov, Cirq, Pennylane and the Intel Quantum Simulator (IQS)) on a multicore node of the Lusitania high-performance computing (HPC) system. We evaluate their performance in terms of execution time, memory usage and core scalability using Grover’s algorithm, the quantum Fourier transform (QFT), and quantum volume (QV) circuits, across qubit counts ranging from 3 to 30. Our results reveal that Qulacs offers the best performance for circuits below 22 qubits, while Qiskit becomes the fastest for larger and more complex circuits. Qiskit and Qulacs achieve the most efficient parallel performance across multiple cores, while others display limited scaling benefits. IQS shows the lowest memory consumption in QFT and QV benchmarks for systems under 24 qubits; however, it suffers from higher execution times, particularly for Grover’s algorithm. The experimental implementation of Qsimov consistently underperforms in both runtime and scalability; for this reason, it is employed as a baseline in our measurements, serving to highlight the importance of performance optimizations in statevector-based quantum circuit simulators. Previous findings provide a comprehensive performance landscape to guide researchers in selecting appropriate simulators for both standard and large-scale quantum workloads on HPC infrastructures.

SIMULATION•Apr 22, 2026•0 citations

Benchmark Study for Quantum Statevector Simulators for Scientific Computing

Timothy M. Yeo, Rodney W. Lessard

Quantum circuit simulators are essential for quantum algorithm development, yet systematic runtime benchmarks comparing major frameworks across CPU and GPU backends are limited. We benchmark three open-source frameworks - Cirq (qsim), CUDA-Q, and Qiskit (Aer) - on statevector simulation of the 2D quantum acoustic wave equation, evolved via Trotterized Hamiltonian dynamics, for problem sizes from 7 to 29 qubits on a single Azure virtual machine. The evaluation spans four categories: CPU runtime versus qubit count, strong scalability on multi-core CPUs at 27 qubits, GPU runtime versus qubit count, and GPU-over-CPU speedup. Relative rankings shift from one category to the next. On CPU, Cirq is fastest up to 23 qubits (2.4x faster than Qiskit at 21 qubits), but Qiskit overtakes it at larger sizes and higher thread counts, sustaining 80% parallel efficiency at 16 threads. On GPU, CUDA-Q leads between 13 and 21 qubits, while Cirq becomes the fastest GPU backend at large problem sizes, achieving 1.5x and 2.3x speedups over CUDA-Q and Qiskit at 29 qubits. GPU-over-CPU speedup ratios should be interpreted alongside absolute GPU runtimes; CUDA-Q's 1500x at 21 qubits is largely driven by the limited scaling of its CPU backend (qpp), and the absolute GPU runtimes show that the three frameworks' GPU backends differ by less than these ratios alone suggest. These results indicate that no single framework dominates across configurations, and that backend selection for statevector simulation should be guided by both target hardware and problem size.

physics.geo-phCross-listedarXiv:2611.01176•Nov 3, 2026•0 citations

Hybrid quantum programming with PennyLane Lightning on HPC platforms

Ali Asadi, Amintor Dusko, Chae-Yeun Park +5 more

We introduce PennyLane's Lightning suite, a collection of high-performance state-vector simulators targeting CPU, GPU, and HPC-native architectures and workloads. Quantum applications such as QAOA, VQE, and synthetic workloads are implemented to demonstrate the supported classical computing architectures and showcase the scale of problems that can be simulated using our tooling. We benchmark the performance of Lightning with backends supporting CPUs, as well as NVidia and AMD GPUs, and compare the results to other commonly used high-performance simulator packages, demonstrating where Lightning's implementations give performance leads. We show improved CPU performance by employing explicit SIMD intrinsics and multi-threading, batched task-based execution across multiple GPUs, and distributed forward and gradient-based quantum circuit executions across multiple nodes. Our data shows we can comfortably simulate a variety of circuits, giving examples with up to 30 qubits on a single device or node, and up to 41 qubits using multiple nodes.

arXiv:2403.02512•Mar 4, 2024•48 citations

SuperFermion: A Leap Forward in Quantum Circuit Simulation Efficiency

Md. Hasibul Hassan Himal, Muhebbullah Tamim

This Zenodo upload contains the complete evaluation data, benchmark suites, and preprint manuscript for SuperFermion: A Leap Forward in Quantum Circuit Simulation Efficiency. The study evaluates SuperFermion against prominent open-source quantum simulation frameworks—including Qiskit Aer, PennyLane, Cirq, Qulacs, and Stim—across multiple execution paradigms: Statevector Learning: Assesses 252 identical conditions (4 to 20 qubits) across quantum kernel estimation (QSVM, QKRR, QKPCA), variational learning (VQC, VQR), combinatorial optimization (QAOA, VQE), and circuit sweeps, totaling 1,512 simulator jobs. Matrix Product States (MPS) & Dynamic Circuits: Explores bounded entanglement, canonical tensor structures, and mid-circuit measurements/feed-forward operations, scaling structured circuits up to 1,000 qubits and native MPS teleportation to 120 qubits. Specialized Execution Modes: Examines compiled adjoint gradients, dense-core density matrices, and a unified binary stabilizer/Clifford tableau sampling engine across up to 4,096 qubits. The repository provides source-traceable verification logs, JSONL/CSV records, capability probes, analysis scripts, and an integrated manuscript comprising comprehensive performance tables and scaling figures.

•Oct 22, 2026•0 citations
This study presents a reproducible, framework-level comparison of three open-source quantum software environments: PennyLane 0.45.1, Qiskit 2.5.2, and Snowflurry 0.6.0. Equivalent parameterized circuits were constructed in Python for PennyLane and Qiskit and in Julia for Snowflurry. Every circuit consisted of repeated layers of single-qubit rotations followed by a ring of controlled-NOT gates, and every framework returned the complete ideal statevector. Circuit construction time, first-execution time, warmed execution time, whole-process wall time, output probability, and state normalization were recorded. All common numerical thread controls were fixed to one, so the experiment measures controlled single-thread behavior rather than the maximum throughput of the tested computers. On the laptop, Snowflurry produced the lowest warmed median at 10 qubits, Qiskit at 12 qubits, PennyLane and Qiskit were nearly tied at 14 qubits, and PennyLane was fastest at 18 qubits. On an Intel Xeon E5-2697 v3 workstation, PennyLane was fastest at both 14 and 16 qubits. Snowflurry constructed circuits rapidly but exhibited greater simulation time as the statevector increased. Identical probabilities and unit state norms across all implementations support functional equivalence. The results characterize these particular built-in statevector paths; they do not constitute a general comparison of Python and Julia, nor of optimized accelerators such as PennyLane Lightning or Qiskit Aer.
Variational quantum machine learning (VQML) combines parameterized quantum circuits with classical optimization to train models on data-dependent cost functions. A central practical challenge in this workflow is that gradient evaluation can become a major computational bottleneck, and different quantum software frameworks provide different differentiation strategies. This paper shows that, in the tested statevector simulation setting, the choice of differentiation method has a stronger effect on one full gradient computation than the framework choice alone. To demonstrate this, the benchmark compares three configurations: Qiskit parameter-shift using Aer, PennyLane parameter-shift using lightning.qubit, and PennyLane adjoint differentiation using lightning.qubit. All configurations use the same four-qubit hardware-efficient ansatz, the same observable, and the same parameter scaling with circuit depth. Runtime is measured across increasing ansatz sizes, where increasing the number of layers also increases the number of trainable parameters and the circuit depth. The results show that simulator-specific adjoint differentiation scales substantially more efficiently than parameter-shift in this setting, while the comparison between Qiskit and PennyLane parameter-shift shows additional workflow-level performance differences under the same general differentiation rule. At 808 trainable parameters, PennyLane adjoint averaged 0.0598s, compared with 7.56s for Qiskit parameter-shift and 23.14s for PennyLane parameter-shift, corresponding to 126× and 387× lower mean runtime, respectively.
Classical simulation supports the development and validation of quantum algorithms through full-state inspection, controlled noise models and backpropagation, albeit for small quantum systems. Existing frameworks offer gate-level execution, differentiable pulse-level dynamics or optimised hardware execution. Just another quantum simulator (JAQSI) combines gate- and pulse-level simulation in one differentiable circuit model built upon JAX. Circuits are represented as pure functions of numerical inputs which support vectorised batches and JIT compilation. Within a single circuit, matrix-defined operations, gates synthesised from Hamiltonian time evolution and noise channels can be composed freely. For a fast simulation, gate and channel fusion reduces passes over the state, while adjoint differentiation computes expectation-value gradients with a constant number of statevectors. At pulse level, JAQSI reduces evolution under single-term Hamiltonians to a scalar pulse-area integral and reuses cached execution plans and compiled solvers. In a benchmark we compare JAQSI with PennyLane, Qiskit, Qibo, Qulacs, QuTiP and dynamiqs. At gate level, we observe performance either on par or an order of magnitude faster across statevector, density, noise and gradient simulation than the compared simulators up to 12 qubits. Beyond 18 qubits, JAQSI is on par with PennyLane Lightning in both statevector and gradient simulation. In the statevector and noisy density-matrix pulse benchmarks, it is at least 5 times faster than the other simulators, even with its closed-form solve disabled. Disabling the latter increases its runtime by at most a factor of 1.5. We provide JAQSI as open-source software on GitHub and PyPI.
The increasing complexity of quantum algorithms and the limitations of current Noisy Intermediate-Scale Quantum (NISQ) hardware underscore the importance of efficient classical simulators. To support informed decision-making by users of quantum circuit simulators, we benchmark seven statevector-based quantum circuit simulators (Qiskit, Qulacs, Qibo, Qsimov, Cirq, Pennylane and the Intel Quantum Simulator (IQS)) on a multicore node of the Lusitania high-performance computing (HPC) system. We evaluate their performance in terms of execution time, memory usage and core scalability using Grover’s algorithm, the quantum Fourier transform (QFT), and quantum volume (QV) circuits, across qubit counts ranging from 3 to 30. Our results reveal that Qulacs offers the best performance for circuits below 22 qubits, while Qiskit becomes the fastest for larger and more complex circuits. Qiskit and Qulacs achieve the most efficient parallel performance across multiple cores, while others display limited scaling benefits. IQS shows the lowest memory consumption in QFT and QV benchmarks for systems under 24 qubits; however, it suffers from higher execution times, particularly for Grover’s algorithm. The experimental implementation of Qsimov consistently underperforms in both runtime and scalability; for this reason, it is employed as a baseline in our measurements, serving to highlight the importance of performance optimizations in statevector-based quantum circuit simulators. Previous findings provide a comprehensive performance landscape to guide researchers in selecting appropriate simulators for both standard and large-scale quantum workloads on HPC infrastructures.
Quantum circuit simulators are essential for quantum algorithm development, yet systematic runtime benchmarks comparing major frameworks across CPU and GPU backends are limited. We benchmark three open-source frameworks - Cirq (qsim), CUDA-Q, and Qiskit (Aer) - on statevector simulation of the 2D quantum acoustic wave equation, evolved via Trotterized Hamiltonian dynamics, for problem sizes from 7 to 29 qubits on a single Azure virtual machine. The evaluation spans four categories: CPU runtime versus qubit count, strong scalability on multi-core CPUs at 27 qubits, GPU runtime versus qubit count, and GPU-over-CPU speedup. Relative rankings shift from one category to the next. On CPU, Cirq is fastest up to 23 qubits (2.4x faster than Qiskit at 21 qubits), but Qiskit overtakes it at larger sizes and higher thread counts, sustaining 80% parallel efficiency at 16 threads. On GPU, CUDA-Q leads between 13 and 21 qubits, while Cirq becomes the fastest GPU backend at large problem sizes, achieving 1.5x and 2.3x speedups over CUDA-Q and Qiskit at 29 qubits. GPU-over-CPU speedup ratios should be interpreted alongside absolute GPU runtimes; CUDA-Q's 1500x at 21 qubits is largely driven by the limited scaling of its CPU backend (qpp), and the absolute GPU runtimes show that the three frameworks' GPU backends differ by less than these ratios alone suggest. These results indicate that no single framework dominates across configurations, and that backend selection for statevector simulation should be guided by both target hardware and problem size.
We introduce PennyLane's Lightning suite, a collection of high-performance state-vector simulators targeting CPU, GPU, and HPC-native architectures and workloads. Quantum applications such as QAOA, VQE, and synthetic workloads are implemented to demonstrate the supported classical computing architectures and showcase the scale of problems that can be simulated using our tooling. We benchmark the performance of Lightning with backends supporting CPUs, as well as NVidia and AMD GPUs, and compare the results to other commonly used high-performance simulator packages, demonstrating where Lightning's implementations give performance leads. We show improved CPU performance by employing explicit SIMD intrinsics and multi-threading, batched task-based execution across multiple GPUs, and distributed forward and gradient-based quantum circuit executions across multiple nodes. Our data shows we can comfortably simulate a variety of circuits, giving examples with up to 30 qubits on a single device or node, and up to 41 qubits using multiple nodes.
This Zenodo upload contains the complete evaluation data, benchmark suites, and preprint manuscript for SuperFermion: A Leap Forward in Quantum Circuit Simulation Efficiency. The study evaluates SuperFermion against prominent open-source quantum simulation frameworks—including Qiskit Aer, PennyLane, Cirq, Qulacs, and Stim—across multiple execution paradigms: Statevector Learning: Assesses 252 identical conditions (4 to 20 qubits) across quantum kernel estimation (QSVM, QKRR, QKPCA), variational learning (VQC, VQR), combinatorial optimization (QAOA, VQE), and circuit sweeps, totaling 1,512 simulator jobs. Matrix Product States (MPS) & Dynamic Circuits: Explores bounded entanglement, canonical tensor structures, and mid-circuit measurements/feed-forward operations, scaling structured circuits up to 1,000 qubits and native MPS teleportation to 120 qubits. Specialized Execution Modes: Examines compiled adjoint gradients, dense-core density matrices, and a unified binary stabilizer/Clifford tableau sampling engine across up to 4,096 qubits. The repository provides source-traceable verification logs, JSONL/CSV records, capability probes, analysis scripts, and an integrated manuscript comprising comprehensive performance tables and scaling figures.