{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EG3IP4I2ELLGVJPN6BY6GOECJ6","short_pith_number":"pith:EG3IP4I2","schema_version":"1.0","canonical_sha256":"21b687f11a22d66aa5edf071e338824fba7a1f7ecdba772d2b1e8d7ad862fdcb","source":{"kind":"arxiv","id":"1211.4637","version":2},"attestation_state":"computed","paper":{"title":"Gate-efficient discrete simulations of continuous-time quantum query algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic W. Berry, Richard Cleve, Sevag Gharibian","submitted_at":"2012-11-20T00:31:07Z","abstract_excerpt":"We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of computing the driving Hamiltonian. This permits any continuous-time quantum algorithm based on an efficiently computable driving Hamiltonian to be converted into a gate-efficient algorithm with similar run"},"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":"1211.4637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-20T00:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"e64eeca49b57f5c1d92b6e2fa1d8893aec75d014d1acb7910f52db3327ad07d6","abstract_canon_sha256":"aaf637ae006bf5c10f9304af05aa0eef90e85825d3d9ce9e866630d83ba644cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:59.123939Z","signature_b64":"SEzVkYtUw8u1ww3DiSTuMICovSxMupFgXXrW7vx5hLERzdQAgi18krHEpZa/S8mY1Ntrt2UiOO/oauthRMTeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b687f11a22d66aa5edf071e338824fba7a1f7ecdba772d2b1e8d7ad862fdcb","last_reissued_at":"2026-05-18T03:00:59.123209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:59.123209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gate-efficient discrete simulations of continuous-time quantum query algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic W. Berry, Richard Cleve, Sevag Gharibian","submitted_at":"2012-11-20T00:31:07Z","abstract_excerpt":"We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of computing the driving Hamiltonian. This permits any continuous-time quantum algorithm based on an efficiently computable driving Hamiltonian to be converted into a gate-efficient algorithm with similar run"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4637","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":""},"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":"1211.4637","created_at":"2026-05-18T03:00:59.123350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.4637v2","created_at":"2026-05-18T03:00:59.123350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4637","created_at":"2026-05-18T03:00:59.123350+00:00"},{"alias_kind":"pith_short_12","alias_value":"EG3IP4I2ELLG","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EG3IP4I2ELLGVJPN","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EG3IP4I2","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.10425","citing_title":"Quantum algorithms based on quantum trajectories","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6","json":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6.json","graph_json":"https://pith.science/api/pith-number/EG3IP4I2ELLGVJPN6BY6GOECJ6/graph.json","events_json":"https://pith.science/api/pith-number/EG3IP4I2ELLGVJPN6BY6GOECJ6/events.json","paper":"https://pith.science/paper/EG3IP4I2"},"agent_actions":{"view_html":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6","download_json":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6.json","view_paper":"https://pith.science/paper/EG3IP4I2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.4637&json=true","fetch_graph":"https://pith.science/api/pith-number/EG3IP4I2ELLGVJPN6BY6GOECJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/EG3IP4I2ELLGVJPN6BY6GOECJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/action/storage_attestation","attest_author":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/action/author_attestation","sign_citation":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/action/citation_signature","submit_replication":"https://pith.science/pith/EG3IP4I2ELLGVJPN6BY6GOECJ6/action/replication_record"}},"created_at":"2026-05-18T03:00:59.123350+00:00","updated_at":"2026-05-18T03:00:59.123350+00:00"}