{"as_of":"2026-08-17T08:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7be6c8dee3ed0eb4ca78b1d6b3b10ca1069cd6349802a0913b055a06f91a52ba","coverage":[{"denominator":85,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":85,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T09:31:34.189845Z","state":"measured"},{"denominator":85,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":85,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.20804/citation-record","integrity":"/paper/2607.20804/integrity","json":"/paper/2607.20804/citation-record.json","paper":"/paper/2607.20804"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.268207Z","title":"Subsequently, Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.268207Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:8399473f000b7b3b51f8a2420ddb1460c04d41c586f90093453b03ffd74388f7","observation_id":"ec7a1c23-597b-4c9a-bec6-9f01d985a160","resolution":{"observed_at":"2026-08-01T09:31:33.268207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.400624Z","title":"Noise and the frontier of quantum supremacy","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.400624Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:a432ffbad48729be89d9e6c9942ec045ff8eb9391229f09a5481c3e3b06c61fc","observation_id":"0c84b758-8f2d-41d8-95cb-8ec723d8a436","resolution":{"observed_at":"2026-08-01T09:31:33.400624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.257482Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.257482Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:164d324ce2426f792c02314536e2233c48968327b0eae86753707c44c40d10ef","observation_id":"b4cd1b81-8911-4a03-974f-08be61762f42","resolution":{"observed_at":"2026-08-01T09:31:33.257482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.242733Z","title":"VII, we conclude with remarks and directions for future work","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.242733Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:972744a91d7ff196a67b6c3c27caa91bf07c96b3f806ce33be8f4e68aee67df8","observation_id":"e2ac32e4-cfc7-4cae-8124-69bca9a8b246","resolution":{"observed_at":"2026-08-01T09:31:33.242733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.05642","last_updated":"2022-06-12T02:35:51Z","snapshot_observed_at":"2026-08-17T08:07:54.995549Z","submitted_at":"2022-06-12T02:35:51Z","title":"Average-case hardness of estimating probabilities of random quantum circuits with a linear scaling in the error exponent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.05642","snapshot_observed_at":"2026-08-01T09:31:33.429373Z","title":"Average-case hardness of estimating probabilities of random quantum circuits with a linear scaling in the error exponent","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.429373Z"},"links":{"cited_paper":"/paper/2206.05642","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:23a83b5780b81074eeb0b3ad0fb16e6316b9bd97089b742bc9b32da1d3154fb0","observation_id":"88f7aba8-06e1-4077-9e09-213ad03a5d4d","resolution":{"observed_at":"2026-08-01T09:31:33.429373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.250101Z","title":"( 10), respectively","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.250101Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:f9eb47a869e1455ee11586e4bd82dc238a5e26c7130f334ddc02ec6a082701ea","observation_id":"54a21c5d-429c-4570-b978-b85217307722","resolution":{"observed_at":"2026-08-01T09:31:33.250101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.306424Z","title":"simulation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.306424Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:e28494b3ee9fe903b8031cda0f27fd5cd1b12c23eb2fd1faa9090518153aacf3","observation_id":"415e57dc-4ee2-4319-99ba-e2e62976ccb3","resolution":{"observed_at":"2026-08-01T09:31:33.306424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.471813Z","title":"Quantum computational advantage via 60-qubit 24-cycle random circuit sampling","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.471813Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:e9e90b4f5b0d5f60c41628b9b778be446dfb664e6be823ac4d71b3d5dc27bb81","observation_id":"4d9d0261-851e-4063-ac21-63dfbfe9e685","resolution":{"observed_at":"2026-08-01T09:31:33.471813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.484754Z","title":"Phase transitions in random circuit sampling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.484754Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:4d6babb855314e92c5a627c820224d5c73176db30539a55e0855a72d86c518c2","observation_id":"a124300e-3bd7-41c6-aa4f-eb313dd1d61d","resolution":{"observed_at":"2026-08-01T09:31:33.484754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.492469Z","title":"Computational power of random quantum circuits in arbitrary geometries","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.492469Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:2e0315ef8260724ee360669050a687322d29d385540b5ccef1f9e53fb1730c61","observation_id":"e5119f6d-068e-474c-94e4-75af543b5f19","resolution":{"observed_at":"2026-08-01T09:31:33.492469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.393455Z","title":"On the complexity and verification of quantum random circuit sampling","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.393455Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:d1afc7578525e62f5806300e344aca810d500e249b8287ec1ed7ef9f0ab0f97c","observation_id":"c6578233-59ae-48ad-ba89-9814f88bdb9c","resolution":{"observed_at":"2026-08-01T09:31:33.393455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9611028","last_updated":"1996-11-17T16:40:20Z","snapshot_observed_at":"2026-07-07T07:26:30.090183Z","submitted_at":"1996-11-17T16:40:20Z","title":"Limitations of Noisy Reversible Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9611028","snapshot_observed_at":"2026-08-01T09:31:33.511170Z","title":"Limitations of noisy reversible computation","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.511170Z"},"links":{"cited_paper":"/paper/quant-ph/9611028","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:75c822c8695aaebfad56343feeef6b55c642e8f5b127c640ff706c1ae05d9f97","observation_id":"0060902d-b2df-41e3-897b-91fa173d7c84","resolution":{"observed_at":"2026-08-01T09:31:33.511170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.286979Z","title":"Thus, under Conjecture 1, this yields the #P-hardness claimed in Theorem 2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.286979Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:0d589a1affef64463ea307537d2c14c6f6bff3344c268b8caa6944a455310088","observation_id":"69b33aba-5145-4cbf-95fc-fba5547b5b6c","resolution":{"observed_at":"2026-08-01T09:31:33.286979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.406821Z","title":"Quantum supremacy and hardness of estimating output probabilities of quantum circuits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.406821Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:bb6b65a29f50cdf42b5f69ae12f1122f0ebab6f2d32c318b6cc56192598fd057","observation_id":"6a0febc2-b692-4a45-b992-a2fbe89c5fce","resolution":{"observed_at":"2026-08-01T09:31:33.406821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.365440Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.365440Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:c3e58d256b41f68b42feb11a1d9df0a2ef2f9f7c7b706085dbd1daaaf5014747","observation_id":"8ec9d64d-288f-4990-85cd-dce4f87b2ee5","resolution":{"observed_at":"2026-08-01T09:31:33.365440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.296262Z","title":"(15) for each fixed γ ∈ [0, γmax] by Pr C∼HA [ |˜p(C, γ) −˜pl(C, γ)| > ε′ 2n ] ≤ δ, (18) where the approximation error ε′ can be chosen as ε′ := 4N 2γmax lδ ( 3e N γmax 8l ) l","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.296262Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:3d8105a9b0cb5edeee00bef8422b263868eda0593d0952970ed5df8a32bdd3ca","observation_id":"5ecba682-2adf-4b6b-a07c-eff3121201b5","resolution":{"observed_at":"2026-08-01T09:31:33.296262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.415519Z","title":"The hardness of random quantum circuits","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.415519Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:ebf17257accf82246bc3b051dc3ec6b4bc3ace57efb669590de63dc4bbae576e","observation_id":"36a7fe36-7d32-4d16-8032-d6993081191c","resolution":{"observed_at":"2026-08-01T09:31:33.415519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.435280Z","title":"Quantum supremacy using a programmable superconducting processor","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.435280Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:468ce4552bb00b60a44046f7815b18af3ef06f5bbb46315e02e7bc3689d65168","observation_id":"4a424641-70a5-4a68-bfb5-870b56539a6a","resolution":{"observed_at":"2026-08-01T09:31:33.435280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.442509Z","title":"Strong quantum computational advantage using a superconducting quantum processor","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.442509Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:1cb0bd73b4d5a82fed8060ee9240b91577041a01242cd20cc76a51f42645274a","observation_id":"e8208697-75d7-4926-97b5-3728b065e783","resolution":{"observed_at":"2026-08-01T09:31:33.442509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.631716Z","title":"Classically sampling noisy quantum circuits in quasi-polynomial time under approximate markovianity","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.631716Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:57a00fa7a3919ff02c0f761fa6e931f60533641243beaea52886d13da2a1d654","observation_id":"665e5a57-8504-4fec-ba61-a652f1c945f2","resolution":{"observed_at":"2026-08-01T09:31:33.631716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.499385Z","title":"Establishing a new benchmark in quantum computational advantage with 105-qubit zuchongzhi 3.0 processor","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.499385Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:9075526c5d9358bde4d0720521bf32ac3eb849625fc681ab3397f7a9a34308c5","observation_id":"45a5e757-963a-48cc-a456-79851077e06a","resolution":{"observed_at":"2026-08-01T09:31:33.499385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.650244Z","title":"Noisy random quantum circuit sampling and its classical simulation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.650244Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:32b6211f7580d7591ac5b3745d14199f1ab6a6fc744430df7d496c1da22f5dfe","observation_id":"ed55b950-6dbf-4bfd-a7e2-6816d2e3ea47","resolution":{"observed_at":"2026-08-01T09:31:33.650244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.03176","last_updated":"2018-10-07T16:44:18Z","snapshot_observed_at":"2026-08-17T04:36:14.955954Z","submitted_at":"2018-10-07T16:44:18Z","title":"Efficient classical simulation of noisy quantum computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.03176","snapshot_observed_at":"2026-08-01T09:31:33.524746Z","title":"Efficient classical simulation of noisy quantum computation.arXiv preprint arXiv:1810.03176, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.524746Z"},"links":{"cited_paper":"/paper/1810.03176","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:d21a8000c806cb84066b23d3971cdb759ed3c154c7880c27cede9de85f45d393","observation_id":"d6b6e23f-157c-4017-aba6-6714634082d4","resolution":{"observed_at":"2026-08-01T09:31:33.524746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.560652Z","title":"Tight bounds on the convergence of noisy random circuits to the uniform distribution","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.560652Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:8ff11cd44e9c1eb372051375937202c8db217d492e17635f6ae31e2f7ed18564","observation_id":"7876adb9-66fa-4486-ba9b-3a70cd576201","resolution":{"observed_at":"2026-08-01T09:31:33.560652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.576051Z","title":"A polynomial-time classical algorithm for noisy random circuit sampling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.576051Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:71d7e17a6aa68f6f788bb413f2d396629851586e7750dd3a70a56518c5713921","observation_id":"74b101e5-79f1-4a0c-831d-5ba55efb60c6","resolution":{"observed_at":"2026-08-01T09:31:33.576051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.581524Z","title":"Random quantum circuits transform local noise into global white noise","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.581524Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:72fa192c7bfe5e20c60f533d5e52afdf1d37a87f8a1f3553abc61196872a9c88","observation_id":"08bf449d-79f5-4803-986c-beded148c10f","resolution":{"observed_at":"2026-08-01T09:31:33.581524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.590230Z","title":"Limitations of noisy geometrically local quantum circuits","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.590230Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:84d67f3c771842c1e8e41300726af92ab07c2f2c2b00e039789706754565c957","observation_id":"571560a7-923a-4b8f-bcfb-1a235f78a37c","resolution":{"observed_at":"2026-08-01T09:31:33.590230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.596277Z","title":"Polynomial-time classical simulation of noisy quantum circuits with naturally fault-tolerant gates","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.596277Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:539182fac6c1d51970293beee4d0ca867d11331ef9b63f5b087ac528af48da5c","observation_id":"b1920603-de47-436f-8dab-d8b4bc92dddc","resolution":{"observed_at":"2026-08-01T09:31:33.596277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.322286Z","title":"By construction, ¯p(C, γ2, x) = E s∼wγadd [ ¯p(Cs, γ1, x)]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.322286Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:c67d41ca25897eae13494bebf3ae7afe041b6d2eb66694f6756f41e7cf8615e2","observation_id":"33c8a5d8-72f4-48a7-869a-5b89a72972c9","resolution":{"observed_at":"2026-08-01T09:31:33.322286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.609924Z","title":"Classical simulation of noisy random circuits from exponential decay of correlation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.609924Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:0a55d14f2aa3b3cf68a7467a5488fc3b3f9c5008455f0daa226d81412b09248e","observation_id":"1f74e206-527a-43de-bd3a-b1af82dc7470","resolution":{"observed_at":"2026-08-01T09:31:33.609924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.642250Z","title":"Efficient classical simulation of noisy random quantum circuits in one dimension","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.642250Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:2dc929509a465bb49b9711b7814eb568d03e961e7a04ff8bfb9d195042f4cab7","observation_id":"296e6cd1-1a54-4c9c-8753-7b386b336667","resolution":{"observed_at":"2026-08-01T09:31:33.642250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.739244Z","title":"Density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.739244Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:38b485cc1ebf9ec3ced818b926ece34fdb4b761c0b44609f2ab1d0eca69be9b7","observation_id":"869d7baa-364a-4134-91bd-f118d0a34b9f","resolution":{"observed_at":"2026-08-01T09:31:33.739244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.01450","last_updated":"2018-05-07T17:53:50Z","snapshot_observed_at":"2026-08-14T19:19:05.779405Z","submitted_at":"2018-05-03T17:52:18Z","title":"Classical Simulation of Intermediate-Size Quantum Circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.01450","snapshot_observed_at":"2026-08-01T09:31:33.655125Z","title":"Classical simulation of intermediate-size quantum circuits","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.655125Z"},"links":{"cited_paper":"/paper/1805.01450","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:083643706b733d05ec70bfab4fcd28d0eead0bf436dc58d0b6da1b1488c1ce0c","observation_id":"ed48eb4b-0d00-4562-9601-ce8e5dcf6cbf","resolution":{"observed_at":"2026-08-01T09:31:33.655125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13856","last_updated":"2024-10-17T17:59:34Z","snapshot_observed_at":"2026-08-16T13:08:17.362908Z","submitted_at":"2024-10-17T17:59:34Z","title":"A Fourier analysis framework for approximate classical simulations of quantum circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13856","snapshot_observed_at":"2026-08-01T09:31:33.662320Z","title":"A fourier analysis framework for approximate classical simulations of quantum circuits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.662320Z"},"links":{"cited_paper":"/paper/2410.13856","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:e9ade56c65b5204eab4be70172731c25541bd9456814102daf9602359895de77","observation_id":"c17cdc43-a97f-4f5b-b90e-78da8f95b6f1","resolution":{"observed_at":"2026-08-01T09:31:33.662320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.06787","last_updated":"2020-05-14T07:57:38Z","snapshot_observed_at":"2026-08-04T20:26:41.132784Z","submitted_at":"2020-05-14T07:57:38Z","title":"Classical Simulation of Quantum Supremacy Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.06787","snapshot_observed_at":"2026-08-01T09:31:33.685504Z","title":"Classical simulation of quantum supremacy circuits","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.685504Z"},"links":{"cited_paper":"/paper/2005.06787","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:94be7cfc14d123f90ebfebe543d0fdd39b2878f40b801ed362e0a88a0c347d42","observation_id":"bfab0a63-2dc6-4f8c-99da-c1cf2a1bff77","resolution":{"observed_at":"2026-08-01T09:31:33.685504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.694632Z","title":"Computational advantage of quantum random sampling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.694632Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:bf661dbd93daf324abc9a3b05eb91228d34a77432dbc6ee962661d1ac5f8cef6","observation_id":"f65bd98e-f469-4c94-bfb7-a35a3c11656f","resolution":{"observed_at":"2026-08-01T09:31:33.694632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.701578Z","title":"A polynomial-time classical algorithm for noisy quantum circuits","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.701578Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:1d0545d946b1d67e9cf766cabf0836eb939c3ecbec601e9aa8681010bb169ea7","observation_id":"b6a8c17c-cf7e-48f8-bc1e-40b843c6e873","resolution":{"observed_at":"2026-08-01T09:31:33.701578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.710409Z","title":"Simulation of quantum circuits using the big-batch tensor network method","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.710409Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:d6ddad866a29fae96e6dad16fe2d5e44ecaae45074c6d1b1a6cf097b7de831d3","observation_id":"f9bd99d8-9871-4387-be7e-1b47c434f92e","resolution":{"observed_at":"2026-08-01T09:31:33.710409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.720224Z","title":"Classical simulations 20 of noisy variational quantum circuits","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.720224Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:e5a00cb7f9e4b1cc8e5ce15af064990baf3f355670d0966cafb5575b35ee1f41","observation_id":"30f49c3a-cbe5-45ff-8704-7fad17e66bff","resolution":{"observed_at":"2026-08-01T09:31:33.720224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.00152","last_updated":"2024-02-29T22:09:17Z","snapshot_observed_at":"2026-08-16T14:13:56.973696Z","submitted_at":"2024-02-29T22:09:17Z","title":"Enabling large-depth simulation of noisy quantum circuits with positive tensor networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.00152","snapshot_observed_at":"2026-08-01T09:31:33.724640Z","title":"Enabling large-depth simulation of noisy quantum circuits with positive tensor networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.724640Z"},"links":{"cited_paper":"/paper/2403.00152","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:0e7975b5f6c9c31dd2c71a64ee066ee0d724270a5f09e1a2e37c5b304c813963","observation_id":"3e814de6-4813-4fd3-a02f-d421863aab43","resolution":{"observed_at":"2026-08-01T09:31:33.724640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.732993Z","title":"Simulating noisy quantum circuits with matrix product density operators","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.732993Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:6da20f23816614fbfc6cbf5348116bc6b37ef82e9859cfdb781096bd46e4535c","observation_id":"f0327402-017f-4e3c-bcf2-c51a901ea2ca","resolution":{"observed_at":"2026-08-01T09:31:33.732993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.352478Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.352478Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:ca7c0a79024fb7cee671513f97cdcd964c3001e197646b6b7cd21aebcd83e0c2","observation_id":"000ec9b0-e274-4582-9e0c-8084df9b6117","resolution":{"observed_at":"2026-08-01T09:31:33.352478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.748719Z","title":"Scalable projected entangled-pair state representation of random quantum circuit states","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.748719Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:12d20f25c428d9f5fec7945f469625049eaa59c464302c85ae899b8316407ba3","observation_id":"fcbd34d2-b609-47ec-b172-d9bbc9ff59c3","resolution":{"observed_at":"2026-08-01T09:31:33.748719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.754951Z","title":"Relative entropy convergence for depolarizing channels","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.754951Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:197b6359e60d7d80ad65aabc49fad3bdaca4a7a3f99823e37a25267dcfefb4f5","observation_id":"793ce953-b17e-4d8d-be31-6b8ae194123a","resolution":{"observed_at":"2026-08-01T09:31:33.754951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13927","last_updated":"2024-10-10T17:00:14Z","snapshot_observed_at":"2026-08-16T14:07:54.269136Z","submitted_at":"2024-03-20T19:00:49Z","title":"Noise-induced shallow circuits and absence of barren plateaus","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13927","snapshot_observed_at":"2026-08-01T09:31:33.762442Z","title":"Noise-induced shallow circuits and absence of barren plateaus","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.762442Z"},"links":{"cited_paper":"/paper/2403.13927","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:a9735dfac6eea272ae608296ace71368dd55c315085c0827bf6cb44567119fef","observation_id":"4a76f173-c592-436d-aa96-57bb337fa20a","resolution":{"observed_at":"2026-08-01T09:31:33.762442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.774011Z","title":"Limitations of optimization algorithms on noisy quantum devices","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.774011Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:98ea4e46b7bc441b11018b9d33e3f18d2c417b5a49e5477bebe0b83f717505af","observation_id":"19985060-b80b-45fe-90f5-9a1cf3221213","resolution":{"observed_at":"2026-08-01T09:31:33.774011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.782083Z","title":"Efficient classical simulation of random shallow 2d quantum circuits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.782083Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:21a82a919c1bc516e0b0ace631311e7237663f370ca79925eb3ea20fa5b2077b","observation_id":"7147ef85-f91d-411d-9592-503e47541cc4","resolution":{"observed_at":"2026-08-01T09:31:33.782083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.791641Z","title":"Efficient sampling of noisy shallow circuits via monitored unraveling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.791641Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:4e8e22e7440e9a8ee2ca52194d1158ea925de648d2708430b816a31f1e22ed02","observation_id":"85989711-1d34-468a-9399-bba9fbab96f4","resolution":{"observed_at":"2026-08-01T09:31:33.791641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.796221Z","title":"Optimized trajectory unraveling for classical simulation of noisy quantum dynamics","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.796221Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:95948552e365ba6602a3f371323824e9fc3083ddc9c4b8fa14721b87f65e741f","observation_id":"c0c6b4be-9771-4616-81c2-5bc0f8bdd391","resolution":{"observed_at":"2026-08-01T09:31:33.796221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.800867Z","title":"Efficient simulation of one-dimensional quantum many-body systems","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.800867Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:a2b9e34ff18e9f5c2265c2b2d73402435fce391895f41ef54f4bdb6e957dd21a","observation_id":"188b53da-98d7-479a-bb0d-38391c544ead","resolution":{"observed_at":"2026-08-01T09:31:33.800867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.807956Z","title":"Simulating quantum computation by contracting tensor networks","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.807956Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:8b514f2add793ed2f094127d19640cfb488d02cf0ad15e0ed1dd463c34917a56","observation_id":"bd44780c-10fb-40c5-8ac7-0f96e21826aa","resolution":{"observed_at":"2026-08-01T09:31:33.807956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0603163","last_updated":"2006-03-19T12:18:14Z","snapshot_observed_at":"2026-07-07T07:22:06.341127Z","submitted_at":"2006-03-19T12:18:14Z","title":"On the simulation of quantum circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0603163","snapshot_observed_at":"2026-08-01T09:31:33.816222Z","title":"On the simulation of quantum circuits","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.816222Z"},"links":{"cited_paper":"/paper/quant-ph/0603163","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:b50f1e41722c98774d4a7e89f980f0b4dd37b6bda517272449652e0015dfbd39","observation_id":"c97059cc-63ef-4bec-a1f3-cc2584355e99","resolution":{"observed_at":"2026-08-01T09:31:33.816222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.824726Z","title":"On approximation algorithms for# p","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.824726Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:9de64602cf2de1656b2f0d73692bcf10b5661ca06ea9a2afa571a67e9f82e8ff","observation_id":"320fff38-51b5-4b81-8e47-755498e2e697","resolution":{"observed_at":"2026-08-01T09:31:33.824726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.836496Z","title":"Exponential improvements to the average- case hardness of bosonsampling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.836496Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:b66d1d2ab1d271703255c6eee22b623fc30a461b0248685b7cda303fb7af6061","observation_id":"eaf086b4-a4a0-4f3f-b0ce-fe6185bad682","resolution":{"observed_at":"2026-08-01T09:31:33.836496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.856410Z","title":"Characterizing quantum supremacy in near-term devices","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.856410Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:0bc9a0179f5f937b6c78b9e7e164f3061cb587f6930cabfa2da775f37e1e69d2","observation_id":"7d8359d0-802e-41ba-abfc-4d62e8a5a417","resolution":{"observed_at":"2026-08-01T09:31:33.856410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.01875","last_updated":"2017-08-06T11:03:09Z","snapshot_observed_at":"2026-08-14T20:42:57.370179Z","submitted_at":"2017-08-06T11:03:09Z","title":"Fourier analysis of sampling from noisy chaotic quantum circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.01875","snapshot_observed_at":"2026-08-01T09:31:33.866305Z","title":"Fourier analysis of sampling from noisy chaotic quantum circuits","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.866305Z"},"links":{"cited_paper":"/paper/1708.01875","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:8dfa080855ef323047904e285b375854c38af957052f72a5f514f3705d6e047a","observation_id":"3730f49a-4e5e-4527-a04f-e11760ce91b4","resolution":{"observed_at":"2026-08-01T09:31:33.866305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.877736Z","title":"Effect of nonunital noise on random-circuit sampling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.877736Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:6ac394f2bbe837196982ea8e60e43f386efc943fdd411cfc6ce96dd33efe5041","observation_id":"88dc26ce-7872-433d-9aea-872aa42718b4","resolution":{"observed_at":"2026-08-01T09:31:33.877736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.889215Z","title":"Entanglement dynamics of noisy random circuits","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.889215Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:50b2c10f5bd6f19cb3821ac6d231af87ab6bd69d327b8cd781ae2f33c13c6834","observation_id":"2508ea9c-38c5-4b31-b05e-819db9e7eec9","resolution":{"observed_at":"2026-08-01T09:31:33.889215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.904136Z","title":"Entanglement entropy scaling of noisy random quantum circuits in two dimensions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.904136Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:98a0fccd64410321c613733e505220bd48f4a957ebf6bcf43ce8610e97641ead","observation_id":"4027799e-b24c-44cb-965e-f5b34786ca56","resolution":{"observed_at":"2026-08-01T09:31:33.904136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.919106Z","title":"Noise-induced entanglement transition in one-dimensional random quantum circuits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.919106Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:c9554cbcd9c1f81975a1126964e6812aec68d4dc46d7f43b0a6703c411443a57","observation_id":"834fd232-a7fa-448f-8bf2-a20da742ee99","resolution":{"observed_at":"2026-08-01T09:31:33.919106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.927725Z","title":"The computational complexity of linear optics","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.927725Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:25bd1c9e179ad71f1265a95047f4dafcfc088236a812a7f387c6a5cafcf478a1","observation_id":"23345062-8de2-465d-9e65-a10e62d1aef0","resolution":{"observed_at":"2026-08-01T09:31:33.927725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.937881Z","title":"Exploring shallow-depth boson sampling: Toward a scalable quantum advantage","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.937881Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:97ccf18d033714e4e49ea20286888ffa12a53734ca74d574ca244c480d7f016e","observation_id":"addff42e-bcfd-453e-ac66-141f49a21b86","resolution":{"observed_at":"2026-08-01T09:31:33.937881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01805","last_updated":"2018-05-29T13:42:30Z","snapshot_observed_at":"2026-08-14T20:35:40.535773Z","submitted_at":"2017-09-06T12:46:12Z","title":"Complexity Classification of Conjugated Clifford Circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.01805","snapshot_observed_at":"2026-08-01T09:31:33.950365Z","title":"Complexity classification of conjugated clifford circuits","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.950365Z"},"links":{"cited_paper":"/paper/1709.01805","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:2f0a00292da7e47e52b3007dfc5a72e46779eb79e9b89afa2b03dbad0b9c78e8","observation_id":"fbeb1702-78eb-48fc-b0c6-86c623edcd4a","resolution":{"observed_at":"2026-08-01T09:31:33.950365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.973539Z","title":"Quantum computational advantage of noisy boson sampling with partially distinguishable photons","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.973539Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:a9f418f0e8afc9e7704711847bc9bb648dd3e000f9593ef7938df0d3e3467972","observation_id":"e5461e72-572e-4d2e-9c58-9cac4d8d6113","resolution":{"observed_at":"2026-08-01T09:31:33.973539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:33.983339Z","title":"Sufficient conditions for hardness of lossy gaussian boson sampling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.983339Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:a5109ac4f3c0594373cbe388dbacf8a55ba2aaef500d1437f18bfe7f1816cfec","observation_id":"ede5357c-1959-4732-96ef-cfd9fa237ad6","resolution":{"observed_at":"2026-08-01T09:31:33.983339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00286","last_updated":"2025-03-19T17:42:13Z","snapshot_observed_at":"2026-08-16T14:38:36.773534Z","submitted_at":"2023-12-01T02:03:09Z","title":"Complexity-theoretic foundations of BosonSampling with a linear number of modes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00286","snapshot_observed_at":"2026-08-01T09:31:33.994732Z","title":"Complexity-theoretic foundations of bosonsampling with a linear number of modes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:33.994732Z"},"links":{"cited_paper":"/paper/2312.00286","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:66c6c83db543e5b38b15894079af3784c1bc08f6c3e583e492c6999584c2171c","observation_id":"926ebc2d-46ec-4dec-bb66-35c91cedb037","resolution":{"observed_at":"2026-08-01T09:31:33.994732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.008579Z","title":"Pp is as hard as the polynomial-time hierarchy","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.008579Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:1fcd175d06211179993b16feb5f470c06b400146a240d8f769a0791f46b004b1","observation_id":"e99f9f77-0b40-4a44-b275-7be9ac663816","resolution":{"observed_at":"2026-08-01T09:31:34.008579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.014328Z","title":"Efficient classical algorithm for boson sampling with partially distinguishable photons","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.014328Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:65b82b583f985a8c1313bf548123de95e0e4f79bf764d0776ca0546d430e0a3a","observation_id":"3d69818a-8b68-4e4a-ba07-2910de2b84cd","resolution":{"observed_at":"2026-08-01T09:31:34.014328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.019980Z","title":"Classically simulating near- term partially-distinguishable and lossy boson sampling","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.019980Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:a8a90675153022ebf9d73ec18f8947bceb645c2d8ba13d5884485fca4cd3e98d","observation_id":"cfb798b4-e373-432f-a029-4b06630e353c","resolution":{"observed_at":"2026-08-01T09:31:34.019980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.026856Z","title":"Noise in boson sampling and the threshold of efficient classical simulatability","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.026856Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:292cc3761fac62f1fa01aaa9366a7406f2ad3f2d567482fc1452947fc140d047","observation_id":"0114159b-cd31-41df-b7e6-d261d4e02b29","resolution":{"observed_at":"2026-08-01T09:31:34.026856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.043031Z","title":"Simulating boson sampling in lossy architectures","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.043031Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:c36798bd3ced4206819db54dead5f428fec9df2979ee2416328f2623121b6da0","observation_id":"64bc52aa-3a1f-4987-9b80-822c1b30e3ce","resolution":{"observed_at":"2026-08-01T09:31:34.043031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.052676Z","title":"Classical simulation of photonic linear optics with lost particles","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.052676Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:f61580a98fdbce540fd5a6da91722478ac69680341d773fd63b265004c803bca","observation_id":"e98d4d6d-28ce-406a-9189-e80ac1ebbe67","resolution":{"observed_at":"2026-08-01T09:31:34.052676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.057351Z","title":"Classical simulation of linear optics subject to nonuniform losses","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.057351Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:71d7b8e24568923b8972f47c996ec044d697efc472001579324a989ec9aab8cc","observation_id":"02aeca3b-9035-4ba3-9dab-446ba4859552","resolution":{"observed_at":"2026-08-01T09:31:34.057351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.065025Z","title":"Classical simulation of lossy boson sampling using matrix product operators","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.065025Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:7cd418acec29541c8dd34f07f8f3af4925677d5efe237520cf500b99cf59f0e9","observation_id":"ce6deaac-4f13-4479-83d4-a84f1e7af082","resolution":{"observed_at":"2026-08-01T09:31:34.065025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11532","last_updated":"2023-01-27T04:42:59Z","snapshot_observed_at":"2026-08-16T15:59:48.560454Z","submitted_at":"2023-01-27T04:42:59Z","title":"On classical simulation algorithms for noisy Boson Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11532","snapshot_observed_at":"2026-08-01T09:31:34.082928Z","title":"On classical simulation algorithms for noisy boson sampling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.082928Z"},"links":{"cited_paper":"/paper/2301.11532","citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:29a3ee87f1f911464caf15b79245752439e28db0adb4614b5b51114691335fbe","observation_id":"96452bc7-951a-4678-b1d0-2510eedf8f36","resolution":{"observed_at":"2026-08-01T09:31:34.082928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.090838Z","title":"Classical simulability of constant- depth linear-optical circuits with noise","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.090838Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:cdcfef294f855eca34093c15d961e798cffe75b927c1840ffee72595e06f8f5d","observation_id":"c0fdf15c-18a8-41b1-8098-e8b300a6e757","resolution":{"observed_at":"2026-08-01T09:31:34.090838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.099362Z","title":"Achieving quantum supremacy with sparse and noisy commuting quantum computations","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.099362Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:e95b213c13d1573c8f7aeebc91716a33a7058fd548f1a12eb3f94baf374c8bd1","observation_id":"bdd32dfe-f8e7-455d-8883-d4084fd599d8","resolution":{"observed_at":"2026-08-01T09:31:34.099362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.121199Z","title":"Polynomial-time classical simulation of noisy iqp circuits with constant depth","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.121199Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:7011ffb14e1c9bb34ac70dfc7af03ecc3e9da0afdd2ac5458eb35f4e94586ab1","observation_id":"752f14c0-47a0-4211-afe6-118f8347fb36","resolution":{"observed_at":"2026-08-01T09:31:34.121199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.130750Z","title":"Recent theoretical and experimental progress on boson sampling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.130750Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:e89bf2d7d0348dc6b430cfd8ac86ed6c9bd05a8658dee7fd3ffd9019271e39db","observation_id":"c02887bb-e6a4-414e-86ff-2d8af4b7c979","resolution":{"observed_at":"2026-08-01T09:31:34.130750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.140632Z","title":"Faster algorithms via approximation theory","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.140632Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:46d076f8e82a976df1f69debfa70ab7d6c2d307bcafa023dece52c816d275ea1","observation_id":"29322568-ff2f-42a6-81f3-a0c2a3786fbd","resolution":{"observed_at":"2026-08-01T09:31:34.140632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.145923Z","title":"Chebyshev polynomials","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.145923Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:aef2b81e3dac1c9bb244baecc142e1a33ebbe40fcb03077e3dd2b35b3cae1c40","observation_id":"2d1d410a-71bb-4c64-a47b-0f883ddd5ae0","resolution":{"observed_at":"2026-08-01T09:31:34.145923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.150656Z","title":"Le¸ cons sur les fonctions de variables r´ eelles et les d´ eveloppements en s´ eries de polynˆ omes","venue":null,"work_id":null,"year":1928},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.150656Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:8d83e0b920c78931bf4e773f69aeb8785ee0b0c9d58625b440cef46b772411bb","observation_id":"2353a02c-765e-4a80-bd4b-d868f93bf993","resolution":{"observed_at":"2026-08-01T09:31:34.150656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.164433Z","title":"Approximation theory and approximation practice, extended edition","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.164433Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:33c6fba45e6932182f163769d774fa7cc514f2e2fc105ebe8c66ffc4681875a6","observation_id":"62f98c39-7946-4317-9e9a-0c7d9dc6e5f1","resolution":{"observed_at":"2026-08-01T09:31:34.164433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.180682Z","title":"A survey of practical rational and polynomial approximation of functions","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.180682Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:166238cd56d860c9d5dad33d85f551f0e9c02831af7b4ba6006d84109d474b79","observation_id":"c1ca1cd4-4430-45f1-8a15-b87c5c29e731","resolution":{"observed_at":"2026-08-01T09:31:34.180682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:31:34.189845Z","title":"Chebyshev series expansion of inverse polynomials","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-01T09:31:34.189845Z"},"links":{"citing_paper":"/paper/2607.20804"},"observation_digest":"sha256:2c8c3c81f0248ae30086e84e51f9f7eaf2fc08145fd0e6673b66d1e6fe75a6e1","observation_id":"8b2bd48e-1299-40ed-b0b5-2e5ca9a7c278","resolution":{"observed_at":"2026-08-01T09:31:34.189845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20804","last_updated":"2026-07-23T00:23:18Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T17:09:58.924814Z","submitted_at":"2026-07-23T00:23:18Z","title":"Hardness and Complexity Transition of Noisy Random Circuit Sampling"},"reference_resolution":{"displayed":85,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":85,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":85},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 85 of 85 outbound references and 0 inbound Pith citation observations for arXiv:2607.20804."}