{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PUCRFGK5OIGW7WQXV6P4FFADX3","short_pith_number":"pith:PUCRFGK5","schema_version":"1.0","canonical_sha256":"7d0512995d720d6fda17af9fc29403becd699262d987faf60e79273b9218786d","source":{"kind":"arxiv","id":"2302.06749","version":3},"attestation_state":"computed","paper":{"title":"Improved Algorithm and Lower Bound for Variable Time Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Jevg\\=enijs Vihrovs, Martins Kokainis","submitted_at":"2023-02-13T23:24:49Z","abstract_excerpt":"We study variable time search, a form of quantum search where queries to different items take different time. Our first result is a new quantum algorithm that performs variable time search with complexity $O(\\sqrt{T}\\log n)$ where $T=\\sum_{i=1}^n t_i^2$ with $t_i$ denoting the time to check the $i$-th item. Our second result is a quantum lower bound of $\\Omega(\\sqrt{T\\log T})$. Both the algorithm and the lower bound improve over previously known results by a factor of $\\sqrt{\\log T}$ but the algorithm is also substantially simpler than the previously known quantum algorithms."},"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":"2302.06749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-13T23:24:49Z","cross_cats_sorted":[],"title_canon_sha256":"861b8bfd08f2ea1426061dc565c1ef8b6b2397e4c71e264c6361a2eae471cc3e","abstract_canon_sha256":"4348f62d6c89765f69e19e243413433fe9be93a8fb25e164de7b6e1c1fd1aba8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:12.604533Z","signature_b64":"Q+V23A222rMnLNTJlFhOdpNgq38tS1pV89TUETX2ka0ylxtcw21MNfNhBxKIsRMne4Pisy+JASkO7bnyNOPrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d0512995d720d6fda17af9fc29403becd699262d987faf60e79273b9218786d","last_reissued_at":"2026-07-05T06:37:12.604088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:12.604088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithm and Lower Bound for Variable Time Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Jevg\\=enijs Vihrovs, Martins Kokainis","submitted_at":"2023-02-13T23:24:49Z","abstract_excerpt":"We study variable time search, a form of quantum search where queries to different items take different time. Our first result is a new quantum algorithm that performs variable time search with complexity $O(\\sqrt{T}\\log n)$ where $T=\\sum_{i=1}^n t_i^2$ with $t_i$ denoting the time to check the $i$-th item. Our second result is a quantum lower bound of $\\Omega(\\sqrt{T\\log T})$. Both the algorithm and the lower bound improve over previously known results by a factor of $\\sqrt{\\log T}$ but the algorithm is also substantially simpler than the previously known quantum algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06749","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.06749/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":"2302.06749","created_at":"2026-07-05T06:37:12.604146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06749v3","created_at":"2026-07-05T06:37:12.604146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06749","created_at":"2026-07-05T06:37:12.604146+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUCRFGK5OIGW","created_at":"2026-07-05T06:37:12.604146+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUCRFGK5OIGW7WQX","created_at":"2026-07-05T06:37:12.604146+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUCRFGK5","created_at":"2026-07-05T06:37:12.604146+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07691","citing_title":"Faster quantum linear system solver beyond the condition number","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3","json":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3.json","graph_json":"https://pith.science/api/pith-number/PUCRFGK5OIGW7WQXV6P4FFADX3/graph.json","events_json":"https://pith.science/api/pith-number/PUCRFGK5OIGW7WQXV6P4FFADX3/events.json","paper":"https://pith.science/paper/PUCRFGK5"},"agent_actions":{"view_html":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3","download_json":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3.json","view_paper":"https://pith.science/paper/PUCRFGK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06749&json=true","fetch_graph":"https://pith.science/api/pith-number/PUCRFGK5OIGW7WQXV6P4FFADX3/graph.json","fetch_events":"https://pith.science/api/pith-number/PUCRFGK5OIGW7WQXV6P4FFADX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/action/storage_attestation","attest_author":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/action/author_attestation","sign_citation":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/action/citation_signature","submit_replication":"https://pith.science/pith/PUCRFGK5OIGW7WQXV6P4FFADX3/action/replication_record"}},"created_at":"2026-07-05T06:37:12.604146+00:00","updated_at":"2026-07-05T06:37:12.604146+00:00"}