Qandle: Accelerating State Vector Simulation Using Gate-Matrix Caching and Circuit Splitting

• URL: http://arxiv.org/abs/2404.09213v1
• Date: Sun, 14 Apr 2024 10:52:01 GMT
• Title: Qandle: Accelerating State Vector Simulation Using Gate-Matrix Caching and Circuit Splitting
• Abstract summary: We address the computational complexity associated with state-vector simulation for quantum circuits. Quantum gate matrix caching reduces the overhead of repeated applications of the Kronecker product. Circuit splitting divides the circuit into sub-circuits with fewer gates by constructing a dependency graph.
• Score: 3.3002472385435655
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To address the computational complexity associated with state-vector simulation for quantum circuits, we propose a combination of advanced techniques to accelerate circuit execution. Quantum gate matrix caching reduces the overhead of repeated applications of the Kronecker product when applying a gate matrix to the state vector by storing decomposed partial matrices for each gate. Circuit splitting divides the circuit into sub-circuits with fewer gates by constructing a dependency graph, enabling parallel or sequential execution on disjoint subsets of the state vector. These techniques are implemented using the PyTorch machine learning framework. We demonstrate the performance of our approach by comparing it to other PyTorch-compatible quantum state-vector simulators. Our implementation, named Qandle, is designed to seamlessly integrate with existing machine learning workflows, providing a user-friendly API and compatibility with the OpenQASM format. Qandle is an open-source project hosted on GitHub https://github.com/gstenzel/qandle and PyPI https://pypi.org/project/qandle/ .

Related papers

• Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth [73.08853228981701]
  Matrix chain multiplication is a problem in scientific computing, machine learning, and graph analysis.<n>We present emphTwo-Tower Matrix, a quantum subroutine that encodes the product $mathcalW$ of the $K$ matrices into a quantum state in circuit depth.
  arXiv  Detail & Related papers  (2026-07-14T18:42:40Z)
• QSeqSim: A Symbolic Simulator for Qiskit While Loops Using Sequential Quantum Circuits [11.52320320397442]
  QSeqSim takes Qiskit QuantumCircuit objects, translates them into OpenQASM 3 code, and organises the resulting program.<n>Building on this semantics, QSeqSim adopts a Binary Decision Diagram (BDD)-based symbolic representation.<n>Our experiments demonstrate that QSeqSim scales to substantial while-induced sequential circuits.
  arXiv  Detail & Related papers  (2026-05-14T14:25:39Z)
• Unitaria: Quantum Linear Algebra via Block Encodings [0.0]
  Unitaria is a Python library that implements quantum algorithms based on block encodings.<n>Unitaria provides a composable, array-like interface through which users can define block encodings of matrices and vectors.<n>A key feature is a matrix-arithmetic evaluation path in which every operation can be computed directly on encoded vectors and matrices.
  arXiv  Detail & Related papers  (2026-05-11T16:00:15Z)
• AQ-Stacker: An Adaptive Quantum Matrix Multiplication Algorithm with Scaling via Parallel Hadamard Stacking [0.0]
  Matrix multiplication (MatMul) is the computational backbone of modern machine learning.<n>We propose a hybrid quantum-classical algorithm for matrix multiplication based on an adaptive configuration of Hadamard tests.
  arXiv  Detail & Related papers  (2026-04-02T21:29:57Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Quantum Tensor Representation via Circuit Partitioning and Reintegration [0.6766416093990318]
  We introduce shardQ, a method that leverages the SparseCut algorithm with matrix product state compilation and a global knitting technique.<n>This study also presents the results regarding application readiness.
  arXiv  Detail & Related papers  (2025-11-07T18:59:58Z)
• Qiboml: towards the orchestration of quantum-classical machine learning [53.28668485072944]
  We present Qiboml, an open-source software library for orchestrating quantum and classical machine learning.<n>We showcase its functionalities, including diverse simulation options, noise-aware simulations and real-time error mitigation and calibration.
  arXiv  Detail & Related papers  (2025-10-13T18:00:00Z)
• Distributed Implementation of Variational Quantum Eigensolver to Solve QUBO Problems [0.0]
  We present a distributed algorithm and implementation of the variational quantum eigensolver (VQE)<n>DVQE enables the execution of parameterized quantum circuits across multiple quantum processing units (QPUs) in a distributed fashion.
  arXiv  Detail & Related papers  (2025-08-24T17:55:07Z)
• Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• TQml Simulator: Optimized Simulation of Quantum Machine Learning [0.0]
  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.
  arXiv  Detail & Related papers  (2025-06-05T11:19:05Z)
• A Hybrid Transformer Architecture with a Quantized Self-Attention Mechanism Applied to Molecular Generation [0.0]
  We propose a hybrid quantum-classical self-attention mechanism as part of a transformer decoder. We show that the time complexity of the query-key dot product is reduced from $mathcalO(n2 d)$ in a classical model to $mathcalO(n2 d)$ in our quantum model. This work provides a promising avenue for quantum-enhanced natural language processing (NLP)
  arXiv  Detail & Related papers  (2025-02-26T15:15:01Z)
• An alternative explicit circuit diagram for the quantum search algorithm by implementing a non-unitary gate [0.0]
  Since the final quantum state in the Grover search algorithm is the normalized marked quantum state from the Gram-Schmidt process, we can generate this vector by using a non-unitary gate. We present multiple explicit unitary implementations by using the square root of the non-unitary matrix and by a unitary matrix that mimics the Gram-Schmidt process.
  arXiv  Detail & Related papers  (2024-12-21T07:26:30Z)
• Restructuring Vector Quantization with the Rotation Trick [36.03697966463205]
  Vector Quantized Variational AutoEncoders (VQ-VAEs) are designed to compress a continuous input to a discrete latent space and reconstruct it with minimal distortion.<n>As vector quantization is non-differentiable, the gradient to the encoder flows around the vector quantization layer rather than through it in a straight-through approximation.<n>We propose a way to propagate gradients through the vector quantization layer of VQ-VAEs.
  arXiv  Detail & Related papers  (2024-10-08T23:39:34Z)
• Indirect Quantum Approximate Optimization Algorithms: application to the TSP [1.1786249372283566]
  Quantum Alternating Operator Ansatz takes into consideration a general parameterized family of unitary operators to efficiently model the Hamiltonian describing the set of vectors. This algorithm creates an efficient alternative to QAOA, where: 1) a Quantum parametrized circuit executed on a quantum machine models the set of string vectors; 2) a Classical meta-optimization loop executed on a classical machine; 3) an estimation of the average cost of each string vector computing.
  arXiv  Detail & Related papers  (2023-11-06T17:39:14Z)
• Soft Convex Quantization: Revisiting Vector Quantization with Convex Optimization [40.1651740183975]
  We propose Soft Convex Quantization (SCQ) as a direct substitute for Vector Quantization (VQ) SCQ works like a differentiable convex optimization (DCO) layer. We demonstrate its efficacy on the CIFAR-10, GTSRB and LSUN datasets.
  arXiv  Detail & Related papers  (2023-10-04T17:45:14Z)
• QCLAB++: Simulating Quantum Circuits on GPUs [0.0]
  We introduce qclab++, a light-weight, fully-templated C++ package for GPU-accelerated quantum circuit simulations. qclab++ is designed for performance and numerical stability through highly optimized gate simulation algorithms. We also introduce qclab, a quantum circuit toolbox for Matlab with a syntax that mimics qclab++.
  arXiv  Detail & Related papers  (2023-02-28T22:56:48Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Batch-efficient EigenDecomposition for Small and Medium Matrices [65.67315418971688]
  EigenDecomposition (ED) is at the heart of many computer vision algorithms and applications. We propose a QR-based ED method dedicated to the application scenarios of computer vision.
  arXiv  Detail & Related papers  (2022-07-09T09:14:12Z)
• A Quantum Dot Plot Generation Algorithm for Pairwise Sequence Alignment [0.0]
  Quantum Pairwise Sequence Alignment (QPSA) algorithm offers exponential speedups in data alignment tasks. It relies on an open problem of efficiently encoding the classical data being aligned into quantum superposition. We provide an alternative, explicit construction of this oracle called the Quantum Dot Plot (QDP) We evaluate QDP's operational complexity via analysis of the quantum machine instructions generated by the Q# and Qiskit software frameworks.
  arXiv  Detail & Related papers  (2021-07-23T16:48:29Z)
• Fast quantum circuit simulation using hardware accelerated general purpose libraries [69.43216268165402]
  CuPy is a general purpose library (linear algebra) developed specifically for GPU-based quantum circuits. For supremacy circuits the speedup is around 2x, and for quantum multipliers almost 22x compared to state-of-the-art C++-based simulators.
  arXiv  Detail & Related papers  (2021-06-26T10:41:43Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Deterministic Algorithms for Compiling Quantum Circuits with Recurrent Patterns [0.0]
  Current quantum processors are noisy, have limited coherence and imperfect gate implementations. We present novel deterministic algorithms for compiling recurrent quantum circuit patterns in time. Our solution produces unmatched results on RyRz circuits.
  arXiv  Detail & Related papers  (2021-02-17T13:59:12Z)
• 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)
• QSystem: bitwise representation for quantum circuit simulations [0.0]
  We present QSystem, an open-source platform for the simulation of quantum circuits. We focus on bitwise operations on a Hashmap data structure storing quantum states and gates.
  arXiv  Detail & Related papers  (2020-04-07T17:35:15Z)

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.