Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing

• URL: http://arxiv.org/abs/2508.00514v1
• Date: Fri, 01 Aug 2025 10:48:52 GMT
• Title: Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing
• Authors: Sebastiaan Brand, Alfons Laarman,
• Abstract summary: We present an efficient implementation of parallel edge-valued DDs.<n>We use these DDs to implement two use cases: simulation and equivalence checking of quantum circuits.<n>Our tool, Q-Sylvan, shows a single-core performance that is competitive with the state-of-the-art quantum DD tool MQT DDSIM on large instances.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As physical realizations of quantum computers move closer towards practical applications, the need for tools to analyze and verify quantum algorithms grows. Among the algorithms and data structures used to tackle such problems, decision diagrams (DDs) have shown much success. However, an obstacle with DDs is their efficient parallelization, and while parallel speedups have been obtained for DDs used in classical applications, attempts to parallelize operations for quantum-specific DDs have yielded only limited success. In this work, we present an efficient implementation of parallel edge-valued DDs, which makes use of fine-grained task parallelism and lock-free hash tables. Additionally, we use these DDs to implement two use cases: simulation and equivalence checking of quantum circuits. In our empirical evaluation we find that our tool, Q-Sylvan, shows a single-core performance that is competitive with the state-of-the-art quantum DD tool MQT DDSIM on large instances, and moreover achieves parallel speedups of up to x18 on 64 cores.

Related papers

• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers [0.4969640751053581]
  We show that probabilistic computers (p-computers) provide a compelling and scalable classical pathway for solving hard optimization problems.<n>We focus on two key algorithms applied to 3D spin glasses: discrete-time simulated quantum annealing (DT-SQA) and adaptive parallel tempering (APT)<n>We show that APT, when supported by non-local isoenergetic cluster moves, exhibits a more favorable scaling and ultimately outperforms DT-SQA.
  arXiv  Detail & Related papers  (2025-03-13T12:24:13Z)
• Stripping Quantum Decision Diagrams of their Identity [4.014151979580607]
  We make an important step forward for quantum DDs by stripping these identity structures from quantum operations. We obtain a structure that is more natural for quantum computing and significantly speeds up with computations-with a runtime improvement of up to 70x compared to the state-of-the-art.
  arXiv  Detail & Related papers  (2024-06-17T18:00:01Z)
• 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)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Parallelizing Quantum-Classical Workloads: Profiling the Impact of Splitting Techniques [4.741651490006498]
  We evaluate two workload splitting techniques on IBM's Quantum Cloud. We see that (1) VQE with circuit cutting is 39% better in ground state estimation than the uncut version, and (2) QSVM that combines data parallelization with reduced feature set yields upto 3x improvement in quantum workload execution time.
  arXiv  Detail & Related papers  (2023-05-11T05:46:55Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Effects of Dynamical Decoupling and Pulse-level Optimizations on IBM Quantum Computers [0.0]
  Dynamical decoupling (DD) is generally used to suppress the decoherence error. pulse-level optimization can be improved by creating hardware-native pulse-efficient gates. This paper implements all the popular DD sequences and evaluates their performances on IBM quantum chips.
  arXiv  Detail & Related papers  (2022-04-04T13:37:24Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Enabling Multi-programming Mechanism for Quantum Computing in the NISQ Era [0.0]
  NISQ devices have several physical limitations and unavoidable noisy quantum operations. Only small circuits can be executed on a quantum machine to get reliable results. We propose a Quantum Multi-programming Compiler (QuMC) to execute multiple quantum circuits on quantum hardware simultaneously.
  arXiv  Detail & Related papers  (2021-02-10T08:46:16Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)
• On connectivity-dependent resource requirements for digital quantum simulation of $d$-level particles [0.703901004178046]
  We study the number of SWAP gates required to Trotterize commonly used quantum operators. Results are applicable in hardware co-design and in choosing efficient qudit encodings for a given set of near-term quantum hardware.
  arXiv  Detail & Related papers  (2020-05-26T22:28:51Z)

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.