Pith. sign in

REVIEW 4 cited by

Distributed Quantum Circuit Cutting for Hybrid Quantum-Classical High-Performance Computing

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 2505.01184 v2 pith:KAIALG7V submitted 2025-05-02 cs.DC quant-ph

Distributed Quantum Circuit Cutting for Hybrid Quantum-Classical High-Performance Computing

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

Most quantum computers today are constrained by hardware limitations, particularly the number of available qubits, causing significant challenges for executing large-scale quantum algorithms. Circuit cutting has emerged as a key technique to overcome these limitations by decomposing large quantum circuits into smaller subcircuits that can be executed independently and later reconstructed. In this work, we introduce Qdislib, a distributed and flexible library for quantum circuit cutting, designed to seamlessly integrate with hybrid quantum-classical high-performance computing (HPC) systems. Qdislib employs a graph-based representation of quantum circuits to enable efficient partitioning, manipulation and execution, supporting both wire cutting and gate cutting techniques. The library is compatible with multiple quantum computing libraries, including Qiskit and Qibo, and leverages distributed computing frameworks to execute subcircuits across CPUs, GPUs, and quantum processing units (QPUs) in a fully parallelized manner. We present a proof of concept demonstrating how Qdislib enables the distributed execution of quantum circuits across heterogeneous computing resources, showcasing its potential for scalable quantum-classical workflows.

discussion (0)

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

Forward citations

Cited by 4 Pith papers

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

  1. Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits

    quant-ph 2026-06 unverdicted novelty 7.0

    BQCP extends quantum constant propagation to dynamic circuits by tracking classical and quantum information across measurement-induced branches, enabling sound simplifications and larger reductions than QCP on benchmarks.

  2. 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.

  3. Quantum circuit partition as a maze: emerging percolation transition via path finding

    quant-ph 2026-06 unverdicted novelty 6.0

    Quantum circuit partitioning is formalized as a maze path problem, revealing a percolation phase transition that separates partitionable from non-partitionable regimes when the CNOT-to-qubit ratio is near one.

  4. MPStab: an hybrid stabilizers tensor-network quantum circuit simulator

    quant-ph 2026-07 accept novelty 4.0

    MPStab implements hybrid stabilizer–MPO circuit simulation and shows it outperforms pure tensor networks on Clifford-heavy circuits with moderate magic at matched bond dimension.