Paper Citation Record · LEDGER

A polynomial-time classical algorithm for noisy quantum circuits

As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 19 inbound Pith citation observations for arXiv:2407.12768.

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

pith.paper-citation-record.v1
2407.12768 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 19 of 19 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 19 of 19 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T18:02:34.145882Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-22T15:41:45.294064Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation ec10054b-8ed0-41a4-9c07-e4d422a9a4f7 · inbound

Pauli quantum computing: $I$ as $|0\rangle$ and $X$ as $|1\rangle$ cites this paper.

Pauli quantum computing: $I$ as $|0\rangle$ and $X$ as $|1\rangle$ A polynomial-time classical algorithm for noisy quantum circuits

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-11T23:23:06.497616Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 049f42a5-801c-432e-814f-21f92332066e · inbound

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation cites this paper.

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation A polynomial-time classical algorithm for noisy quantum circuits

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-10T16:41:32.723765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2818c3f2-5d7c-421d-9161-0231a3ec94ba · inbound

Improved Quantum Computation using Operator Backpropagation cites this paper.

Improved Quantum Computation using Operator Backpropagation A polynomial-time classical algorithm for noisy quantum circuits

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-09T14:08:37.916987Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a4b063e-889c-41a1-9597-0964009baf82 · inbound

Interplay of resources for universal continuous-variable quantum computing cites this paper.

Interplay of resources for universal continuous-variable quantum computing A polynomial-time classical algorithm for noisy quantum circuits

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-08T12:08:05.741824Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96778559-f0e0-4bc9-a09b-db1bf80ca44e · inbound

Bra-ket entanglement, an indicator bridging entanglement, magic, and coherence cites this paper.

Bra-ket entanglement, an indicator bridging entanglement, magic, and coherence A polynomial-time classical algorithm for noisy quantum circuits

Reference 26

Resolution: verified exact; arxiv_id, observed 2026-05-22T15:41:45.297051Z

Source-reported events for the cited work

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

Observation 07b1d8b9-5fe8-46d6-b4e7-a1e61c7691ba · inbound

Pauli Propagation: A Computational Framework for Simulating Quantum Systems cites this paper.

Pauli Propagation: A Computational Framework for Simulating Quantum Systems A polynomial-time classical algorithm for noisy quantum circuits

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-07T13:35:50.117444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c63939fa-a8aa-42d5-bccc-3a93f8847e2f · inbound

Integrals of motion as slow modes in dissipative many-body operator dynamics cites this paper.

Integrals of motion as slow modes in dissipative many-body operator dynamics A polynomial-time classical algorithm for noisy quantum circuits

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-07T11:18:07.223978Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ae8ada1-b64b-473d-91ef-879115ddb919 · inbound

A Framework for Quantum Advantage cites this paper.

A Framework for Quantum Advantage A polynomial-time classical algorithm for noisy quantum circuits

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-06T22:48:48.375084Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18694822-1135-440d-9636-0f72c5ff3500 · inbound

Barren-plateau free variational quantum simulation of Z2 lattice gauge theories cites this paper.

Barren-plateau free variational quantum simulation of Z2 lattice gauge theories A polynomial-time classical algorithm for noisy quantum circuits

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-15T18:02:34.145882Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a67731f9-b40d-4c56-b77a-1917484a26d2 · inbound

Sampling (noisy) quantum circuits through randomized rounding cites this paper.

Sampling (noisy) quantum circuits through randomized rounding A polynomial-time classical algorithm for noisy quantum circuits

Reference 58

Resolution: verified exact; arxiv_id, observed 2026-05-19T02:41:59.871430Z

Source-reported events for the cited work

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

Observation b205ca7c-7269-41fb-8bc2-11e6a05e150f · inbound

Pitfalls when tackling the exponential concentration of parameterized quantum models cites this paper.

Pitfalls when tackling the exponential concentration of parameterized quantum models A polynomial-time classical algorithm for noisy quantum circuits

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-06T12:11:56.805641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dbacc578-6f09-454e-9990-bf43fd1cf32f · inbound

Spectral properties and coding transitions of Haar-random quantum codes cites this paper.

Spectral properties and coding transitions of Haar-random quantum codes A polynomial-time classical algorithm for noisy quantum circuits

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-04T11:01:09.281284Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 918352b4-4b70-4d3c-815d-c76bd9481a19 · inbound

Mind the gaps: The fraught road to quantum advantage cites this paper.

Mind the gaps: The fraught road to quantum advantage A polynomial-time classical algorithm for noisy quantum circuits

Reference 48

Resolution: verified exact; arxiv_id, observed 2026-05-18T01:51:39.671410Z

Source-reported events for the cited work

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

Observation 38c7e31d-bca9-4493-82a9-de8f62314101 · inbound

Mind the gaps: The fraught road to quantum advantage cites this paper.

Mind the gaps: The fraught road to quantum advantage A polynomial-time classical algorithm for noisy quantum circuits

Reference 48

Resolution: verified exact; arxiv_id, observed 2026-05-22T13:11:34.832640Z

Source-reported events for the cited work

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

Observation 8472e74d-153c-4ef1-acb7-af2a5e6f9f44 · inbound

Characterizing Pauli Propagation via Operator Complexity cites this paper.

Characterizing Pauli Propagation via Operator Complexity A polynomial-time classical algorithm for noisy quantum circuits

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-04T08:14:57.241317Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f6dcb41f-283e-4a45-af1d-90b8b461d2b1 · inbound

Syndrome aware mitigation of logical errors cites this paper.

Syndrome aware mitigation of logical errors A polynomial-time classical algorithm for noisy quantum circuits

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-03T13:37:56.872581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 85f2ad64-70ac-4b8a-b01a-735fc26b11ff · inbound

Quantum-to-Classical Computability Transition via Negative Markov Chains cites this paper.

Quantum-to-Classical Computability Transition via Negative Markov Chains A polynomial-time classical algorithm for noisy quantum circuits

Reference 31

Resolution: verified exact; arxiv_id, observed 2026-05-11T13:01:04.594670Z

Source-reported events for the cited work

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

Observation 8e5465d2-9088-4f53-b714-4582d5d40a07 · inbound

Long-lived local quantum coherences from hydrodynamic large deviations cites this paper.

Long-lived local quantum coherences from hydrodynamic large deviations A polynomial-time classical algorithm for noisy quantum circuits

Reference 43

Resolution: verified exact; arxiv_id, observed 2026-05-12T09:46:26.808876Z

Source-reported events for the cited work

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

Observation 575f0ede-b030-463b-ae4a-ccffb24390e5 · inbound

Gram-Certified Resource Continuation for Structured Quantum Representation Audits cites this paper.

Gram-Certified Resource Continuation for Structured Quantum Representation Audits A polynomial-time classical algorithm for noisy quantum circuits

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-14T12:20:29.380042Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.