Quantum-Assisted Bellman-Ford Algorithm: Conditional Quadratic Speedups for Single-Source Shortest Paths with Negative Weights

The Bellman-Ford algorithm computes single-source shortest paths in graphs with negative edge weights but requires \(O(V E)\) time in the worst case. We propose a Quantum-assisted Bellman-Ford (QBF) algorithm that maintains exactness and negative-cyc

Authors

Institutions

Publication Details

Published
2025-10-14
DOI
https://doi.org/10.36227/techrxiv.176045738.87532047/v1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum-Assisted Bellman-Ford Algorithm: Conditional Quadratic Speedups for Single-Source Shortest Paths with Negative Weights

Yalla Jnan Devi Satya Prasad, Sahil Ram Chatrati
Quantum Computing Algorithms and Architecture
article

Quantum-Assisted Bellman-Ford Algorithm: Conditional Quadratic Speedups for Single-Source Shortest Paths with Negative Weights

Yalla Jnan Devi Satya Prasad, Sahil Ram Chatrati
article en

Abstract

The Bellman-Ford algorithm computes single-source shortest paths in graphs with negative edge weights but requires \(O(V E)\) time in the worst case. We propose a Quantum-assisted Bellman-Ford (QBF) algorithm that maintains exactness and negative-cyc

Basavatarakam Indo American Cancer Hospital and Research Institute (IN), Office of the Chief Scientist (IL)
Openalex Percentile: Top 85%
Quantum Computing Algorithms and Architecture
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quantum-Assisted Bellman-Ford Algorithm: Conditional Quadratic Speedups for Single-Source Shortest Paths with Negative Weights — Yalla Jnan Devi Satya Prasad, Sahil Ram Chatrati · (2025) | TGRS Research Map | TGRS