Automatic quantum function parallelization and memory management in Qrisp

• URL: http://arxiv.org/abs/2606.31837v1
• Date: Tue, 30 Jun 2026 15:40:51 GMT
• Title: Automatic quantum function parallelization and memory management in Qrisp
• Abstract summary: We introduce a novel data-structure for representing quantum programs called permeability DAG.<n> operating on this representation facilitates a variety of powerful transformations.<n>Memory management and parallelization can be made sensitive to execution speed details of each particular quantum gate.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Automated optimization of quantum programs has gathered significant attention amidst the recent advances of hardware manufacturers. In this work we introduce a novel data-structure for representing quantum programs called permeability DAG, which captures several useful properties of quantum programs across multiple levels of abstraction. Operating on this representation facilitates a variety of powerful transformations such as automatic parallelization, memory management and synthesis of uncomputation. More potential use-cases are listed in the outlook section. At the core, our representation abstracts away a class of non-trivial commutation relations, which stem from a feature called permeability. Both memory management and parallelization can be made sensitive to execution speed details of each particular quantum gate, implying our compilation methods are not only retargetable between NISQ/FT but even for individual device instances.

Related papers

• Classic and Quantum Task-Based Intelligent Runtime for QIRs Running on Multiple QPUs [1.212250364181868]
  We introduce an intelligent, task-based runtime that marries the Intelligent RuntIme System (IRIS) scheduler with a quantum programming stack through the Quantum Intermediate Representation Execution Engine (QIR-EE)<n>Our design allows programs written in the quantum intermediate representation (QIR) to be dispatched concurrently to a variety of back-ends, including multiple quantum simulators and nascent quantum processors, enabling genuine hybrid execution on a single node.
  arXiv  Detail & Related papers  (2026-05-12T01:14:13Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Efficient Quantum State Preparation with Bucket Brigade QRAM [47.72095699729477]
  Preparation of data in quantum states is a critical component in the design of quantum algorithms.<n>One of the main approaches to achieve efficient state preparation is through the use of Quantum Random Access Memory (QRAM)<n>We present a framework that integrates the physical model of the Bucket Brigade QRAM (BBQRAM) with the classical data structure of the Segment Tree to achieve efficient state preparation.
  arXiv  Detail & Related papers  (2025-10-17T18:50:07Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• 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)
• It's Quick to be Square: Fast Quadratisation for Quantum Toolchains [5.023742533119026]
  We consider a specific class of higher-level representations, i.e. unconstrained binary problems.<n>We devise novel automatic transformation mechanisms into widely used unconstrained binary optimisation problems.<n>We also identify what influence factors of lower-level details can be abstracted away in the transformation process.
  arXiv  Detail & Related papers  (2024-11-29T18:50:16Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Exploring ab initio machine synthesis of quantum circuits [0.0]
  Gate-level quantum circuits are often derived manually from higher level algorithms. Here we explore methods for the ab initio creation of circuits within a machine.
  arXiv  Detail & Related papers  (2022-06-22T17:48:29Z)
• Quantum Circuit Transformations with a Multi-Level Intermediate Representation Compiler [1.5855260762884629]
  We present a novel adaptation of the multi-level intermediate representation (MLIR) integrated into a quantum compiler. We first present how MLIR enables quantum circuit transformations for efficient execution on quantum computing devices. We demonstrate that mirror circuits inserted during compilation may test hardware performance.
  arXiv  Detail & Related papers  (2021-12-20T16:59:27Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• 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)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)

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.