Pith. sign in

REVIEW 4 cited by

QuSplit: Achieving Both High Fidelity and Throughput via Job Splitting on Noisy Quantum Computers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2501.12492 v2 pith:SEUKKMDX submitted 2025-01-21 quant-ph cs.ET

classification quant-phcs.ET
keywords quantumfidelityjobsprocessorsschedulingcomputingsignificantlysplitting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With the progression into the quantum utility era, computing is shifting toward quantum-centric architectures, where multiple quantum processors collaborate with classical computing resources. Platforms such as IBM Quantum and Amazon Braket exemplify this trend, enabling access to diverse quantum backends. However, efficient resource management remains a challenge, as quantum processors are highly susceptible to noise, which significantly impacts computation fidelity. Additionally, the heterogeneous noise characteristics across different processors add further complexity to scheduling and resource allocation. Existing scheduling strategies typically focus on mapping and scheduling jobs to these heterogeneous backends, which leads to some jobs suffering extremely low fidelity. Targeting quantum optimization jobs (e.g., VQC, VQE, QAOA) - among the most promising quantum applications in the NISQ era - we hypothesize that executing the later stages of a job on a high-fidelity quantum processor can significantly improve overall fidelity. To verify this, we use VQE as a case study and develop a Genetic Algorithm-based scheduling framework that incorporates job splitting to optimize fidelity and throughput. Experimental results demonstrate that our approach consistently maintains high fidelity across all jobs while significantly enhancing system throughput. Furthermore, the proposed algorithm exhibits excellent scalability in handling an increasing number of quantum processors and larger workloads, making it a robust and practical solution for emerging quantum computing platforms. To further substantiate its effectiveness, we conduct experiments on a real quantum processor, IBM Strasbourg, which confirm that job splitting improves fidelity and reduces the number of iterations required for convergence.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Access Control Threatened by Quantum Entanglement

    quant-ph 2025-07 reject novelty 7.0 of 10

    A classically secure access control system is shown to leak user secrets with certainty once quantum registers and local quantum memory are allowed, motivating new entanglement-aware access control models.

  2. Computational Performance Bounds Prediction in Quantum Computing with Unstable Noise

    quant-ph 2025-07 conditional novelty 5.0 of 10

    QuBound uses historical performance traces decomposed into trend and residual to train an LSTM that predicts tight, fast performance bounds for quantum circuits under time-varying noise.

  3. QCOEM: Quantum Cloud Orchestration with Evolutionary Multi-Objective Optimization

    cs.DC 2026-07 conditional novelty 4.0 of 10

    QCOEM applies NSGA-II/III with AASF to quantum task scheduling and reports roughly 30% higher modeled fidelity and zero rescheduling versus noise-agnostic heuristics in emulation.

  4. Localized Kernel Methods for Signal Processing

    eess.SP 2025-08 reject novelty 2.0 of 10

    The manuscript is internally inconsistent: the abstract describes localized kernel signal processing, while the body is a different paper on quantum task scheduling, leaving the abstract's claims entirely unsupported.

Pith tools