Paper Citation Record · LEDGER

Complexity of detecting large coefficients in the Pauli basis

As of 15 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2606.19545.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2606.19545 v1

Coverage vector

measured 20 of 20 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-26T20:26:34.183446Z

measured 20 of 20 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

20 of 20 outbound references displayed

verified exact2
verified fuzzy0
unresolved18
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2402a08d-dc00-4f28-b8d0-448db16f180b · outbound

This paper cites Shadow tomography of quantum states.

Complexity of detecting large coefficients in the Pauli basis Shadow tomography of quantum states

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63b0491a-9661-43ca-a4e0-a55a66523a53 · outbound

This paper cites A simple deterministic reduction for the gap minimum distance of code problem.IEEE Transactions on Information Theory, 60(10):6636–6645, 2014.

Complexity of detecting large coefficients in the Pauli basis A simple deterministic reduction for the gap minimum distance of code problem.IEEE Transactions on Information Theory, 60(10):6636–6645, 2014

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aee40b4d-ed10-43a0-b52d-2add863d6621 · outbound

This paper cites Selective and efficient estimation of parameters for quantum process tomography.Physical review letters, 100(19):190403, 2008.

Complexity of detecting large coefficients in the Pauli basis Selective and efficient estimation of parameters for quantum process tomography.Physical review letters, 100(19):190403, 2008

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c1ae8390-9795-488c-9f16-8a52684206cc · outbound

This paper cites Selective and efficient quantum state tomography and its application to quantum process tomography.Physical Review A—Atomic, Molecular, and Optical Physics, 87(1):012122, 2013.

Complexity of detecting large coefficients in the Pauli basis Selective and efficient quantum state tomography and its application to quantum process tomography.Physical Review A—Atomic, Molecular, and Optical Physics, 87(1):012122, 2013

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 498a4284-295a-4b0a-9d7a-05678e321cac · outbound

This paper cites General theory of measurement with two copies of a quantum state.Physical review letters, 103(4):040404, 2009.

Complexity of detecting large coefficients in the Pauli basis General theory of measurement with two copies of a quantum state.Physical review letters, 103(4):040404, 2009

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c99daa3-7717-4436-8aec-de3bb4a0f7fe · outbound

This paper cites A deterministic reduction for the gap minimum distance problem.

Complexity of detecting large coefficients in the Pauli basis A deterministic reduction for the gap minimum distance problem

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ec12794-6863-4882-847f-89e29da3368d · outbound

This paper cites Measuring the largest coefficients of a quantum state.

Complexity of detecting large coefficients in the Pauli basis Measuring the largest coefficients of a quantum state

Reference 7

Resolution: verified exact; local_arxiv, observed 2026-07-04T01:19:21.307824Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 33d78b7c-dcab-44ff-a513-29c4990d5b5d · outbound

This paper cites Efficient quantum state tomography.Nature communications, 1(1):149, 2010.

Complexity of detecting large coefficients in the Pauli basis Efficient quantum state tomography.Nature communications, 1(1):149, 2010

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6d89dcd-4284-4565-9b66-f89ae856483e · outbound

This paper cites Hardness of approximating the minimum distance of a linear code.IEEE Transactions on Information Theory, 49(1):22–37, 2003.

Complexity of detecting large coefficients in the Pauli basis Hardness of approximating the minimum distance of a linear code.IEEE Transactions on Information Theory, 49(1):22–37, 2003

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 589da333-0388-4e17-acba-91cde79849b7 · outbound

This paper cites Efficient learning of quantum states prepared with few non-clifford gates.Quantum, 9:1907, 2025.

Complexity of detecting large coefficients in the Pauli basis Efficient learning of quantum states prepared with few non-clifford gates.Quantum, 9:1907, 2025

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f6dd799d-da85-40d3-82a5-e44da913dfeb · outbound

This paper cites Quantum state tomography via compressed sensing.Physical review letters, 105(15):150401, 2010.

Complexity of detecting large coefficients in the Pauli basis Quantum state tomography via compressed sensing.Physical review letters, 105(15):150401, 2010

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d283d9a-6ea6-4424-a56f-193884aad220 · outbound

This paper cites Bell sampling from quantum circuits.Physical Review Letters, 133(2):020601, 2024.

Complexity of detecting large coefficients in the Pauli basis Bell sampling from quantum circuits.Physical Review Letters, 133(2):020601, 2024

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e5ee4a07-b289-43a0-a60c-71d3a12c9692 · outbound

This paper cites Aspects of generic entanglement.

Complexity of detecting large coefficients in the Pauli basis Aspects of generic entanglement

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b868491d-bbda-45bf-a52c-6946b740f01d · outbound

This paper cites Efficient distributed inner-product estimation via pauli sampling.PRX Quantum, 6(3):030354, 2025.

Complexity of detecting large coefficients in the Pauli basis Efficient distributed inner-product estimation via pauli sampling.PRX Quantum, 6(3):030354, 2025

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4f646a2-9599-405a-80dc-ae94e6f66c28 · outbound

This paper cites Predicting many properties of a quantum system from very few measurements.Nature Physics, 16(10):1050–1057, 2020.

Complexity of detecting large coefficients in the Pauli basis Predicting many properties of a quantum system from very few measurements.Nature Physics, 16(10):1050–1057, 2020

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5c5dcdf-eb7a-473c-a454-1a0df26ea0c0 · outbound

This paper cites Efficient estimation of pauli observables by derandomization.Physical review letters, 127(3):030503, 2021.

Complexity of detecting large coefficients in the Pauli basis Efficient estimation of pauli observables by derandomization.Physical review letters, 127(3):030503, 2021

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 62180a10-a6ac-4949-acaf-167ef4a0927e · outbound

This paper cites Number 89.

Complexity of detecting large coefficients in the Pauli basis Number 89

Reference 17

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13dc2b85-a6a0-4ba3-a962-a0e948560211 · outbound

This paper cites Learning t-doped stabilizer states.

Complexity of detecting large coefficients in the Pauli basis Learning t-doped stabilizer states

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce52a76b-d51e-404e-ac7b-dd04e063123e · outbound

This paper cites Learning stabilizer states by Bell sampling.

Complexity of detecting large coefficients in the Pauli basis Learning stabilizer states by Bell sampling

Reference 19

Resolution: verified exact; local_arxiv, observed 2026-07-04T01:19:21.311899Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 45151f3d-a490-41bb-afc2-5757a3bba3b3 · outbound

This paper cites The intractability of computing the minimum distance of a code.IEEE Transactions on Information Theory, 43(6):1757–1766, 1997.

Complexity of detecting large coefficients in the Pauli basis The intractability of computing the minimum distance of a code.IEEE Transactions on Information Theory, 43(6):1757–1766, 1997

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-26T20:26:34.183446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.