{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6S7AEHMMXA7QGJRB6E4YFYKEFG","short_pith_number":"pith:6S7AEHMM","schema_version":"1.0","canonical_sha256":"f4be021d8cb83f032621f13982e14429b286559396c842e043961f68d09cd12f","source":{"kind":"arxiv","id":"2506.07257","version":3},"attestation_state":"computed","paper":{"title":"A Quantum Computational Perspective on Spread Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Cameron Beetar, Eric L Graef, Hendrik J R Van Zyl, Horatiu Nastase, Jeff Murugan","submitted_at":"2025-06-08T19:04:42Z","abstract_excerpt":"We establish a direct connection between spread complexity and quantum circuit complexity by demonstrating that spread complexity emerges as a limiting case of a circuit complexity framework built from two fundamental operations: time-evolution and superposition. Our approach leverages a computational setup where unitary gates and beam-splitting operations generate target states, with the minimal cost of synthesis yielding a complexity measure that converges to spread complexity in the infinitesimal time-evolution limit. This perspective not only provides a physical interpretation of spread co"},"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":"2506.07257","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"hep-th","submitted_at":"2025-06-08T19:04:42Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"980ca1a5abb5313b308250f67acc7eeff29db93e2481211978a926ddfb0bb8cd","abstract_canon_sha256":"e26eecaf6a016f4e39037b3cdc295bcd21a59286a6cd07140c04b6ba0248fed8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:10.634401Z","signature_b64":"+4WO71NPvlXovOiYKDgpzrcMUazgrhSPrzN3skc18L3uCPFJrVMKVbMg8zNokvENXZncB7KrVL9iJ15PJxT7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4be021d8cb83f032621f13982e14429b286559396c842e043961f68d09cd12f","last_reissued_at":"2026-05-20T00:04:10.633626Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:10.633626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Computational Perspective on Spread Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Cameron Beetar, Eric L Graef, Hendrik J R Van Zyl, Horatiu Nastase, Jeff Murugan","submitted_at":"2025-06-08T19:04:42Z","abstract_excerpt":"We establish a direct connection between spread complexity and quantum circuit complexity by demonstrating that spread complexity emerges as a limiting case of a circuit complexity framework built from two fundamental operations: time-evolution and superposition. Our approach leverages a computational setup where unitary gates and beam-splitting operations generate target states, with the minimal cost of synthesis yielding a complexity measure that converges to spread complexity in the infinitesimal time-evolution limit. This perspective not only provides a physical interpretation of spread co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07257","kind":"arxiv","version":3},"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/2506.07257/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":"2506.07257","created_at":"2026-05-20T00:04:10.633754+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.07257v3","created_at":"2026-05-20T00:04:10.633754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07257","created_at":"2026-05-20T00:04:10.633754+00:00"},{"alias_kind":"pith_short_12","alias_value":"6S7AEHMMXA7Q","created_at":"2026-05-20T00:04:10.633754+00:00"},{"alias_kind":"pith_short_16","alias_value":"6S7AEHMMXA7QGJRB","created_at":"2026-05-20T00:04:10.633754+00:00"},{"alias_kind":"pith_short_8","alias_value":"6S7AEHMM","created_at":"2026-05-20T00:04:10.633754+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/6S7AEHMMXA7QGJRB6E4YFYKEFG","json":"https://pith.science/pith/6S7AEHMMXA7QGJRB6E4YFYKEFG.json","graph_json":"https://pith.science/api/pith-number/6S7AEHMMXA7QGJRB6E4YFYKEFG/graph.json","events_json":"https://pith.science/api/pith-number/6S7AEHMMXA7QGJRB6E4YFYKEFG/events.json","paper":"https://pith.science/paper/6S7AEHMM"},"agent_actions":{"view_html":"https://pith.science/pith/6S7AEHMMXA7QGJRB6E4YFYKEFG","download_json":"https://pith.science/pith/6S7AEHMMXA7QGJRB6E4YFYKEFG.json","view_paper":"https://pith.science/paper/6S7AEHMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.07257&json=true","fetch_graph":"https://pith.science/api/pith-number/6S7AEHMMXA7QGJRB6E4YFYKEFG/graph.json","fetch_events":"https://pith.science/api/pith-number/6S7AEHMMXA7QGJRB6E4YFYKEFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6S7AEHMMXA7QGJRB6E4YFYKEFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6S7AEHMMXA7QGJRB6E4YFYKEFG/action/storage_attestation","attest_author":"https://pith.science/pith/6S7AEHMMXA7QGJRB6E4YFYKEFG/action/author_attestation","sign_citation":"https://pith.science/pith/6S7AEHMMXA7QGJRB6E4YFYKEFG/action/citation_signature","submit_replication":"https://pith.science/pith/6S7AEHMMXA7QGJRB6E4YFYKEFG/action/replication_record"}},"created_at":"2026-05-20T00:04:10.633754+00:00","updated_at":"2026-05-20T00:04:10.633754+00:00"}