Pith. sign in

REVIEW 1 cited by

Optimal joint cutting of two-qubit rotation gates

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.09679 v2 pith:SUC3WXKC submitted 2023-12-15 quant-ph physics.comp-ph

classification quant-phphysics.comp-ph
keywords gatescuttingrotationtwo-qubitcircuitjointoptimalscheme
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments. Here, we introduce a scheme for joint cutting of two-qubit rotation gates based on a virtual gate-teleportation protocol. By that, we significantly lower the previous upper bounds on the sampling overhead and prove optimality of the scheme. Furthermore, we show that no classical communication between the circuit partitions is required. For parallel two-qubit rotation gates we derive an optimal ancilla-free decomposition, which include CNOT gates as a special case.

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. How Much Reconstruction Does Quantum Machine Learning Need? Late Fusion of Independently Trained Quantum Subcircuits

    quant-ph 2026-08 conditional novelty 6.0 of 10

    Late fusion of independently trained quantum subcircuits matches exact circuit-cutting reconstruction accuracy on tested tasks while avoiding exponential sampling overhead, with a diagnostic indicating when reconstruc...

Pith tools