Pith. sign in

Paper Citation Record · LEDGER

Fault-tolerant compiling of classically hard IQP circuits on hypercubes

As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2404.19005.

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

pith.paper-citation-record.v1
2404.19005 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 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 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T22:08:52.901548Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-23T05:37:36.921170Z

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 a3e60fe1-f8c2-4a96-aa05-cce68c7bf3e7 · inbound

IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX cites this paper.

IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX Fault-tolerant compiling of classically hard IQP circuits on hypercubes

Reference 19

Resolution
verified exact
arxiv_id, observed 2026-05-23T05:37:36.923944Z

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.

source=pdf_text observed=2026-05-23T05:35:50.375623Z digest=sha256:75bae33a3fc3bea9d0c1b132619cdfa86a02fa4b3b1abf8788698d6581d83550

Observation d572da09-69b5-4850-a773-5bd98f78b2c4 · inbound

Demonstration of measurement-free universal fault-tolerant quantum computation cites this paper.

Demonstration of measurement-free universal fault-tolerant quantum computation Fault-tolerant compiling of classically hard IQP circuits on hypercubes

Reference 80

Resolution
unresolved
no resolver link, observed 2026-08-06T22:08:52.901548Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T22:08:52.901548Z digest=sha256:e58f1a3fc5484ebfed1b1a247a627306e3ac8413e9550eeabfc777270b7796fc

Observation a949b6d9-a225-4c63-b570-3b316e1c3681 · inbound

Sampling hard circuits with verifiably high fidelity cites this paper.

Sampling hard circuits with verifiably high fidelity Fault-tolerant compiling of classically hard IQP circuits on hypercubes

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-01T01:08:30.495353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T01:08:30.495353Z digest=sha256:384617238dbc809c64c2b74e475013b9dad4251e88698df3e12543bbe34834ff