Quantum-Amplified M/G/1/K Simulation: A Comparator-Controlled Framework for Arbitrary Service Distributions

• URL: http://arxiv.org/abs/2512.10558v1
• Date: Thu, 11 Dec 2025 11:42:17 GMT
• Title: Quantum-Amplified M/G/1/K Simulation: A Comparator-Controlled Framework for Arbitrary Service Distributions
• Abstract summary: This work presents the first coherent quantum circuit for simulating an M/G/1/K queue under arbitrary service-time laws.<n> Grover iterations center on estimating the expected number of customers in the system, yielding provable $O(sqrtN)$ variance reduction.<n> Empirical evaluations on IBM quantum simulators demonstrate fidelity above 0.99 with four qubits and above 0.76 with ten qubits, with Jensen-Shannon divergence below 0.11.
• Score: 2.8547732086436306
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Finite-capacity single-server queues with general service-time distributions form the backbone of numerous real-world systems, yet classical simulation of performance metrics such as blocking probabilities and delay becomes computationally prohibitive as service variability or required precision increases. This work presents the first coherent quantum circuit for simulating an M/G/1/K queue under arbitrary service-time laws. The circuit encodes the service distribution through a logarithmic-depth ladder of $R_y$ rotations and enforces buffer constraints via a comparator-controlled phase gate, while preserving the quadratic speed-up of amplitude amplification. Grover iterations center on estimating the expected number of customers in the system, yielding provable $O(\sqrt{N})$ variance reduction and closed-form confidence bounds, where $N$ denotes the number of shots. Empirical evaluations on IBM quantum simulators across four service distributions and three traffic intensities demonstrate fidelity above 0.99 with four qubits and above 0.76 with ten qubits, with Jensen-Shannon divergence below 0.11. Waiting-time estimation errors decrease by an order of magnitude as system load approaches capacity and remain within 3% in high-traffic regimes using registers of up to 63 qubits. These results establish the first end-to-end quantum simulation framework for finite-buffer, non-Markovian queueing systems and provide a concrete foundation for quantum-accelerated performance analysis in service-oriented architectures.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Basis-Adaptive Sparse-State Simulation of Quantum Circuits [0.0]
  We introduce an algorithm called Basis-Adaptive Sparse-State Simulation (BASS)<n>BASS updates each qubit's local representation basis during execution rather than locking the computational basis for the entire circuit.<n>On structured brickwork circuits, BASS achieves substantially higher fidelity than the fixed-basis approach.
  arXiv  Detail & Related papers  (2026-05-26T17:02:39Z)
• OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond [50.440302567029654]
  Multi-modal intelligence has made the Key-Value cache a dominant memory bottleneck for efficient deployment.<n>In this work, we revisit the inherent limitations of the per-channel quantization paradigm.<n>We propose OScaR, an accurate and lightweight KV cache compression framework for X-LLMs.
  arXiv  Detail & Related papers  (2026-05-19T10:53:03Z)
• 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)
• Q-GARS: Quantum-inspired Robust Microservice Chaining Scheduling [0.42970700836450487]
  We propose Q-GARS, a hybrid framework that integrates the QUBO model with Simulated Quantum Annealing (SQA) based search and online rescheduling mechanisms.<n> Simulation results show that Q-GARS achieves an average weighted completion time improvement of 2.1% relative to a greedy baseline of the remaining shortest processing-time.<n>In addition, Q-GARS achieves a mean node resource utilization rate of 0.817, which is 1.1 percentage points above the robust baseline.
  arXiv  Detail & Related papers  (2026-03-24T12:24:51Z)
• 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)
• Consensus Protocols for Entanglement-Aware Scheduling in Distributed Quantum Neural Networks [18.148407575244942]
  We introduce a Consensus-Entanglement-Aware Scheduling (CEAS) framework that co-designs quantum consensus protocols with adaptive entanglement management.<n>CEAS integrates fidelity-weighted aggregation, in which parameter updates are weighted by quantum Fisher information to suppress noisy contributions.<n>CEAS maintains 10-15 percentage points higher accuracy compared to entanglement-oblivious baselines under coordinated Byzantine attacks.
  arXiv  Detail & Related papers  (2026-02-06T16:36:52Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Lane-Frame Quantum Multimodal Driving Forecasts for the Trajectory of Autonomous Vehicles [6.137648436139678]
  Tray forecasting for autonomous driving must deliver accurate, multi-modal calibrated forecasts under tight compute and latency constraints.<n>We propose a compact hybrid quantum architecture that aligns quantum inductive bias with road-scene structure by operating in an ego-centric, lane-aligned frame.<n>In the Open Motion dataset, the model achieves minADE of SI1.94m and minFDE of SI3.56m, consistently outperforming a kinematic baseline with reduced miss rates and strong recall.
  arXiv  Detail & Related papers  (2025-11-21T07:00:07Z)
• Quantum Similarity-Driven QUBO Framework for Multi-Period Supply Chain Allocation using Time-Multiplexed Coherent Ising Machines and Simulated Quantum Annealing [0.0]
  Multi-period stock-keeping unit allocation in supply chains is a feasible optimization problem that is both NP-hard and operationally critical.<n>This work proposes a hybrid QUBO framework integrating three advances: (i) a quantum-derived similarity kernel, obtained from a variational RX embedding, to discourage redundant SKU selections; (ii) exact per-period capacity enforcement via slack-bit encoding to maintain feasibility; and (iii) execution on a time-multiplexed Coherent Ising Machine.
  arXiv  Detail & Related papers  (2025-10-24T15:04:27Z)
• Entanglement Distribution Delay Optimization in Quantum Networks with Distillation [51.53291671169632]
  Quantum networks (QNs) distribute entangled states to enable distributed quantum computing and sensing applications. QS resource allocation framework is proposed to enhance the end-to-end (e2e) fidelity and satisfy minimum rate and fidelity requirements.
  arXiv  Detail & Related papers  (2024-05-15T02:04:22Z)
• DASA: Delay-Adaptive Multi-Agent Stochastic Approximation [64.32538247395627]
  We consider a setting in which $N$ agents aim to speedup a common Approximation problem by acting in parallel and communicating with a central server. To mitigate the effect of delays and stragglers, we propose textttDASA, a Delay-Adaptive algorithm for multi-agent Approximation.
  arXiv  Detail & Related papers  (2024-03-25T22:49:56Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• A Race Track Trapped-Ion Quantum Processor [0.0]
  We describe and benchmark a new quantum charge-coupled device based on a linear trap with periodic boundary conditions. The system is initially operated with 32 qubits, but future upgrades will allow for more.
  arXiv  Detail & Related papers  (2023-05-05T20:07:37Z)
• n-Qubit Operations on Sphere and Queueing Scaling Limits for Programmable Quantum Computer [0.0]
  We study n-qubit operation rules on (n+1)-sphere with the target to help developing a (photon or other technique) based programmable quantum computer. We derive the scaling limits for n-qubit quantum computer based queueing systems under two different heavy traffic regimes.
  arXiv  Detail & Related papers  (2021-09-29T08:24:12Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

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.