Discrete Flow-Based Generative Models for Measurement Optimization in Quantum Computing

• URL: http://arxiv.org/abs/2509.15486v1
• Date: Thu, 18 Sep 2025 23:23:36 GMT
• Title: Discrete Flow-Based Generative Models for Measurement Optimization in Quantum Computing
• Authors: Isaac L. Huidobro-Meezs, Jun Dai, Rodrigo A. Vargas-Hernández,
• Abstract summary: We introduce an algorithm that adapts Generative Flow Networks (GFlowNets) for coloring graph representations of Hamiltonians.<n>On benchmark molecular Hamiltonians, our method outperforms sorted-insertion baselines by reducing measurement costs.<n>This generative policy framework not only reduces measurement costs but also offers flexibility for potential hardware-aware adaptations.
• Score: 2.758609987735587
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Achieving chemical accuracy in quantum simulations is often constrained by the measurement bottleneck: estimating operators requires a large number of shots, which remains costly even on fault-tolerant devices and is further exacerbated on today's noisy hardware by finite circuit fidelity and error-mitigation overhead. Addressing this challenge involves a multiobjective optimization problem that balances total shot count, the number of distinct measurement circuits, and hardware-specific compilation constraints. Existing methods typically rely on heuristic graph-coloring strategies to group commuting or qubit-wise commuting Hamiltonian terms, or on greedy allocation schemes for distributing measurements. Such approaches explore only a limited portion of the combinatorial solution space, potentially missing superior solutions. We introduce an algorithm that adapts Generative Flow Networks (GFlowNets) for coloring graph representations of Hamiltonians, enabling the generation of diverse, high-quality groupings. Our approach samples colored graphs in proportion to a user-defined reward, naturally capturing multiobjective trade-offs and discovering multiple competitive solutions. On benchmark molecular Hamiltonians, our method outperforms sorted-insertion baselines by reducing measurement costs. We further analyze the role of composite rewards, incorporating both the number of circuits and measurement costs, leading to additional improvements. This generative policy framework not only reduces measurement costs but also offers flexibility for potential hardware-aware adaptations through its reward function.

Related papers

• A quantum feasibility preserving modeling for the min cut problem [1.3701366534590498]
  We study the minimum cut problem in weighted undirected graphs using variational quantum algorithms.<n>We employ a ring structured XY mixer that restricts the quantum evolution to the subspace of valid cut configurations.
  arXiv  Detail & Related papers  (2026-02-26T12:34:59Z)
• Tensor Network Assisted Distributed Variational Quantum Algorithm for Large Scale Combinatorial Optimization Problem [19.046113542182436]
  We propose the Distributed Variational Quantum Algorithm (DVQA) for solving Combinatorial Optimization Problems (COPs)<n>A key innovation of DVQA is its use of the truncated higher-order singular value decomposition to preserve inter-variable dependencies without relying on complex long-range entanglement.<n> Empirically, DVQA achieves state-of-the-art performance in simulations and has been experimentally validated on the Wu Kong quantum computer for portfolio optimization.
  arXiv  Detail & Related papers  (2026-01-20T13:31:02Z)
• Estimating Local Observables via Cluster-Level Light-Cone Decomposition [0.9713561148090973]
  We introduce a framework based on Cluster-level Light-cone analysis that leverages the natural locality of quantum workloads.<n>We propose two complementary algorithms: the Causal Decoupling Algorithm, which exploits geometric disconnections in the light cone for sampling efficiency, and the Algebraic Decomposition Algorithm, which utilizes algebraic expansion to minimize hardware requirements.
  arXiv  Detail & Related papers  (2025-12-02T03:35:44Z)
• MPQ-DMv2: Flexible Residual Mixed Precision Quantization for Low-Bit Diffusion Models with Temporal Distillation [74.34220141721231]
  We present MPQ-DMv2, an improved textbfMixed textbfPrecision textbfQuantization framework for extremely low-bit textbfDiffusion textbfModels.
  arXiv  Detail & Related papers  (2025-07-06T08:16:50Z)
• 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)
• Unitary Dilation Strategy Towards Efficient and Exact Simulation of Non-Unitary Quantum Evolutions [0.0]
  We introduce an efficient and exact single-ancilla decomposition technique for mapping non-unitary operations to quantum devices.<n>Our approach is based on Lagrange-Sylvester, akin to analytical differentiation techniques for functional approximation.<n>This can lead to several orders of magnitude reduction in the measurement cost, which is highly desirable for practical quantum computations of open systems.
  arXiv  Detail & Related papers  (2025-01-30T19:00:17Z)
• GFlowNets for Hamiltonian decomposition in groups of compatible operators [5.198557487975197]
  Current quantum algorithms are constrained by hardware limitations and the increased number of measurements required to achieve chemical accuracy. We propose a probabilistic framework using GFlowNets to group fully (FC) or qubit-wise commuting (QWC) terms within a given Hamiltonian.
  arXiv  Detail & Related papers  (2024-10-21T14:14:29Z)
• Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization [0.8121127831316319]
  We propose a method for constructing quantum circuits which greatly reduces inter-device communication costs. We show that we can construct tractable circuits nearly three times the size of previous QDCA methods while retaining a similar or greater level of quality.
  arXiv  Detail & Related papers  (2024-05-01T20:49:50Z)
• Avoiding barren plateaus via Gaussian Mixture Model [6.0599055267355695]
  Variational quantum algorithms are one of the most representative algorithms in quantum computing. They face challenges when dealing with large numbers of qubits, deep circuit layers, or global cost functions, making them often untrainable.
  arXiv  Detail & Related papers  (2024-02-21T03:25:26Z)
• Random Aggregate Beamforming for Over-the-Air Federated Learning in Large-Scale Networks [66.18765335695414]
  We consider a joint device selection and aggregate beamforming design with the objectives of minimizing the aggregate error and maximizing the number of selected devices. To tackle the problems in a cost-effective manner, we propose a random aggregate beamforming-based scheme. We additionally use analysis to study the obtained aggregate error and the number of the selected devices when the number of devices becomes large.
  arXiv  Detail & Related papers  (2024-02-20T23:59:45Z)
• Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization [72.41480594026815]
  Constrained optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric networks (TNs) and leverage their applicability as quantum-inspired generative models.
  arXiv  Detail & Related papers  (2022-11-16T18:59:54Z)
• Green, Quantized Federated Learning over Wireless Networks: An Energy-Efficient Design [68.86220939532373]
  The finite precision level is captured through the use of quantized neural networks (QNNs) that quantize weights and activations in fixed-precision format. The proposed FL framework can reduce energy consumption until convergence by up to 70% compared to a baseline FL algorithm.
  arXiv  Detail & Related papers  (2022-07-19T16:37:24Z)
• AMED: Automatic Mixed-Precision Quantization for Edge Devices [3.5223695602582614]
  Quantized neural networks are well known for reducing the latency, power consumption, and model size without significant harm to the performance. Mixed-precision quantization offers better utilization of customized hardware that supports arithmetic operations at different bitwidths.
  arXiv  Detail & Related papers  (2022-05-30T21:23:22Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)

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.