{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TQLWTLAVUPAK7T6CPDIHLMNTHI","short_pith_number":"pith:TQLWTLAV","schema_version":"1.0","canonical_sha256":"9c1769ac15a3c0afcfc278d075b1b33a293a0148d74e4e6599cdbe8414263c99","source":{"kind":"arxiv","id":"2507.20677","version":1},"attestation_state":"computed","paper":{"title":"Quantum Circuit Caches and Compressors for Low Latency, High Throughput Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alan Robertson, Alexandru Paler, Ioana Moflic, Simon J. Devitt","submitted_at":"2025-07-28T09:59:22Z","abstract_excerpt":"Utility-scale quantum programs contain operations on the order of $>10^{15}$ which must be prepared and piped from a classical co-processor to the control unit of the quantum device. The latency of this process significantly increases with the size of the program: existing high-level classical representations of quantum programs are typically memory intensive and do not na\\\"ively efficiently scale to the degree required to execute utility-scale programs in real-time. To combat this limitation, we propose the utilization of high-level quantum circuit caches and compressors. The first save on th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.20677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-28T09:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"3ae5a5479c956a5f8939542ae61d6214d4c22a90ae356c080251613dc87d14d3","abstract_canon_sha256":"53101cacc39c1fcd5733e2dcd26e1c4c129a76cf078c5fc1b60e7f294acb52fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:23.946630Z","signature_b64":"2rrvL67LiEmaNYplM+vM8HdrCe5YV0dSU3Fa1SU7HA/z7QpuuciYDzsNWx9uqLcAyC9QIYBmOhuPH/GeophlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c1769ac15a3c0afcfc278d075b1b33a293a0148d74e4e6599cdbe8414263c99","last_reissued_at":"2026-07-05T11:44:23.946201Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:23.946201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Circuit Caches and Compressors for Low Latency, High Throughput Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alan Robertson, Alexandru Paler, Ioana Moflic, Simon J. Devitt","submitted_at":"2025-07-28T09:59:22Z","abstract_excerpt":"Utility-scale quantum programs contain operations on the order of $>10^{15}$ which must be prepared and piped from a classical co-processor to the control unit of the quantum device. The latency of this process significantly increases with the size of the program: existing high-level classical representations of quantum programs are typically memory intensive and do not na\\\"ively efficiently scale to the degree required to execute utility-scale programs in real-time. To combat this limitation, we propose the utilization of high-level quantum circuit caches and compressors. The first save on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20677","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.20677/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.20677","created_at":"2026-07-05T11:44:23.946265+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20677v1","created_at":"2026-07-05T11:44:23.946265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20677","created_at":"2026-07-05T11:44:23.946265+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQLWTLAVUPAK","created_at":"2026-07-05T11:44:23.946265+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQLWTLAVUPAK7T6C","created_at":"2026-07-05T11:44:23.946265+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQLWTLAV","created_at":"2026-07-05T11:44:23.946265+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TQLWTLAVUPAK7T6CPDIHLMNTHI","json":"https://pith.science/pith/TQLWTLAVUPAK7T6CPDIHLMNTHI.json","graph_json":"https://pith.science/api/pith-number/TQLWTLAVUPAK7T6CPDIHLMNTHI/graph.json","events_json":"https://pith.science/api/pith-number/TQLWTLAVUPAK7T6CPDIHLMNTHI/events.json","paper":"https://pith.science/paper/TQLWTLAV"},"agent_actions":{"view_html":"https://pith.science/pith/TQLWTLAVUPAK7T6CPDIHLMNTHI","download_json":"https://pith.science/pith/TQLWTLAVUPAK7T6CPDIHLMNTHI.json","view_paper":"https://pith.science/paper/TQLWTLAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20677&json=true","fetch_graph":"https://pith.science/api/pith-number/TQLWTLAVUPAK7T6CPDIHLMNTHI/graph.json","fetch_events":"https://pith.science/api/pith-number/TQLWTLAVUPAK7T6CPDIHLMNTHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQLWTLAVUPAK7T6CPDIHLMNTHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQLWTLAVUPAK7T6CPDIHLMNTHI/action/storage_attestation","attest_author":"https://pith.science/pith/TQLWTLAVUPAK7T6CPDIHLMNTHI/action/author_attestation","sign_citation":"https://pith.science/pith/TQLWTLAVUPAK7T6CPDIHLMNTHI/action/citation_signature","submit_replication":"https://pith.science/pith/TQLWTLAVUPAK7T6CPDIHLMNTHI/action/replication_record"}},"created_at":"2026-07-05T11:44:23.946265+00:00","updated_at":"2026-07-05T11:44:23.946265+00:00"}