Papers › Diagnosing crosstalk in large-scale QPUs using zero-entropy classical shadows

Diagnosing crosstalk in large-scale QPUs using zero-entropy classical shadows

30 Aug 2024arXiv:2408.17317links table onlyarchive 2025-07-28

J. A. Montañez-Barrera, G. P. Beretta, Kristel Michielsen, Michael R. von Spakovsky

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

As quantum processing units (QPUs) scale toward hundreds of qubits, diagnosing noise-induced correlations (crosstalk) becomes critical for reliable quantum computation. In this work, we introduce Zero-Entropy Classical Shadows (ZECS), a diagnostic tool that uses information of a rank-one quantum state tomography (QST) reconstruction from classical shadow (CS) information to make a crosstalk diagnosis. We use ZECS on trapped ion and superconductive QPUs, including ionq_forte (36 qubits), ibm_brisbane (127 qubits), and ibm_fez (156 qubits), using from 1,000 to 6,000 samples. With these samples, we use the ZECS to characterize crosstalk among disjoint qubit subsets across the full hardware. This information is then used to select low-crosstalk qubit subsets on ibm_fez for executing the Quantum Approximate Optimization Algorithm (QAOA) on a 20-qubit problem. Compared to the best qubit selection via Qiskit transpilation, our method improves solution quality by 10% and increases algorithmic coherence by 33%. ZECS offers a scalable and measurement-efficient approach to diagnosing crosstalk in large-scale QPUs.

PaperPDFCode

Code

alejomonbar/zecs officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections