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
Distributed Quantum Circuit Cutting for Hybrid Quantum-Classical High-Performance Computing
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.
Forward citations
Cited by 4 Pith papers
-
Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits
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.
-
MOSAIQC: Mixed-topology-aware Optimization for Scalable Approximate noise-Informed Quantum circuit Cutting
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.
-
Quantum circuit partition as a maze: emerging percolation transition via path finding
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.
-
MPStab: an hybrid stabilizers tensor-network quantum circuit simulator
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.