Distributed Variational Quantum Eigensolver: Embarrassingly Parallel strategies on NISQ

• URL: http://arxiv.org/abs/2608.19824v1
• Date: Thu, 20 Aug 2026 09:25:25 GMT
• Title: Distributed Variational Quantum Eigensolver: Embarrassingly Parallel strategies on NISQ
• Abstract summary: Variational Quantum Eigensolver requires many circuit executions, making it ideal for distributed parallelization.<n>We evaluate three embarrassingly parallelization strategies using the CUNQA platform for emulation of virtual QPUs.
• Score: 1.503853743839055
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational Quantum Eigensolver requires many circuit executions, making it ideal for distributed parallelization. However, heterogeneous noise in NISQ devices can skew results and efficiency. Using the CUNQA platform for emulation of virtual QPUs, we evaluate three embarrassingly parallelization strategies (shot-level, circuit-level for gradients and observables and candidate level for population-based optimizers) across metrics like speedup and accuracy.

Related papers

• 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)
• Scaling Hybrid Quantum-HPC Applications with the Quantum Framework [2.9218462389567823]
  Hybrid quantum-high performance computing is emerging as a key strategy for running quantum applications at scale.<n>We extend the Quantum Framework (QFw), a modular and HPC-aware orchestration layer, to integrate multiple local backends and a cloud-based quantum backend.<n>Using this integration, we execute a number of non-variational as well as variational workloads.
  arXiv  Detail & Related papers  (2025-09-17T22:58:43Z)
• Cyclic Variational Quantum Eigensolver: Escaping Barren Plateaus through Staircase Descent [4.517663944296433]
  We introduce the Cyclic Variational Quantum Eigensolver (CVQE), a hardware-efficient framework for accurate ground-state quantum simulation.<n>CVQE departs from conventional VQE by incorporating a measurement-driven feedback cycle.<n>We show that CVQE consistently maintains chemical precision across correlation regimes, outperforms fixed UCCSD by several orders of magnitude, and achieves favorable accuracy-cost trade-offs.
  arXiv  Detail & Related papers  (2025-09-16T13:54:03Z)
• 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)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Performance Evaluation of Variational Quantum Eigensolver and Quantum Dynamics Algorithms on the Advection-Diffusion Equation [0.0]
  This study benchmarks a ground-state algorithm, Variational Quantum Eigensolver (VQE), against three leading quantum dynamics algorithms.<n>VQE can reach final-time infidelities as low as $O(10-9)$ with $N=4$ qubits and moderate circuit depths.
  arXiv  Detail & Related papers  (2025-03-31T13:09:59Z)
• 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)
• 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)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers [5.644434841659249]
  We propose an iterative Layer VQE (L-VQE) approach, inspired by the Variational Quantum Eigensolver (VQE) We show that L-VQE is more robust to finite sampling errors and has a higher chance of finding the solution as compared with standard VQE approaches. Our simulation results show that L-VQE performs well under realistic hardware noise.
  arXiv  Detail & Related papers  (2021-02-10T16:53:22Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.