Quafu-Qcover: Explore Combinatorial Optimization Problems on Cloud-based Quantum Computers

• URL: http://arxiv.org/abs/2305.17979v1
• Date: Mon, 29 May 2023 09:39:14 GMT
• Title: Quafu-Qcover: Explore Combinatorial Optimization Problems on Cloud-based Quantum Computers
• Abstract summary: We present Quafu-Qcover, an open-source cloud-based software package designed for optimization problems. Qcover provides a standardized and complete workflow for solving optimization problems using the Quantum Approximate Optimization Algorithm (QAOA) Qcover includes a specialized compiler that translates QAOA circuits into physical circuits capable of execution on Quafu cloud quantum computers.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present Quafu-Qcover, an open-source cloud-based software package designed for combinatorial optimization problems that support both quantum simulators and hardware backends. Quafu-Qcover provides a standardized and complete workflow for solving combinatorial optimization problems using the Quantum Approximate Optimization Algorithm (QAOA). It enables the automatic modeling of the original problem as a quadratic unconstrained binary optimization (QUBO) model and corresponding Ising model, which can be further transformed into a weight graph. The core of Qcover relies on a graph decomposition-based classical algorithm, which enables obtaining the optimal parameters for the shallow QAOA circuit more efficiently. Quafu-Qcover includes a specialized compiler that translates QAOA circuits into physical quantum circuits capable of execution on Quafu cloud quantum computers. Compared to a general-purpose compiler, ours generates shorter circuit depths while also possessing better speed performance. The Qcover compiler can establish a library of qubits coupling substructures in real time based on the updated calibration data of the superconducting quantum devices, ensuring that the task is executed on physical qubits with higher fidelity. The Quafu-Qcover allows us to retrieve quantum computer sampling result information at any time using task ID, enabling asynchronous processing. Besides, it includes modules for result preprocessing and visualization, allowing for an intuitive display of the solution to combinatorial optimization problems. We hope that Quafu-Qcover can serve as a guiding example for how to explore application problems on the Quafu cloud quantum computers

Related papers

• Solving Constrained Combinatorial Optimization Problems with Variational Quantum Imaginary Time Evolution [4.266376725904727]
  We show that VarQITE achieves significantly lower mean optimality gaps compared to other conventional methods. We demonstrate that scaling the Hamiltonian can further reduce optimization costs and accelerate convergence.
  arXiv  Detail & Related papers  (2025-04-17T03:09:37Z)
• QICS: Quantum Information Conic Solver [6.281229317487581]
  We introduce QICS, an open-source primal-dual interior point solver fully implemented in Python. QICS has the ability to solve optimization problems involving the quantum relative entropy. We showcase extensive numerical experiments which demonstrate that QICS outperforms state-of-the-art quantum relative entropy programming solvers.
  arXiv  Detail & Related papers  (2024-10-23T12:00:24Z)
• Variational Quantum Algorithms for Combinatorial Optimization [0.571097144710995]
  Variational Algorithms (VQA) have emerged as one of the strongest candidates towards reaching practical applicability of NISQ systems. This paper explores the current state and recent developments of VQAs, emphasizing their applicability to Approximate optimization. We implement QAOA circuits with varying depths to solve the MaxCut problem on graphs with 10 and 20 nodes.
  arXiv  Detail & Related papers  (2024-07-08T22:02:39Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing [93.83016310295804]
  AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for computer vision tasks. In this work, we explore the potential of using this information for probabilistic balanced k-means clustering. Instead of discarding non-optimal solutions, we propose to use them to compute calibrated posterior probabilities with little additional compute cost. This allows us to identify ambiguous solutions and data points, which we demonstrate on a D-Wave AQC on synthetic tasks and real visual data.
  arXiv  Detail & Related papers  (2023-10-18T17:59:45Z)
• Quantum-Informed Recursive Optimization Algorithms [0.0]
  We propose and implement a family of quantum-informed recursive optimization (QIRO) algorithms for optimization problems. Our approach leverages quantum resources to obtain information that is used in problem-specific classical reduction steps. We use backtracking techniques to further improve the performance of the algorithm without increasing the requirements on the quantum hardware.
  arXiv  Detail & Related papers  (2023-08-25T18:02:06Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• 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)
• Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation [3.8221353389253676]
  We introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large optimization problems onto distributed quantum architectures. This is achieved through the combined use of graph partitioning and quantum circuit cutting. We simulate the QDCA on instances of the Maximum Independent Set problem and find that it is able to outperform similar classical algorithms.
  arXiv  Detail & Related papers  (2021-07-15T18:00:32Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)

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.