Pith. sign in

REVIEW 3 cited by

ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors

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 2207.00933 v1 pith:U2AUOQQJ submitted 2022-07-03 cs.ET quant-ph

ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors

classification cs.ET quant-ph
keywords quantumclassicalcircuitsadvantagesbottleneckscircuitcuttingframework
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Quantum processing unit (QPU) has to satisfy highly demanding quantity and quality requirements on its qubits to produce accurate results for problems at useful scales. Furthermore, classical simulations of quantum circuits generally do not scale. Instead, quantum circuit cutting techniques cut and distribute a large quantum circuit into multiple smaller subcircuits feasible for less powerful QPUs. However, the classical post-processing incurred from the cutting introduces runtime and memory bottlenecks. Our tool, called ScaleQC, addresses the bottlenecks by developing novel algorithmic techniques including (1) a quantum states merging framework that quickly locates the solution states of large quantum circuits; (2) an automatic solver that cuts complex quantum circuits to fit on less powerful QPUs; and (3) a tensor network based post-processing that minimizes the classical overhead. Our experiments demonstrate both QPU requirement advantages over the purely quantum platforms, and runtime advantages over the purely classical platforms for benchmarks up to 1000 qubits.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. MOSAIQC: Mixed-topology-aware Optimization for Scalable Approximate noise-Informed Quantum circuit Cutting

    quant-ph 2026-07 conditional novelty 6.0

    A heuristic circuit-cutting framework combining METIS, tabu search, and quadratic assignment reports faster runtimes and fewer cuts than Qiskit's add-on on tested benchmarks.

  2. Scalable quantum circuit knitting using a weak-coupling approximation

    quant-ph 2026-06 unverdicted novelty 6.0

    A weak-coupling approximation reduces classical overhead in quantum circuit knitting to polynomial cost when one qubit couples weakly to others, shown on QAOA-style layered circuits.

  3. How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

    quant-ph 2024-11 accept novelty 4.0

    A comprehensive review of scaling paths for superconducting quantum computers, with resource and sensitivity analyses for utility-scale applications under realistic error distributions.