{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:24MAQFVTOCWGLFR3W5ZKNBSIFY","short_pith_number":"pith:24MAQFVT","schema_version":"1.0","canonical_sha256":"d7180816b370ac65963bb772a686482e226542f681a9bda6d4269f013139e55a","source":{"kind":"arxiv","id":"2509.25345","version":2},"attestation_state":"computed","paper":{"title":"Fast quantum computation with all-to-all Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Chao Yin","submitted_at":"2025-09-29T18:02:00Z","abstract_excerpt":"All-to-all interactions arise naturally in many areas of theoretical physics and across diverse experimental quantum platforms, motivating a systematic study of their information-processing power. Assuming each pair of qubits interacts with $\\mathrm{O}(1)$ strength, programmable time-dependent all-to-all Hamiltonians can simulate arbitrary all-to-all quantum circuits, performing quantum computation in time proportional to the circuit depth. We show that this naive correspondence is far from optimal: all-to-all Hamiltonians can process information on much shorter timescales.\n  First, we prove t"},"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":"2509.25345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-09-29T18:02:00Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"725069849f411cd38bb0291aa0c4aa3c174f1665527be9b62ec91e1164cc7f46","abstract_canon_sha256":"99f8df8266f1bf295ff6afc2fc79b70fcc380c4971f759f99322c3f57b531229"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T03:18:49.468565Z","signature_b64":"PGVtkCQ0KLjWGMqg7Iz1lNYMr4Xg1EutJUZ8mTQrVFlCr8pD90hggt0WSKqRTYb6iSQ0gw4B0wdpW/LiJRSnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7180816b370ac65963bb772a686482e226542f681a9bda6d4269f013139e55a","last_reissued_at":"2026-07-07T03:18:49.468044Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T03:18:49.468044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast quantum computation with all-to-all Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Chao Yin","submitted_at":"2025-09-29T18:02:00Z","abstract_excerpt":"All-to-all interactions arise naturally in many areas of theoretical physics and across diverse experimental quantum platforms, motivating a systematic study of their information-processing power. Assuming each pair of qubits interacts with $\\mathrm{O}(1)$ strength, programmable time-dependent all-to-all Hamiltonians can simulate arbitrary all-to-all quantum circuits, performing quantum computation in time proportional to the circuit depth. We show that this naive correspondence is far from optimal: all-to-all Hamiltonians can process information on much shorter timescales.\n  First, we prove t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.25345","kind":"arxiv","version":2},"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/2509.25345/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":"2509.25345","created_at":"2026-07-07T03:18:49.468101+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.25345v2","created_at":"2026-07-07T03:18:49.468101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.25345","created_at":"2026-07-07T03:18:49.468101+00:00"},{"alias_kind":"pith_short_12","alias_value":"24MAQFVTOCWG","created_at":"2026-07-07T03:18:49.468101+00:00"},{"alias_kind":"pith_short_16","alias_value":"24MAQFVTOCWGLFR3","created_at":"2026-07-07T03:18:49.468101+00:00"},{"alias_kind":"pith_short_8","alias_value":"24MAQFVT","created_at":"2026-07-07T03:18:49.468101+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/24MAQFVTOCWGLFR3W5ZKNBSIFY","json":"https://pith.science/pith/24MAQFVTOCWGLFR3W5ZKNBSIFY.json","graph_json":"https://pith.science/api/pith-number/24MAQFVTOCWGLFR3W5ZKNBSIFY/graph.json","events_json":"https://pith.science/api/pith-number/24MAQFVTOCWGLFR3W5ZKNBSIFY/events.json","paper":"https://pith.science/paper/24MAQFVT"},"agent_actions":{"view_html":"https://pith.science/pith/24MAQFVTOCWGLFR3W5ZKNBSIFY","download_json":"https://pith.science/pith/24MAQFVTOCWGLFR3W5ZKNBSIFY.json","view_paper":"https://pith.science/paper/24MAQFVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.25345&json=true","fetch_graph":"https://pith.science/api/pith-number/24MAQFVTOCWGLFR3W5ZKNBSIFY/graph.json","fetch_events":"https://pith.science/api/pith-number/24MAQFVTOCWGLFR3W5ZKNBSIFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24MAQFVTOCWGLFR3W5ZKNBSIFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24MAQFVTOCWGLFR3W5ZKNBSIFY/action/storage_attestation","attest_author":"https://pith.science/pith/24MAQFVTOCWGLFR3W5ZKNBSIFY/action/author_attestation","sign_citation":"https://pith.science/pith/24MAQFVTOCWGLFR3W5ZKNBSIFY/action/citation_signature","submit_replication":"https://pith.science/pith/24MAQFVTOCWGLFR3W5ZKNBSIFY/action/replication_record"}},"created_at":"2026-07-07T03:18:49.468101+00:00","updated_at":"2026-07-07T03:18:49.468101+00:00"}