{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:B4M3ZUSCWVDND3AFMXO2WICS7Y","short_pith_number":"pith:B4M3ZUSC","schema_version":"1.0","canonical_sha256":"0f19bcd242b546d1ec0565ddab2052fe2fa3f72f946a1ca09e43c40e20b27f96","source":{"kind":"arxiv","id":"2309.09331","version":2},"attestation_state":"computed","paper":{"title":"Efficiency of Feynman's quantum computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alex Gunning, Ralph Jason Costales, Tony Dorlas","submitted_at":"2023-09-17T17:33:30Z","abstract_excerpt":"Feynman's circuit-to-Hamiltonian construction enables the mapping of a quantum circuit to a time-independent Hamiltonian. This model introduces a Hilbert space made from an ancillary clock register tracking the progress of the computation. In this paper, we explore the efficiency, or run-time, of a quantum computer that directly implements the clock system. This relates to the model's probability of computation completion which we investigate at an established optimal time for an arbitrary number of gates $k$. The relationship between the run-time of the model and the number of gates is obtain"},"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":"2309.09331","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-17T17:33:30Z","cross_cats_sorted":[],"title_canon_sha256":"84ef1c38281a6e1d5d89de00c1d678fbc4a82ce4a41191735a83ef2f68e6c35f","abstract_canon_sha256":"f2fa244cca542f64ee48e5338c84641d8b3270c4878c5cc3a6bfaa0fabb53059"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:39.620132Z","signature_b64":"FjdgF7ZJJl6nNmOVRVFnzwQo9TWSjNfY3CfJsh60le1SYyuCmOJOi3slCA3qFnPXsDbbCGm7Z8OiRYmGxE9kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f19bcd242b546d1ec0565ddab2052fe2fa3f72f946a1ca09e43c40e20b27f96","last_reissued_at":"2026-07-05T10:03:39.619666Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:39.619666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiency of Feynman's quantum computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alex Gunning, Ralph Jason Costales, Tony Dorlas","submitted_at":"2023-09-17T17:33:30Z","abstract_excerpt":"Feynman's circuit-to-Hamiltonian construction enables the mapping of a quantum circuit to a time-independent Hamiltonian. This model introduces a Hilbert space made from an ancillary clock register tracking the progress of the computation. In this paper, we explore the efficiency, or run-time, of a quantum computer that directly implements the clock system. This relates to the model's probability of computation completion which we investigate at an established optimal time for an arbitrary number of gates $k$. The relationship between the run-time of the model and the number of gates is obtain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09331","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/2309.09331/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":"2309.09331","created_at":"2026-07-05T10:03:39.619728+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.09331v2","created_at":"2026-07-05T10:03:39.619728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09331","created_at":"2026-07-05T10:03:39.619728+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4M3ZUSCWVDN","created_at":"2026-07-05T10:03:39.619728+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4M3ZUSCWVDND3AF","created_at":"2026-07-05T10:03:39.619728+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4M3ZUSC","created_at":"2026-07-05T10:03:39.619728+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06752","citing_title":"Feynman's clock and hierarchy-informed sampling for quantum error mitigation","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B4M3ZUSCWVDND3AFMXO2WICS7Y","json":"https://pith.science/pith/B4M3ZUSCWVDND3AFMXO2WICS7Y.json","graph_json":"https://pith.science/api/pith-number/B4M3ZUSCWVDND3AFMXO2WICS7Y/graph.json","events_json":"https://pith.science/api/pith-number/B4M3ZUSCWVDND3AFMXO2WICS7Y/events.json","paper":"https://pith.science/paper/B4M3ZUSC"},"agent_actions":{"view_html":"https://pith.science/pith/B4M3ZUSCWVDND3AFMXO2WICS7Y","download_json":"https://pith.science/pith/B4M3ZUSCWVDND3AFMXO2WICS7Y.json","view_paper":"https://pith.science/paper/B4M3ZUSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.09331&json=true","fetch_graph":"https://pith.science/api/pith-number/B4M3ZUSCWVDND3AFMXO2WICS7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/B4M3ZUSCWVDND3AFMXO2WICS7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4M3ZUSCWVDND3AFMXO2WICS7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4M3ZUSCWVDND3AFMXO2WICS7Y/action/storage_attestation","attest_author":"https://pith.science/pith/B4M3ZUSCWVDND3AFMXO2WICS7Y/action/author_attestation","sign_citation":"https://pith.science/pith/B4M3ZUSCWVDND3AFMXO2WICS7Y/action/citation_signature","submit_replication":"https://pith.science/pith/B4M3ZUSCWVDND3AFMXO2WICS7Y/action/replication_record"}},"created_at":"2026-07-05T10:03:39.619728+00:00","updated_at":"2026-07-05T10:03:39.619728+00:00"}