{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3MNOROC7JYE5OXGKS3E7AXDOPE","short_pith_number":"pith:3MNOROC7","schema_version":"1.0","canonical_sha256":"db1ae8b85f4e09d75cca96c9f05c6e79338ac5cf83a8f15e1418958c0902bf27","source":{"kind":"arxiv","id":"1712.07395","version":2},"attestation_state":"computed","paper":{"title":"The Feynman-Kitaev computer's clock: bias, gaps, idling and pulse tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj, Libor Caha, Zeph Landau","submitted_at":"2017-12-20T10:21:42Z","abstract_excerpt":"We present a collection of results about the clock in Feynman's computer construction and Kitaev's Local Hamiltonian problem. First, by analyzing the spectra of quantum walks on a line with varying endpoint terms, we find a better lower bound on the gap of the Feynman Hamiltonian, which translates into a less strict promise gap requirement for the QMA-complete Local Hamiltonian problem. We also translate this result into the language of adiabatic quantum computation. Second, introducing an idling clock construction with a large state space but fast Cesaro mixing, we provide a way for achieving"},"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":"1712.07395","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-20T10:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"17fb6ec5291d6ae7de97a902f33cc602683a55fceaab9a128352b542f0c205f4","abstract_canon_sha256":"f85e741e9d88964e22153a4f25db79b0384fda1e31d5db660b776bc3af378f7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:32.326070Z","signature_b64":"vU0dtYOD88XAB2fFR/Gkx4W7mVq2+ajqfhHfrLR1AASuRvU2fVHM8h5AkWnMCRT5/znrUMXDwOTsL/boVJCUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db1ae8b85f4e09d75cca96c9f05c6e79338ac5cf83a8f15e1418958c0902bf27","last_reissued_at":"2026-05-18T00:11:32.325428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:32.325428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Feynman-Kitaev computer's clock: bias, gaps, idling and pulse tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj, Libor Caha, Zeph Landau","submitted_at":"2017-12-20T10:21:42Z","abstract_excerpt":"We present a collection of results about the clock in Feynman's computer construction and Kitaev's Local Hamiltonian problem. First, by analyzing the spectra of quantum walks on a line with varying endpoint terms, we find a better lower bound on the gap of the Feynman Hamiltonian, which translates into a less strict promise gap requirement for the QMA-complete Local Hamiltonian problem. We also translate this result into the language of adiabatic quantum computation. Second, introducing an idling clock construction with a large state space but fast Cesaro mixing, we provide a way for achieving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07395","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":"1712.07395","created_at":"2026-05-18T00:11:32.325521+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07395v2","created_at":"2026-05-18T00:11:32.325521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07395","created_at":"2026-05-18T00:11:32.325521+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MNOROC7JYE5","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MNOROC7JYE5OXGK","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MNOROC7","created_at":"2026-05-18T12:30:58.224056+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/3MNOROC7JYE5OXGKS3E7AXDOPE","json":"https://pith.science/pith/3MNOROC7JYE5OXGKS3E7AXDOPE.json","graph_json":"https://pith.science/api/pith-number/3MNOROC7JYE5OXGKS3E7AXDOPE/graph.json","events_json":"https://pith.science/api/pith-number/3MNOROC7JYE5OXGKS3E7AXDOPE/events.json","paper":"https://pith.science/paper/3MNOROC7"},"agent_actions":{"view_html":"https://pith.science/pith/3MNOROC7JYE5OXGKS3E7AXDOPE","download_json":"https://pith.science/pith/3MNOROC7JYE5OXGKS3E7AXDOPE.json","view_paper":"https://pith.science/paper/3MNOROC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07395&json=true","fetch_graph":"https://pith.science/api/pith-number/3MNOROC7JYE5OXGKS3E7AXDOPE/graph.json","fetch_events":"https://pith.science/api/pith-number/3MNOROC7JYE5OXGKS3E7AXDOPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MNOROC7JYE5OXGKS3E7AXDOPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MNOROC7JYE5OXGKS3E7AXDOPE/action/storage_attestation","attest_author":"https://pith.science/pith/3MNOROC7JYE5OXGKS3E7AXDOPE/action/author_attestation","sign_citation":"https://pith.science/pith/3MNOROC7JYE5OXGKS3E7AXDOPE/action/citation_signature","submit_replication":"https://pith.science/pith/3MNOROC7JYE5OXGKS3E7AXDOPE/action/replication_record"}},"created_at":"2026-05-18T00:11:32.325521+00:00","updated_at":"2026-05-18T00:11:32.325521+00:00"}