{"as_of":"2026-08-07T23:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d118d9f825c851314d185f612bb2f002a0856cb7b92f43f1b3864ef249666b00","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:59:22.126154Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2509.09642/citation-record","integrity":"/paper/2509.09642/integrity","json":"/paper/2509.09642/citation-record.json","paper":"/paper/2509.09642"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:59:14.428597Z","title":"Quantum Computing in the NISQ era and beyond","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:14.428597Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:f4fa573672c2130f1471fdb6563aa97be0fc8fc294f27d77f19fd38e1f45e012","observation_id":"3ddf95f6-5cc7-44ca-bfea-26ed6aa2d5da","resolution":{"observed_at":"2026-08-04T18:59:14.428597Z","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-04T18:59:14.496670Z","title":"A fast quantum mechanical algorithm for database search","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:14.496670Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:d97f42e52c46eead36fdcc0d45d385cf34e74cc2680bc28849b8e3d8e63d83b9","observation_id":"ff798ab5-d7f3-478c-b8ed-37b266422aa1","resolution":{"observed_at":"2026-08-04T18:59:14.496670Z","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-04T18:59:14.599121Z","title":"Polynomial-time algorithms for prime factorization and discrete loga- rithms on a quantum computer","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:14.599121Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:902f76e9b033df83a3b92664d378a34325be0296f01870f8948acfc0c5254d17","observation_id":"c4ee69d4-ce5b-4a7e-91be-7ccc929a0f7c","resolution":{"observed_at":"2026-08-04T18:59:14.599121Z","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-04T18:59:14.690196Z","title":"Quantum algorithm for linear systems of equations","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:14.690196Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:843ae82d2cb942aaa18b37b8e456b4d11e151fec89ffee9654ae4999d43ec583","observation_id":"99822bde-0e2b-4067-93ef-74f99425672a","resolution":{"observed_at":"2026-08-04T18:59:14.690196Z","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-04T18:59:14.787904Z","title":"Noisy intermediate-scale quantum algorithms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:14.787904Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:a839a44b3fa227feb51601adf7f98970bbd0b24f357517f15c3f2569a88ca98e","observation_id":"e0536db2-2e03-4da3-8892-342d5703f939","resolution":{"observed_at":"2026-08-04T18:59:14.787904Z","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-04T18:59:14.882833Z","title":"Shallowquantumcircuits: Algorithms, complexity, andfaulttolerance","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:14.882833Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:463fd5c711da6d8ecf5aebac4f985f445acab8ce91054797309490bce770c80e","observation_id":"b2f2ca85-9834-4bc3-8166-acf97d0a3121","resolution":{"observed_at":"2026-08-04T18:59:14.882833Z","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-04T18:59:14.985474Z","title":"Quantum advantage with shallow circuits","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:14.985474Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:fc4216b4dd3c7162f677da8296903047c8f2146129915267c98c3080b6a67b71","observation_id":"76b0fc00-3f55-4e68-983c-9669abe42715","resolution":{"observed_at":"2026-08-04T18:59:14.985474Z","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-04T18:59:15.088817Z","title":"Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.088817Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:65e2f8b964ac10e8111db8a828e619b1e494f51cb0fba7734d78c76482274856","observation_id":"1543aa53-a3db-41d7-bd16-ed554937d237","resolution":{"observed_at":"2026-08-04T18:59:15.088817Z","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-04T18:59:15.186923Z","title":"Delegating private quantum computations","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.186923Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:14ea6fdfa0561650fd716b9a2260d4568809877b9fd912c95eee847af9312630","observation_id":"cebd26d0-ba26-47b3-9e0a-05d4e226d8a2","resolution":{"observed_at":"2026-08-04T18:59:15.186923Z","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-04T18:59:15.289457Z","title":"A one-query lower bound for unitary synthesis and breaking quantum cryptography","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.289457Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:91c096b36058e20c970a627ea88443525ded7c0ee9a7503c3eb6b1e738561e07","observation_id":"f14d15d8-49d0-4f05-8317-2e4579ccceae","resolution":{"observed_at":"2026-08-04T18:59:15.289457Z","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-04T18:59:15.395922Z","title":"Programmable quantum gate arrays","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.395922Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:d866a88d5421a749715f480ce58a9c31ee109f7193b0a91e3268f0fc2073cd7e","observation_id":"63f97500-bc5a-4cd6-94bd-075280cb8266","resolution":{"observed_at":"2026-08-04T18:59:15.395922Z","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-04T18:59:15.493996Z","title":"Probabilistic implementation of universal quantum processors","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.493996Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:aa08efb5d46aeb413bf762142017e9746c45312fda4c0a748437a8cc2ab4b2a4","observation_id":"f32c556b-e915-4032-8952-4a9b35c8cd69","resolution":{"observed_at":"2026-08-04T18:59:15.493996Z","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-04T18:59:15.596984Z","title":"Measurement-based quantum computation beyond the one-way model","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.596984Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:81e0b6a06d6d66a2d975b97b8f8525feb31fb8f0408801ad0946d072128325d4","observation_id":"55f809d2-1988-46f9-8bd7-683d7b4355ad","resolution":{"observed_at":"2026-08-04T18:59:15.596984Z","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-04T18:59:15.711962Z","title":"Asymptotic teleportation scheme as a uni- versal programmable quantum processor","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.711962Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:bd1bd15103615c0aabf04def6feb966f1bec894b0e869c0b64802e59759b00b4","observation_id":"0693fdd8-2b4d-4fac-b292-cede79564ee7","resolution":{"observed_at":"2026-08-04T18:59:15.711962Z","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-04T18:59:15.806484Z","title":"Resource quan- tification for the no-programing theorem","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.806484Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:ffe2e60c9cc33d88f120f85a8f5e70b3ac668f6591baf13f26fa1d904cc5de99","observation_id":"2316c581-c1d3-43da-8f6f-6f4cb9d4964e","resolution":{"observed_at":"2026-08-04T18:59:15.806484Z","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-04T18:59:15.903929Z","title":"Optimal universal program- ming of unitary gates","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.903929Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:1a50d765bc6e40b83b886601d0de5d3ac4dcd642c2b66963eefc541cd13246d9","observation_id":"a7eeb86e-b05e-4a63-a8be-5b294bf78db4","resolution":{"observed_at":"2026-08-04T18:59:15.903929Z","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-04T18:59:15.976309Z","title":"Programmability of covariant quantum channels","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:15.976309Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:094a93887cd4bfc5fd4df7d52e5ad29f247e803dd1c893323bebcca24fd05db2","observation_id":"efa334dd-e1c3-474c-9dd0-9b23aadb9a0f","resolution":{"observed_at":"2026-08-04T18:59:15.976309Z","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-04T18:59:16.095660Z","title":"Port-Based State Preparation and Appli- cations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:16.095660Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:5449ef2880e80f8b7f45d571f23f92d558a47c0d249b281f6cf53e9befedd7f9","observation_id":"66b9f84d-82dd-46e3-9e48-e4b6f85b4c15","resolution":{"observed_at":"2026-08-04T18:59:16.095660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.10784","last_updated":"2026-04-17T07:38:57Z","snapshot_observed_at":"2026-08-01T16:33:33.147819Z","submitted_at":"2025-07-14T20:18:12Z","title":"Quantum Advantage in Storage and Retrieval of Isometry Channels","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.10784","snapshot_observed_at":"2026-08-04T18:59:16.169426Z","title":"Quantum advantage in storage and retrieval of isometry channels","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:16.169426Z"},"links":{"cited_paper":"/paper/2507.10784","citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:4f16cc46673917156bb9bc62763a5c4bf3f7ae8126bd8e0ba8984b75dde332a5","observation_id":"ab25b236-d728-4fb4-9284-7ecf10e2c278","resolution":{"observed_at":"2026-08-04T18:59:16.169426Z","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-04T18:59:16.313786Z","title":"Computational complexity: A modern approach","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:16.313786Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:86894d468d60a9a4d8671474f4fefa486404db59eb84640fa3a3de800a64691d","observation_id":"c301107f-14bc-4da4-83d4-0387c33aeb6b","resolution":{"observed_at":"2026-08-04T18:59:16.313786Z","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-04T18:59:16.467181Z","title":"Linear growth of quantum circuit complexity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:16.467181Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:205721fd06c75d7c0a84ff1c203ef666a64d61a5be67cce516a9144694eceb4b","observation_id":"9186b78e-d999-4e94-847f-b157c37f960d","resolution":{"observed_at":"2026-08-04T18:59:16.467181Z","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-04T18:59:16.681767Z","title":"Approximatet-designs in generic circuit architectures","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:16.681767Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:976824b999664d546f2eccfc9bfdb837bb3c7b5528d774acd62e196bafc71de6","observation_id":"e3166fa6-6190-49ff-b980-837a994d6840","resolution":{"observed_at":"2026-08-04T18:59:16.681767Z","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-04T18:59:16.820050Z","title":"Learning quantum states and unitaries of bounded gate complex- ity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:16.820050Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:4efe356a41b95692eea0ebb28403c58f8463a06c1b403fb25101f200aae1de5c","observation_id":"a522ef84-d1e7-4715-b1a5-040879f73f88","resolution":{"observed_at":"2026-08-04T18:59:16.820050Z","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-04T18:59:17.022362Z","title":"Learning shallow quantum circuits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:17.022362Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:2842851c68667051658a31d8efb8ab5ad02cf2617bcdf20336ebc5f6f2b36a47","observation_id":"056b952a-b2e9-42b9-a758-64d9233ed0b8","resolution":{"observed_at":"2026-08-04T18:59:17.022362Z","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-04T18:59:17.089399Z","title":"Compression of quantum shallow-circuit states","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:17.089399Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:38847399ac37816c3b545679a026abf01d2fa6fc7562207c5667a527ebbf4330","observation_id":"50821610-4a75-4ac6-969d-7707238e377d","resolution":{"observed_at":"2026-08-04T18:59:17.089399Z","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-04T18:59:17.187779Z","title":"Quantum computation and quantum infor- mation: 10th anniversary edition","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:17.187779Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:f240244465269b7aa7d5a34915b01c942e2061987b7d3f46d0a31001fc24c36f","observation_id":"6ae1b8bb-e77b-4c35-9a03-93862edd5333","resolution":{"observed_at":"2026-08-04T18:59:17.187779Z","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-04T18:59:17.320003Z","title":"On the pauli spectrum ofQAC0","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:17.320003Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:33b7b8fe58fd925cb04a365650d41e0cf2d6681cfefab5542eec6e0a9899782f","observation_id":"84ae3a4a-0377-4fe3-af18-cb20c91d81d8","resolution":{"observed_at":"2026-08-04T18:59:17.320003Z","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-04T18:59:17.449122Z","title":"Symmetry, representations, and invariants","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:17.449122Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:926e8e880acb50d7c13614fc7c4c177c255111dd44bcfb814676f710c54d0618","observation_id":"ca570eef-bfac-4b9f-8ac4-85d34a4796a8","resolution":{"observed_at":"2026-08-04T18:59:17.449122Z","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-04T18:59:17.638376Z","title":"Applications of coherent classical communication and the schur transform to quantum information theory","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:17.638376Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:63b7c23faaaecf275d52882f1d9dea11f0ea8cdac6fd5547cbd80cd43e357606","observation_id":"3be07542-525c-4931-8b70-067464bb01e9","resolution":{"observed_at":"2026-08-04T18:59:17.638376Z","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-04T18:59:17.817716Z","title":"Simple Con- structions of Linear-Depth t-Designs and Pseudorandom Unitaries","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:17.817716Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:f7e747eeaf62523ce5c4329ed18854151e3b5318b8d2e75261edd65860338957","observation_id":"c3ce7935-3145-4999-81ed-e49cf41360d4","resolution":{"observed_at":"2026-08-04T18:59:17.817716Z","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-04T18:59:18.167668Z","title":"Exact and approximate unitary 2-designs and their application to fidelity estimation","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:18.167668Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:9b35898497eaa06a315b1cddf2ecd64a7e8a284fa7923098a1ac6116e0728185","observation_id":"50524999-5ca6-41a2-a5d8-cc03fd2d8de7","resolution":{"observed_at":"2026-08-04T18:59:18.167668Z","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-04T18:59:18.416198Z","title":"Optimal quantum learning of a unitary transformation","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:18.416198Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:201f973d81a5d47a08f9d71d338200e2069ff984e187de6538f90ff0825b808e","observation_id":"0430f2cb-08bb-4acf-88d0-8e8ff366f3cf","resolution":{"observed_at":"2026-08-04T18:59:18.416198Z","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-04T18:59:18.627573Z","title":"Scalable noise estimation with random unitary operators","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:18.627573Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:aa6f4415600e9d7ea98a284697670cfa3e41f408f141977904e91bca48f1b049","observation_id":"dc080732-36e3-491f-b464-92cf3f1c0c13","resolution":{"observed_at":"2026-08-04T18:59:18.627573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0208112","last_updated":"2002-08-15T23:00:04Z","snapshot_observed_at":"2026-07-07T07:10:39.202749Z","submitted_at":"2002-08-15T23:00:04Z","title":"Creating superpositions that correspond to efficiently integrable probability distributions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0208112","snapshot_observed_at":"2026-08-04T18:59:18.781520Z","title":"Creating superpositions that correspond to efficiently integrable probability distributions","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:18.781520Z"},"links":{"cited_paper":"/paper/quant-ph/0208112","citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:00aac019c5ec82aab313e4bfd26ec499fd30269f7e88e59c1414bbb02be403fe","observation_id":"a26557fa-c5a1-4ed5-8978-7561708bc024","resolution":{"observed_at":"2026-08-04T18:59:18.781520Z","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-04T18:59:18.912781Z","title":"An efficient high dimensional quantum Schur transform","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:18.912781Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:e8da52de2e3144296b793f922f357c66307002e96872bff4a6e6cb01d30295fb","observation_id":"6dbc155e-f147-4625-8ae6-f8295b5b2f0f","resolution":{"observed_at":"2026-08-04T18:59:18.912781Z","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-04T18:59:19.108909Z","title":"Quantum state preparation with optimal circuit depth: Implementations and applications","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:19.108909Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:2c12602f9095a34a6c39f355733f42dcc813c417e1bd699e2f011e437274e380","observation_id":"a631a203-0c46-4f7c-a682-1247faad0be2","resolution":{"observed_at":"2026-08-04T18:59:19.108909Z","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-04T18:59:19.282665Z","title":"Approximate unitary t-designs by short ran- dom quantum circuits using nearest-neighbor and long-range gates","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:19.282665Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:c2395bb4ad41a506e6deaf95f3a4ecf79c18d88ed1fdf731c5c8cf3678d13619","observation_id":"e7659a31-dec4-45b0-9efe-77ed09b41623","resolution":{"observed_at":"2026-08-04T18:59:19.282665Z","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-04T18:59:19.451070Z","title":"Efficient approximate unitary designs from random pauli rotations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:19.451070Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:35348b1b216cf1638aaabd0017beab50b2b282eefe0874f194d5274cea9f3223","observation_id":"8a6dd2c3-4786-47d6-9769-7fcf41696556","resolution":{"observed_at":"2026-08-04T18:59:19.451070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07478","last_updated":"2024-12-02T16:47:22Z","snapshot_observed_at":"2026-07-06T18:29:04.294349Z","submitted_at":"2024-06-11T17:23:16Z","title":"Incompressibility and spectral gaps of random circuits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07478","snapshot_observed_at":"2026-08-04T18:59:19.661409Z","title":"Incompressibility and spectral gaps of random circuits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:19.661409Z"},"links":{"cited_paper":"/paper/2406.07478","citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:7464980b77427da7e9b7aedc506f941f63cf0668baef4eb8073f2d6cebf2ea8d","observation_id":"4aa6bc20-4e26-439d-b820-8f1d897003d5","resolution":{"observed_at":"2026-08-04T18:59:19.661409Z","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-04T18:59:19.829234Z","title":"Random unitaries in extremely low depth","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:19.829234Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:4785adcb69684141ce7d503c7639d378aa55c5fc60c1d15f5e53cc9a8af8510d","observation_id":"389dccd9-2502-4376-8f8e-113397fa846d","resolution":{"observed_at":"2026-08-04T18:59:19.829234Z","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-04T18:59:19.994606Z","title":"Optimal estimation of group transformations using entanglement","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:19.994606Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:642a856f318423826c2b2985caaf845412ae3823b77d081137a1f7acbed19f32","observation_id":"377a17be-f160-458a-a948-ffb5ef27ee3e","resolution":{"observed_at":"2026-08-04T18:59:19.994606Z","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-04T18:59:20.131146Z","title":"Query-optimal estimation of unitary channels in diamond distance","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:20.131146Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:bb8ccffe771844bcbf731241a03ed5fccf0b26ff0145e034f8e63c456b72d574","observation_id":"ce062aba-ae4d-486e-b236-afb47e2dd2a3","resolution":{"observed_at":"2026-08-04T18:59:20.131146Z","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-04T18:59:20.325573Z","title":"Synthesis of quantum logic circuits","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:20.325573Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:877600eb48323b35feae91f8a8ba7daaf6c78968075d76f15595584c50cd0ed3","observation_id":"b97cc8f0-56fd-4a3a-8f37-ae6dba7ef9e4","resolution":{"observed_at":"2026-08-04T18:59:20.325573Z","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-04T18:59:20.541021Z","title":"Classical and quantum computation","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:20.541021Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:9e8dcd723fc32080c571b3c59664428eed89702cadbe0c593f1932116547c03f","observation_id":"4574e658-59d8-4aae-acc8-9a6f0fab508b","resolution":{"observed_at":"2026-08-04T18:59:20.541021Z","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-04T18:59:20.725544Z","title":"Bounds for the quantity of information transmitted by a quantum communication channel","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:20.725544Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:7d99e80abda4cd3fe868cc67b41b090ce0d5e02c5a9ecc3a873f939b8b1bc947","observation_id":"2dcbe4de-7f00-4f2d-976f-ca6e5059b0e9","resolution":{"observed_at":"2026-08-04T18:59:20.725544Z","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-04T18:59:20.860834Z","title":"Tight uniform continuity bounds for quantum entropies: Condi- tional entropy, relative entropy distance and energy constraints","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:20.860834Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:4d6bb12ca4dfe17c8e26f67c00a1431567ca4c68723c654dcac2af1411520dbf","observation_id":"1676e25f-7254-4758-89d0-669a9008e857","resolution":{"observed_at":"2026-08-04T18:59:20.860834Z","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-04T18:59:21.052153Z","title":"Asymptotic values for degrees associated with strips of young dia- grams","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:21.052153Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:7e7dad8ad267abeffe3bd0de17b9a1a7da16160c42216de826f221169989983a","observation_id":"222375b2-2b3c-4cb7-903c-2efe07c640de","resolution":{"observed_at":"2026-08-04T18:59:21.052153Z","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-04T18:59:21.197499Z","title":"Optimal compression for identically prepared qubit states","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:21.197499Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:032361607df6de15f2abbcc071885ae5dc596b6a579ef0422784fbc76f180f04","observation_id":"90c3223a-af6f-4bee-906a-e8d76a008f7c","resolution":{"observed_at":"2026-08-04T18:59:21.197499Z","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-04T18:59:21.369173Z","title":"On the computa- tional power ofQAC 0 with barely superlinear ancillae","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:21.369173Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:fadfbbefcab8bf3b69faa506c0671faedd5d4c9d82de798b0b833dab7f37ebfd","observation_id":"04f38cd8-7d93-4561-bf16-74321f02eeff","resolution":{"observed_at":"2026-08-04T18:59:21.369173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01593","last_updated":"2016-11-05T03:14:50Z","snapshot_observed_at":"2026-07-06T05:17:29.499249Z","submitted_at":"2016-11-05T03:14:50Z","title":"Operator Lipschitz functions (English translation)","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01593","snapshot_observed_at":"2026-08-04T18:59:21.528752Z","title":"Operator lipschitz functions (english trans- lation)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:21.528752Z"},"links":{"cited_paper":"/paper/1611.01593","citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:20dc7af9d5678e9d4b083db0d5937cb53db64fd2921318c23141ebda941015f9","observation_id":"236dcad7-1101-41b7-869a-a6881ad50d4e","resolution":{"observed_at":"2026-08-04T18:59:21.528752Z","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-04T18:59:21.763409Z","title":"Quantum state and unitary learn- ing implies circuit lower bounds","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:21.763409Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:6c195b3bc049e3c22af246ba0de490507927bf80b326298d68226590f6d46127","observation_id":"cc122e69-3729-4764-946f-1b7e50261408","resolution":{"observed_at":"2026-08-04T18:59:21.763409Z","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-04T18:59:21.963762Z","title":"On the geometry of stabi- lizer states","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:21.963762Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:5d2bbfed09e6bd7bde1aa30bbd600bb5715db1f5f348e034db18e25e176c78bf","observation_id":"16187431-5ae5-4125-9a7f-aa5fd92badd8","resolution":{"observed_at":"2026-08-04T18:59:21.963762Z","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-04T18:59:22.126154Z","title":"Restrictions on realizable unitary operations imposed by symmetry and locality","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:22.126154Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:38bf46b07114afe140a204035c10c8f6fce3e548ebd0583852d03e6acd20c536","observation_id":"d7034119-22b2-436d-bc13-ff6035e29e50","resolution":{"observed_at":"2026-08-04T18:59:22.126154Z","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-04T18:59:17.992275Z","title":"IEEE Computer Society","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits","version":2},"reference_index":492,"source":"pdf_text","source_observed_at":"2026-08-04T18:59:17.992275Z"},"links":{"citing_paper":"/paper/2509.09642"},"observation_digest":"sha256:fae8f334e95627ff42ece19d01d62eb5c57576b4d817ece4585309e9498a3da1","observation_id":"8fb3f222-c0c6-4547-97ac-28d4411567dc","resolution":{"observed_at":"2026-08-04T18:59:17.992275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.09642","last_updated":"2026-07-14T16:03:59Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T22:41:22.681167Z","submitted_at":"2025-09-11T17:30:32Z","title":"Resource quantification for programming low-depth quantum circuits"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":54},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2509.09642."}