{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YDOEMORUI6LZZYXINDNNWIHC2D","short_pith_number":"pith:YDOEMORU","schema_version":"1.0","canonical_sha256":"c0dc463a3447979ce2e868dadb20e2d0de0af84d84a71550a82375c0e0065b45","source":{"kind":"arxiv","id":"1706.07646","version":3},"attestation_state":"computed","paper":{"title":"Exact Equivalence between Quantum Adiabatic Algorithm and Quantum Circuit Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Biao Wu, Hongye Yu, Yuliang Huang","submitted_at":"2017-06-23T11:48:58Z","abstract_excerpt":"We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of $L$ gates we can construct a quantum adiabatic algorithm with time complexity of $O(L)$. Additionally, our construction shows that one may exponentially speed up some quantum adiabatic algorithms by properly choosing an evolution path."},"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":"1706.07646","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-06-23T11:48:58Z","cross_cats_sorted":[],"title_canon_sha256":"e32ee5b02284db0bc9a6134dd631a6b31b1f1378390f225f1dd3c6b5655d0d5d","abstract_canon_sha256":"a374498cefd2f4df66986e0b3cf23a0dea6c05827fa4b322510c843749daa6a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:36.357903Z","signature_b64":"k7QLT7P6+MmS9TVIQv0g/grJO/5zzKzKfhS0xbfY/EkvJaxv6ZOCciEqooOBNfwoqGuO7WmCwfn1p7W/b04JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0dc463a3447979ce2e868dadb20e2d0de0af84d84a71550a82375c0e0065b45","last_reissued_at":"2026-05-18T00:02:36.357179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:36.357179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Equivalence between Quantum Adiabatic Algorithm and Quantum Circuit Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Biao Wu, Hongye Yu, Yuliang Huang","submitted_at":"2017-06-23T11:48:58Z","abstract_excerpt":"We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of $L$ gates we can construct a quantum adiabatic algorithm with time complexity of $O(L)$. Additionally, our construction shows that one may exponentially speed up some quantum adiabatic algorithms by properly choosing an evolution path."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07646","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":""},"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":"1706.07646","created_at":"2026-05-18T00:02:36.357297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07646v3","created_at":"2026-05-18T00:02:36.357297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07646","created_at":"2026-05-18T00:02:36.357297+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDOEMORUI6LZ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDOEMORUI6LZZYXI","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDOEMORU","created_at":"2026-05-18T12:31:56.362134+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/YDOEMORUI6LZZYXINDNNWIHC2D","json":"https://pith.science/pith/YDOEMORUI6LZZYXINDNNWIHC2D.json","graph_json":"https://pith.science/api/pith-number/YDOEMORUI6LZZYXINDNNWIHC2D/graph.json","events_json":"https://pith.science/api/pith-number/YDOEMORUI6LZZYXINDNNWIHC2D/events.json","paper":"https://pith.science/paper/YDOEMORU"},"agent_actions":{"view_html":"https://pith.science/pith/YDOEMORUI6LZZYXINDNNWIHC2D","download_json":"https://pith.science/pith/YDOEMORUI6LZZYXINDNNWIHC2D.json","view_paper":"https://pith.science/paper/YDOEMORU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07646&json=true","fetch_graph":"https://pith.science/api/pith-number/YDOEMORUI6LZZYXINDNNWIHC2D/graph.json","fetch_events":"https://pith.science/api/pith-number/YDOEMORUI6LZZYXINDNNWIHC2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDOEMORUI6LZZYXINDNNWIHC2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDOEMORUI6LZZYXINDNNWIHC2D/action/storage_attestation","attest_author":"https://pith.science/pith/YDOEMORUI6LZZYXINDNNWIHC2D/action/author_attestation","sign_citation":"https://pith.science/pith/YDOEMORUI6LZZYXINDNNWIHC2D/action/citation_signature","submit_replication":"https://pith.science/pith/YDOEMORUI6LZZYXINDNNWIHC2D/action/replication_record"}},"created_at":"2026-05-18T00:02:36.357297+00:00","updated_at":"2026-05-18T00:02:36.357297+00:00"}