Pith. sign in

REVIEW 1 cited by

Cutting circuits with multiple two-qubit unitaries

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 2312.11638 v4 pith:BTVMSSEY submitted 2023-12-18 quant-ph

classification quant-ph
keywords cuttingoverheadsamplingtwo-qubitunitariesarbitrarycircuitsclassical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quasiprobabilistic cutting techniques allow us to partition large quantum circuits into smaller subcircuits by replacing non-local gates with probabilistic mixtures of local gates. The cost of this method is a sampling overhead that scales exponentially in the number of cuts. It is crucial to determine the minimal cost for gate cutting and to understand whether allowing for classical communication between subcircuits can improve the sampling overhead. In this work, we derive a closed formula for the optimal sampling overhead for cutting an arbitrary number of two-qubit unitaries and provide the corresponding decomposition. We find that cutting several arbitrary two-qubit unitaries together is cheaper than cutting them individually and classical communication does not give any advantage.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Optimized Circuit Cutting for QAOA Sampling Tasks

    quant-ph 2025-07 conditional novelty 4.0 of 10

    In a single 25-node MaxCut hardware experiment, wire-cut QAOA circuits produced better solution distributions than uncut circuits, evidence that circuit cutting can mitigate noise.

Pith tools