{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:4V2N5U7PSDBV7XGQCSW467EOC7","short_pith_number":"pith:4V2N5U7P","schema_version":"1.0","canonical_sha256":"e574ded3ef90c35fdcd014adcf7c8e17fec2b05abfa57ebb69ac6ccd31d1b5fa","source":{"kind":"arxiv","id":"quant-ph/9706062","version":2},"attestation_state":"computed","paper":{"title":"Quantum Computation and Decision Trees","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edward Farhi (MIT), Sam Gutmann (Northeastern)","submitted_at":"1997-06-27T18:47:34Z","abstract_excerpt":"Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root. We devise a quantum mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy succeeds in reaching level n in time polynomial in n, then so does the quantum algorithm. Moreover, we find examples of trees for which the classical algorithm requires time exponential in n, but for which"},"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":"quant-ph/9706062","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-06-27T18:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"f8915ae84e1622e2b27ee2966f5e2c1534ad7d90990938cd1ba38d232c20143c","abstract_canon_sha256":"a888606d3b8809479bd66bfe17b0ea6c645c3469866950aa51a7adf33fca0808"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:06:30.144809Z","signature_b64":"MSPfyxXEdqQf3Wsprrt+E6ECYJAwJMBagbT+FJ/c7nIJeMAayaa2Fz5yHyuYfycp7VwjN2mK7p6Wl5iJkF4cAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e574ded3ef90c35fdcd014adcf7c8e17fec2b05abfa57ebb69ac6ccd31d1b5fa","last_reissued_at":"2026-07-04T16:06:30.144430Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:06:30.144430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Computation and Decision Trees","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edward Farhi (MIT), Sam Gutmann (Northeastern)","submitted_at":"1997-06-27T18:47:34Z","abstract_excerpt":"Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root. We devise a quantum mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy succeeds in reaching level n in time polynomial in n, then so does the quantum algorithm. Moreover, we find examples of trees for which the classical algorithm requires time exponential in n, but for which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9706062","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/quant-ph/9706062/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":"quant-ph/9706062","created_at":"2026-07-04T16:06:30.144490+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9706062v2","created_at":"2026-07-04T16:06:30.144490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9706062","created_at":"2026-07-04T16:06:30.144490+00:00"},{"alias_kind":"pith_short_12","alias_value":"4V2N5U7PSDBV","created_at":"2026-07-04T16:06:30.144490+00:00"},{"alias_kind":"pith_short_16","alias_value":"4V2N5U7PSDBV7XGQ","created_at":"2026-07-04T16:06:30.144490+00:00"},{"alias_kind":"pith_short_8","alias_value":"4V2N5U7P","created_at":"2026-07-04T16:06:30.144490+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1411.4028","citing_title":"A Quantum Approximate Optimization Algorithm","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4V2N5U7PSDBV7XGQCSW467EOC7","json":"https://pith.science/pith/4V2N5U7PSDBV7XGQCSW467EOC7.json","graph_json":"https://pith.science/api/pith-number/4V2N5U7PSDBV7XGQCSW467EOC7/graph.json","events_json":"https://pith.science/api/pith-number/4V2N5U7PSDBV7XGQCSW467EOC7/events.json","paper":"https://pith.science/paper/4V2N5U7P"},"agent_actions":{"view_html":"https://pith.science/pith/4V2N5U7PSDBV7XGQCSW467EOC7","download_json":"https://pith.science/pith/4V2N5U7PSDBV7XGQCSW467EOC7.json","view_paper":"https://pith.science/paper/4V2N5U7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9706062&json=true","fetch_graph":"https://pith.science/api/pith-number/4V2N5U7PSDBV7XGQCSW467EOC7/graph.json","fetch_events":"https://pith.science/api/pith-number/4V2N5U7PSDBV7XGQCSW467EOC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4V2N5U7PSDBV7XGQCSW467EOC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4V2N5U7PSDBV7XGQCSW467EOC7/action/storage_attestation","attest_author":"https://pith.science/pith/4V2N5U7PSDBV7XGQCSW467EOC7/action/author_attestation","sign_citation":"https://pith.science/pith/4V2N5U7PSDBV7XGQCSW467EOC7/action/citation_signature","submit_replication":"https://pith.science/pith/4V2N5U7PSDBV7XGQCSW467EOC7/action/replication_record"}},"created_at":"2026-07-04T16:06:30.144490+00:00","updated_at":"2026-07-04T16:06:30.144490+00:00"}