{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:T5SDEJYYHUD3VXMX6VP4WVZSJO","short_pith_number":"pith:T5SDEJYY","schema_version":"1.0","canonical_sha256":"9f643227183d07badd97f55fcb57324b9bd6691ca5d35c8b281184faa0c587f0","source":{"kind":"arxiv","id":"2606.28452","version":1},"attestation_state":"computed","paper":{"title":"Beyond Worst-Case Branching: Quantum Tree Search via Amplitude Amplification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Wichert","submitted_at":"2026-06-26T09:41:42Z","abstract_excerpt":"In this work, we investigate quantum tree search via amplitude amplification. Amplitude amplification generalizes Grover's algorithm by replacing the Hadamard initialization with an arbitrary unitary $A$, with Grover's algorithm recovered as the special case of uniform initialization. We demonstrate the construction of a dynamic search tree of depth $m$ with query complexity $\\sqrt{\\left(b_{avg}\\right)^m}$ where $b_{avg}$ denotes the average branching factor, improving upon the commonly assumed $\\sqrt{\\left(b_{max}\\right)^m}$, where $b_{max}$ is the maximum branching factor. We further challen"},"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":"2606.28452","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-26T09:41:42Z","cross_cats_sorted":[],"title_canon_sha256":"be3c7d269e487db3a2cd16e7aec0c6912e69ea681f6fa8578cec56ad1c590038","abstract_canon_sha256":"9c464df1ecb4f9b17d5ba76cd5656791dfbdc37b7bf80a00ffa0eb3d9be698f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T00:15:14.631936Z","signature_b64":"SkFisbj47BdIk/h2YQCWGa+FYoH8WI+BqlZkSeismn1U+OOYXeNmob2oWddBJ9itSD6nte6zGykSkxIpfJyTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f643227183d07badd97f55fcb57324b9bd6691ca5d35c8b281184faa0c587f0","last_reissued_at":"2026-06-30T00:15:14.631522Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T00:15:14.631522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Worst-Case Branching: Quantum Tree Search via Amplitude Amplification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Wichert","submitted_at":"2026-06-26T09:41:42Z","abstract_excerpt":"In this work, we investigate quantum tree search via amplitude amplification. Amplitude amplification generalizes Grover's algorithm by replacing the Hadamard initialization with an arbitrary unitary $A$, with Grover's algorithm recovered as the special case of uniform initialization. We demonstrate the construction of a dynamic search tree of depth $m$ with query complexity $\\sqrt{\\left(b_{avg}\\right)^m}$ where $b_{avg}$ denotes the average branching factor, improving upon the commonly assumed $\\sqrt{\\left(b_{max}\\right)^m}$, where $b_{max}$ is the maximum branching factor. We further challen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28452","kind":"arxiv","version":1},"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/2606.28452/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":"2606.28452","created_at":"2026-06-30T00:15:14.631581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28452v1","created_at":"2026-06-30T00:15:14.631581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28452","created_at":"2026-06-30T00:15:14.631581+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5SDEJYYHUD3","created_at":"2026-06-30T00:15:14.631581+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5SDEJYYHUD3VXMX","created_at":"2026-06-30T00:15:14.631581+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5SDEJYY","created_at":"2026-06-30T00:15:14.631581+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/T5SDEJYYHUD3VXMX6VP4WVZSJO","json":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO.json","graph_json":"https://pith.science/api/pith-number/T5SDEJYYHUD3VXMX6VP4WVZSJO/graph.json","events_json":"https://pith.science/api/pith-number/T5SDEJYYHUD3VXMX6VP4WVZSJO/events.json","paper":"https://pith.science/paper/T5SDEJYY"},"agent_actions":{"view_html":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO","download_json":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO.json","view_paper":"https://pith.science/paper/T5SDEJYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28452&json=true","fetch_graph":"https://pith.science/api/pith-number/T5SDEJYYHUD3VXMX6VP4WVZSJO/graph.json","fetch_events":"https://pith.science/api/pith-number/T5SDEJYYHUD3VXMX6VP4WVZSJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/action/storage_attestation","attest_author":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/action/author_attestation","sign_citation":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/action/citation_signature","submit_replication":"https://pith.science/pith/T5SDEJYYHUD3VXMX6VP4WVZSJO/action/replication_record"}},"created_at":"2026-06-30T00:15:14.631581+00:00","updated_at":"2026-06-30T00:15:14.631581+00:00"}