Pith. sign in

REVIEW 1 cited by

Quantum Circuit Cutting for Classical Shadows

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 2212.00761 v3 pith:FGSWEMYU submitted 2022-12-01 quant-ph

classification quant-ph
keywords circuitclassicalquantumcuttingfragmentsobservablesshadowscircuits
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be executed more robustly using fewer quantum resources. We introduce a divide-and-conquer circuit cutting method for estimating the expectation values of observables using classical shadows. We derive a general formula for making predictions using the classical shadows of circuit fragments from arbitrarily cut circuits, and provide the sample complexity analysis for the case when observables factorize across fragments. Then, we numerically show that our divide-and-conquer method outperforms traditional uncut shadow tomography when estimating high-weight observables that act non-trivially on many qubits, and discuss the mechanisms for this 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. Understanding the Scalability of Circuit Cutting Techniques for Practical Quantum Applications

    quant-ph 2024-11 conditional novelty 5.0 of 10

    Resource estimates show circuit cutting cuts physical qubits by about 30% but causes exponential quantum runtime and classical overhead, making it impractical for fault-tolerant workloads.

Pith tools