TQml Simulator: Optimized Simulation of Quantum Machine Learning

• URL: http://arxiv.org/abs/2506.04891v2
• Date: Fri, 06 Jun 2025 16:55:33 GMT
• Title: TQml Simulator: Optimized Simulation of Quantum Machine Learning
• Authors: Viacheslav Kuzmin, Basil Kyriacou, Mateusz Papierz, Mo Kordzanganeh, Alexey Melnikov,
• Abstract summary: We benchmark universal and gate-specific techniques for simulating the action of layers of gates on quantum state vectors.<n>We develop a numerical simulator, named TQml Simulator, that employs the most efficient simulation method for each layer in a given circuit.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hardware-efficient circuits employed in Quantum Machine Learning are typically composed of alternating layers of uniformly applied gates. High-speed numerical simulators for such circuits are crucial for advancing research in this field. In this work, we numerically benchmark universal and gate-specific techniques for simulating the action of layers of gates on quantum state vectors, aiming to accelerate the overall simulation of Quantum Machine Learning algorithms. Our analysis shows that the optimal simulation method for a given layer of gates depends on the number of qubits involved, and that a tailored combination of techniques can yield substantial performance gains in the forward and backward passes for a given circuit. Building on these insights, we developed a numerical simulator, named TQml Simulator, that employs the most efficient simulation method for each layer in a given circuit. We evaluated TQml Simulator on circuits constructed from standard gate sets, such as rotations and CNOTs, as well as on native gates from IonQ and IBM quantum processing units. In most cases, our simulator outperforms equivalent Pennylane's default_qubit simulator by up to a factor of 10, depending on the circuit, the number of qubits, the batch size of the input data, and the hardware used.

Related papers

• Efficient Simulation of High-Level Quantum Gates [3.0928226965455154]
  Existing simulation methods require compilation to a low-level gate-set before simulation.<n>This increases circuit size and incurs a considerable (typically exponential) overhead, even when the number of high-level gates is small.<n>Here we present a gadget-based simulator which simulates high-level gates directly, thereby allowing to avoid or reduce the blowup of compilation.
  arXiv  Detail & Related papers  (2025-07-06T10:48:42Z)
• SparQSim: Simulating Scalable Quantum Algorithms via Sparse Quantum State Representations [3.7112784544167248]
  We present SparQSim, a quantum simulator implemented in C++ inspired by the Feynman-based method.<n>SparQSim operates at the register level by storing only the nonzero components of the quantum state.
  arXiv  Detail & Related papers  (2025-03-19T11:23:26Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Sparse Simulation of VQE Circuits [0.0]
  Variational Quantum Eigensolver (VQE) is a promising algorithm for future Noisy Intermediate-Scale Quantum (NISQ) devices.<n>In this paper, we consider the classical simulation of the iterative Qubit Coupled Cluster (iQCC) ansatz.
  arXiv  Detail & Related papers  (2024-04-15T18:00:05Z)
• Deep Quantum Circuit Simulations of Low-Energy Nuclear States [51.823503818486394]
  We present advances in high-performance numerical simulations of deep quantum circuits. circuits up to 21 qubits and more than 115,000,000 gates can be efficiently simulated.
  arXiv  Detail & Related papers  (2023-10-26T19:10:58Z)
• Exact and approximate simulation of large quantum circuits on a single GPU [0.46603287532620735]
  We report competitive execution times for the exact simulation of Fourier transform circuits with up to 27 qubits. We also demonstrate the approximate simulation of all amplitudes of random circuits acting on 54 qubits with 7 layers at average fidelity higher than $4%$.
  arXiv  Detail & Related papers  (2023-04-28T16:45:28Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Parallel Simulation of Quantum Networks with Distributed Quantum State Management [56.24769206561207]
  We identify requirements for parallel simulation of quantum networks and develop the first parallel discrete event quantum network simulator. Our contributions include the design and development of a quantum state manager that maintains shared quantum information distributed across multiple processes. We release the parallel SeQUeNCe simulator as an open-source tool alongside the existing sequential version.
  arXiv  Detail & Related papers  (2021-11-06T16:51:17Z)
• Efficient calculation of gradients in classical simulations of variational quantum algorithms [0.0]
  We present a novel derivation of an emulation strategy to precisely calculate the gradient in O(P) time. Our strategy is very simple, uses only 'apply gate', 'clone state' and 'inner product' primitives. It is compatible with gate parallelisation schemes, and hardware accelerated and distributed simulators.
  arXiv  Detail & Related papers  (2020-09-06T21:39:44Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.