Sep 2026· Frontiers of Computer Science· 0 citations· 21 references
Quantum Computing Algorithms and Architecture
TL;DR
These quantitative findings demonstrate that tightly coupled hybrid co-processing, physically adjacent to the control electronics, is critical for extending the computational bound of Noisy Intermediate-Scale Quantum (NISQ) devices.
Abstract
Hybrid Variational Quantum Algorithms (VQAs) present a highly viable pathway to near-term quantum utility; however, their performance is fundamentally bottlenecked by classical-quantum communication latency in Quantumas-a-Service (QaaS) environments.
This paper proposes an optimized classical-quantum orchestration architecture designed to minimize cloud-induced latency and maximize Quantum Processing Unit (QPU) active compute time. By implementing edge-colocated classical optimizers alongside batched parameter-shift gradient evaluations, the system circumvents stateless cloud API barriers.
Benchmarking across parameterized quantum circuits ranging from 15 to 50 qubits demonstrates an 84% reduction in network-induced QPU idle time. The framework yields a 3.2 × speedup in overall convergence time for the Quantum Approximate Optimization Algorithm (QAOA) and up to a 98% reduction in classical API call overhead compared to standard RESTful QaaS execution models.
These quantitative findings demonstrate that tightly coupled hybrid co-processing, physically adjacent to the control electronics, is critical for extending the computational bound of Noisy Intermediate-Scale Quantum (NISQ) devices.
It is demonstrated that traditional communication metrics are insufficient predictors of execution quality due to the strong interaction among path fidelity, hardware characteristics, and circuit structure, and a topology-aware fidelity proxy (TAFP) evaluation approach that approximates distributed execution fidelity i...
Yeong Lim Tan, Sen Zhang, Haneen Alfauri et al.· Proceedings of the 3rd ACM S...· 0 citations
This work proposes QRLQ, a cost-delay-aware quantum cloud scheduling framework integrating PQCs with a dueling double deep Q-network to dynamically account for both cost and delay, and demonstrates its potential for cost-delay-aware quantum resource management.
An N. H. Phan, Dang van Huynh, Muhammad Usman et al.· 0 citations
Results show that FL enables high-performing, privacy-preserving quantum-classical collaboration without centralizing raw data, and achieves this with substantially fewer trainable parameters than the classical neural networks and random forest alternatives.
C. Cano, Daniel M. Jimenez-Gutierrez, Diego Sal et al.· 0 citations
A low-overhead fidelity-aware scheduling framework for multi-QPU systems based on a Graph Neural Network that estimates, before compilation, the expected fidelity of each circuit on each available QPU, and a tunable scheduler uses these estimates to control the trade-off between execution fidelity and parallelism.
Innocenzo Fulginiti, Antonio Tudisco, Salvatore Zammuto et al.· 0 citations
In recent years, quantum computing has shown promise in solving certain problems more efficiently than classical methods. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a leading candidate for achieving quantum advantage on noisy intermediate-scale quantum (NISQ) devices. This study explores the a...
Nghiem Viet Dung Nguyen, S. Le, Thang N. Dinh· Journal of Computer Science...· 0 citations
PaQit is introduced, a fidelity-aware qubit packing framework that integrates device-level Rydberg interaction physics with system-level scheduling to jointly optimize energy, runtime, and fidelity in neutral-atom systems.
J. Ludmir, Tirthak Patel· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.