{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:ROGFFGLYIQHRGCOQP4V77B4LXW","short_pith_number":"pith:ROGFFGLY","schema_version":"1.0","canonical_sha256":"8b8c529978440f1309d07f2bff878bbd8e3703eabd4a6081b1b25a26492e3144","source":{"kind":"arxiv","id":"quant-ph/0609168","version":1},"attestation_state":"computed","paper":{"title":"Quantum search with variable times","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2006-09-21T21:38:29Z","abstract_excerpt":"Since Grover's seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items and we would like to find a marked item. We consider a new variant of this problem in which evaluating the i-th item may take a different number of time steps for different i.\n  Let t_i be the number of time steps required to evaluate the i-th item. If the numbers t_i are known in advance, we give an algorithm that solves the problem in O(\\sqrt{t_1^2+t_2^2+...+t_n^2}) steps. This is optimal, as we also show a matching lower bound. The case, when t_i are not"},"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/0609168","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-09-21T21:38:29Z","cross_cats_sorted":[],"title_canon_sha256":"50c3ac56e6e42be0f398493dcb226f8c04dbc2956a907a112ce851f2bd107e4f","abstract_canon_sha256":"23c46c3a66be06804cea90ea314c0ce7ef3abc76b71ac26751c858b52f2a0401"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:57:16.048616Z","signature_b64":"+Q8ksfUybRzfZmWyRd4Q6yDvSVq5fbUxIZUjJ7DrK3YlLroiRLkLBqfn3aQYV4o7Sie8AOuSHfJPjf/JcIerDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b8c529978440f1309d07f2bff878bbd8e3703eabd4a6081b1b25a26492e3144","last_reissued_at":"2026-07-04T14:57:16.048236Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:57:16.048236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum search with variable times","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2006-09-21T21:38:29Z","abstract_excerpt":"Since Grover's seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items and we would like to find a marked item. We consider a new variant of this problem in which evaluating the i-th item may take a different number of time steps for different i.\n  Let t_i be the number of time steps required to evaluate the i-th item. If the numbers t_i are known in advance, we give an algorithm that solves the problem in O(\\sqrt{t_1^2+t_2^2+...+t_n^2}) steps. This is optimal, as we also show a matching lower bound. The case, when t_i are not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0609168","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/quant-ph/0609168/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/0609168","created_at":"2026-07-04T14:57:16.048301+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0609168v1","created_at":"2026-07-04T14:57:16.048301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0609168","created_at":"2026-07-04T14:57:16.048301+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROGFFGLYIQHR","created_at":"2026-07-04T14:57:16.048301+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROGFFGLYIQHRGCOQ","created_at":"2026-07-04T14:57:16.048301+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROGFFGLY","created_at":"2026-07-04T14:57:16.048301+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/ROGFFGLYIQHRGCOQP4V77B4LXW","json":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW.json","graph_json":"https://pith.science/api/pith-number/ROGFFGLYIQHRGCOQP4V77B4LXW/graph.json","events_json":"https://pith.science/api/pith-number/ROGFFGLYIQHRGCOQP4V77B4LXW/events.json","paper":"https://pith.science/paper/ROGFFGLY"},"agent_actions":{"view_html":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW","download_json":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW.json","view_paper":"https://pith.science/paper/ROGFFGLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0609168&json=true","fetch_graph":"https://pith.science/api/pith-number/ROGFFGLYIQHRGCOQP4V77B4LXW/graph.json","fetch_events":"https://pith.science/api/pith-number/ROGFFGLYIQHRGCOQP4V77B4LXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/action/storage_attestation","attest_author":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/action/author_attestation","sign_citation":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/action/citation_signature","submit_replication":"https://pith.science/pith/ROGFFGLYIQHRGCOQP4V77B4LXW/action/replication_record"}},"created_at":"2026-07-04T14:57:16.048301+00:00","updated_at":"2026-07-04T14:57:16.048301+00:00"}