Industry applications of neutral-atom quantum computing solving independent set problems

• URL: http://arxiv.org/abs/2205.08500v2
• Date: Tue, 16 Jan 2024 16:23:08 GMT
• Title: Industry applications of neutral-atom quantum computing solving independent set problems
• Authors: Jonathan Wurtz, Pedro L. S. Lopes, Christoph Gorgulla, Nathan Gemelke, Alexander Keesling, Shengtao Wang
• Abstract summary: We show how to encode independent set problems in Rydberg Hamiltonians. We outline the major classes of independent set problems and include associated example applications with industry and social relevance. We determine a wide range of sectors that could benefit from efficient solutions of independent set problems.
• Score: 39.58317527488534
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Architectures for quantum computing based on neutral atoms have risen to prominence as candidates for both near and long-term applications. These devices are particularly well suited to solve independent set problems, as the combinatorial constraints can be naturally encoded in the low-energy Hilbert space due to the Rydberg blockade mechanism. Here, we approach this connection with a focus on a particular device architecture and explore the ubiquity and utility of independent set problems by providing examples of real-world applications. After a pedagogical introduction of basic graph theory concepts of relevance, we briefly discuss how to encode independent set problems in Rydberg Hamiltonians. We then outline the major classes of independent set problems and include associated example applications with industry and social relevance. We determine a wide range of sectors that could benefit from efficient solutions of independent set problems -- from telecommunications and logistics to finance and strategic planning -- and display some general strategies for efficient problem encoding and implementation on neutral-atom platforms.

Related papers

• Quantum optimization with globally driven neutral atom arrays [0.0]
  We propose a scalable encoding of optimization problems with arbitrary connectivity. We show, that these auxiliary atoms can be simultaneously used for both problem-specific programming and the mitigation of unwanted effects.
  arXiv  Detail & Related papers  (2024-10-04T20:09:10Z)
• From Graphs to Qubits: A Critical Review of Quantum Graph Neural Networks [56.51893966016221]
  Quantum Graph Neural Networks (QGNNs) represent a novel fusion of quantum computing and Graph Neural Networks (GNNs) This paper critically reviews the state-of-the-art in QGNNs, exploring various architectures. We discuss their applications across diverse fields such as high-energy physics, molecular chemistry, finance and earth sciences, highlighting the potential for quantum advantage.
  arXiv  Detail & Related papers  (2024-08-12T22:53:14Z)
• Swap-based Deep Reinforcement Learning for Facility Location Problems in Networks [11.613708854129037]
  Facility location problems on graphs are ubiquitous in real world and hold significant importance. We propose a swap-based framework that addresses the p-median problem and the facility relocation problem on graphs. We also introduce a novel reinforcement learning model demonstrating a keen awareness of complex graph structures.
  arXiv  Detail & Related papers  (2023-12-25T09:00:25Z)
• Quantum optimization with arbitrary connectivity using Rydberg atom arrays [0.0]
  We extend the classes of problems that can be efficiently encoded in Rydberg arrays by constructing explicit mappings from the original problems. We analyze several examples, including: maximum weighted independent set on graphs with arbitrary connectivity, quadratic unconstrained binary optimization problems with arbitrary or restricted connectivity, and integer factorization.
  arXiv  Detail & Related papers  (2022-09-08T18:00:00Z)
• Ising machines as hardware solvers of combinatorial optimization problems [1.8732539895890135]
  Ising machines are hardware solvers which aim to find the absolute or approximate ground states of the Ising model. A scalable Ising machine that outperforms existing standard digital computers could have a huge impact for practical applications.
  arXiv  Detail & Related papers  (2022-04-01T08:24:06Z)
• Multi-Objective Constrained Optimization for Energy Applications via Tree Ensembles [55.23285485923913]
  Energy systems optimization problems are complex due to strongly non-linear system behavior and multiple competing objectives. In some cases, proposed optimal solutions need to obey explicit input constraints related to physical properties or safety-critical operating conditions. This paper proposes a novel data-driven strategy using tree ensembles for constrained multi-objective optimization of black-box problems.
  arXiv  Detail & Related papers  (2021-11-04T20:18:55Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
  We present a general framework for mining constraints from data. In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem. We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
  arXiv  Detail & Related papers  (2020-06-18T20:09:53Z)
• Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive [57.47546090379434]
  We study the public persuasion problem in the general setting with: (i) arbitrary state spaces; (ii) arbitrary action spaces; (iii) arbitrary sender's utility functions. We provide a quasi-polynomial time bi-criteria approximation algorithm for arbitrary public persuasion problems that, in specific settings, yields a QPTAS.
  arXiv  Detail & Related papers  (2020-02-12T18:59:18Z)

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.