Drone delivery packing problem on a neutral-atom quantum computer

• URL: http://arxiv.org/abs/2602.15487v1
• Date: Tue, 17 Feb 2026 10:52:10 GMT
• Title: Drone delivery packing problem on a neutral-atom quantum computer
• Abstract summary: We address the Drone Delivery Packing Problem via a hybrid quantum-classical framework leveraging a neutral-atom quantum processing unit (QPU)<n>We reformulate the optimization task as a graph-partitioning problem based on the independent sets (ISs) of a scheduling graph that encodes delivery incompatibilities.<n>While the ISs represent time-feasible schedules, battery-duration constraints are enforced through a classical post-processing routine.
• Score: 7.106206192312008
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum architectures based on neutral atoms have gained significant attention in recent years as specialized computational machines due to their ability to directly encode the independent set constraint on graphs, exploiting the Rydberg blockade mechanism. In this work, we address the Drone Delivery Packing Problem via a hybrid quantum-classical framework leveraging a neutral-atom quantum processing unit (QPU). We reformulate the optimization task as a graph-partitioning problem based on the independent sets (ISs) of a scheduling graph that encodes delivery incompatibilities. Each partition corresponds to deliveries assigned to a single drone, with the objective of minimizing the total number of partitions. While the ISs represent time-feasible schedules, battery-duration constraints are enforced through a classical post-processing routine. This methodology enables the recovery of optimal delivery schedules, provided a sufficient number of samples is collected from the QPU to resolve the solution space. We benchmark the hybrid workflow through numerical emulations and demonstrate its effectiveness on Pasqal's Fresnel QPU, reporting hardware experiments with configurations of up to 100 atoms.

Related papers

• A Backend-Agnostic MWIS Kernel for Stochastic Unit Commitment with Neutral-Atom Hardware Validation [10.684735732603961]
  We introduce a backend-agnostic computational interface that compiles the discrete decision layer of unit commitment into a move-based maximum-weight independent set problem.<n>We validate the approach in a green scheduling setting and deploy it on the QuEra Aquila neutral-atom quantum processor.<n>This is the first end-to-end industrial scheduling workflow that connects real operational decisions to programmable neutral-atom hardware.
  arXiv  Detail & Related papers  (2026-09-01T13:46:26Z)
• Emergency hub placement with a neutral-atom quantum computer [7.106206192312008]
  We study the problem of emergency operation center placement in disaster response.<n>A minimal number of hubs must be selected to ensure timely coverage of all affected locations.<n>We propose a hybrid quantum-classical approximation framework that leverages neutral-atom quantum computers as independent set samplers.
  arXiv  Detail & Related papers  (2026-06-17T20:45:17Z)
• Qurator: Scheduling Hybrid Quantum-Classical Workflows Across Heterogeneous Cloud Providers [0.0]
  We present Qurator, an architecture-agnostic quantum-classical task scheduler that jointly optimize queue time and circuit fidelity across heterogeneous providers.<n>We evaluate Qurator on a simulator driven by four months of real queue data using circuits from the Munich Quantum Toolkit benchmark suite.
  arXiv  Detail & Related papers  (2026-04-07T06:58:46Z)
• Iterative Optimization with Partial Convergence Guarantees on Neutral Atom Quantum Computers [0.0]
  Lp-Quts is a hybrid quantum-classical framework that integrates an NAQC sampler into a classical cutting-plane algorithm.<n>We show how Lp-Quts can be effectively embedded within classical optimization frameworks to deliver near-optimal solutions with reduced quantum resources.
  arXiv  Detail & Related papers  (2026-03-30T19:12:21Z)
• 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)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem [10.162280421416208]
  We propose and implement a quantum-informed reduction algorithm for the maximum independent set problem.<n>We show that qReduMIS can help address fundamental performance limitations faced by a broad set of solvers including Rydberg quantum devices.<n>We outline implementations of qReduMIS with alternative platforms, such as superconducting qubits or trapped ions.
  arXiv  Detail & Related papers  (2025-03-16T15:41:42Z)
• Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem [0.0]
  We propose a numerical approach to design highly efficient adiabatic schedules for analog quantum computing.<n>We show that the optimum schedules depend principally on the hardness of the problem rather than on its size.<n>This allows us to extrapolate the results to larger graphs and to successfully solve moderately hard problems using QuEra's 256-qubit Aquila computer.
  arXiv  Detail & Related papers  (2024-10-11T17:08:49Z)
• 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)
• Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling [33.04597339860113]
  We propose digitized counterdiabatic quantum optimization (DCQO)algorithms for two scheduling problems.<n>For the job-shop scheduling problem, we aim at finding the optimal schedule for a robot executing a number of tasks under specific constraints.<n>For the traveling salesperson problem, the goal is to find the path that covers all cities and is associated with the shortest traveling distance.
  arXiv  Detail & Related papers  (2024-05-24T16:53:30Z)
• Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
  We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers. The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
  arXiv  Detail & Related papers  (2024-03-25T14:06:18Z)
• Shuttling for Scalable Trapped-Ion Quantum Computers [2.8956730787977083]
  We propose an efficient shuttling schedule for Trapped-ion quantum computers. The proposed approach produces shuttling schedules with a close-to-minimal amount of time steps. An implementation of the proposed approach is publicly available as part of the open-source Munich Quantum Toolkit.
  arXiv  Detail & Related papers  (2024-02-21T19:00:04Z)
• Hybrid quantum-classical computation for automatic guided vehicles scheduling [0.0]
  We demonstrate the effectiveness of state-of-the-art hybrid (not necessarily quantum) solvers in addressing the business-centric problem of scheduling Automatic Guided Vehicles. We utilize D-Wave hybrid solvers that implement classicals with potential assistance from a quantum processing unit. We show that a scenario involving up to 21 AGVs, significant due to possible deadlocks, can be efficiently addressed by a hybrid solver in seconds.
  arXiv  Detail & Related papers  (2023-09-01T09:11:53Z)
• Distribution-Flexible Subset Quantization for Post-Quantizing Super-Resolution Networks [68.83451203841624]
  This paper introduces Distribution-Flexible Subset Quantization (DFSQ), a post-training quantization method for super-resolution networks. DFSQ conducts channel-wise normalization of the activations and applies distribution-flexible subset quantization (SQ) It achieves comparable performance to full-precision counterparts on 6- and 8-bit quantization, and incurs only a 0.1 dB PSNR drop on 4-bit quantization.
  arXiv  Detail & Related papers  (2023-05-10T04:19:11Z)
• Cloud on-demand emulation of quantum dynamics with tensor networks [48.7576911714538]
  We introduce a tensor network based emulator, simulating a programmable analog quantum processing unit (QPU) The software package is fully integrated in a cloud platform providing a common interface for executing jobs on a HPC cluster as well as dispatching them to a QPU device.
  arXiv  Detail & Related papers  (2023-02-10T14:08:05Z)
• Shuffle-QUDIO: accelerate distributed VQE with trainability enhancement and measurement reduction [77.97248520278123]
  We propose Shuffle-QUDIO to involve shuffle operations into local Hamiltonians during the quantum distributed optimization. Compared with QUDIO, Shuffle-QUDIO significantly reduces the communication frequency among quantum processors and simultaneously achieves better trainability.
  arXiv  Detail & Related papers  (2022-09-26T06:51:20Z)
• Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors [0.0]
  We propose a novel protocol for solving hard graph problems that combines variational quantum computing and machine learning. Our numerical simulations show that the proposed protocol can reduce dramatically the number of iterations to be run on the quantum device.
  arXiv  Detail & Related papers  (2022-07-26T16:40:14Z)
• 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)
• A Quantum Dot Plot Generation Algorithm for Pairwise Sequence Alignment [0.0]
  Quantum Pairwise Sequence Alignment (QPSA) algorithm offers exponential speedups in data alignment tasks. It relies on an open problem of efficiently encoding the classical data being aligned into quantum superposition. We provide an alternative, explicit construction of this oracle called the Quantum Dot Plot (QDP) We evaluate QDP's operational complexity via analysis of the quantum machine instructions generated by the Q# and Qiskit software frameworks.
  arXiv  Detail & Related papers  (2021-07-23T16:48:29Z)
• 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)

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.