{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:N44CLGOKVFN6PNDIZK6DWMBH6W","short_pith_number":"pith:N44CLGOK","schema_version":"1.0","canonical_sha256":"6f382599caa95be7b468cabc3b3027f5ade0e45b6cc0e155eab60fb584987776","source":{"kind":"arxiv","id":"quant-ph/0002066","version":1},"attestation_state":"computed","paper":{"title":"Quantum lower bounds by quantum arguments","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2000-02-24T04:46:18Z","abstract_excerpt":"We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a superposition of inputs. If the algorithm works correctly, its state becomes entangled with the superposition over inputs. We bound the number of queries needed to achieve a sufficient entanglement and this implies a lower bound on the number of queries for the computation.\n  Using this method, we prove two new $\\Omega(\\sqrt{N})$ lower bounds on computing AND o"},"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/0002066","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-02-24T04:46:18Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f97a02ef4ed045e188fef3a0025dacc38c77d09a584a5b80d6cdc2e152096661","abstract_canon_sha256":"e672db60ed44a0b1f11ce7b1098b818837052196298013c14483852b675d389f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:26.765797Z","signature_b64":"QqRP45reHUFHNi+rvRsJPx/PZegq/6KqJ+8WRVQHRL8ROURiGbDUnOZlybT1aAgnh0Aw0NKLyvr9nzcBgnB7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f382599caa95be7b468cabc3b3027f5ade0e45b6cc0e155eab60fb584987776","last_reissued_at":"2026-07-04T14:45:26.765470Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:26.765470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum lower bounds by quantum arguments","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2000-02-24T04:46:18Z","abstract_excerpt":"We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a superposition of inputs. If the algorithm works correctly, its state becomes entangled with the superposition over inputs. We bound the number of queries needed to achieve a sufficient entanglement and this implies a lower bound on the number of queries for the computation.\n  Using this method, we prove two new $\\Omega(\\sqrt{N})$ lower bounds on computing AND o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0002066","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/0002066/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/0002066","created_at":"2026-07-04T14:45:26.765521+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0002066v1","created_at":"2026-07-04T14:45:26.765521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0002066","created_at":"2026-07-04T14:45:26.765521+00:00"},{"alias_kind":"pith_short_12","alias_value":"N44CLGOKVFN6","created_at":"2026-07-04T14:45:26.765521+00:00"},{"alias_kind":"pith_short_16","alias_value":"N44CLGOKVFN6PNDI","created_at":"2026-07-04T14:45:26.765521+00:00"},{"alias_kind":"pith_short_8","alias_value":"N44CLGOK","created_at":"2026-07-04T14:45:26.765521+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.25178","citing_title":"Pseudorandom Dynamics in the SYK Model and Cryptographic Censorship in JT Gravity","ref_index":57,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N44CLGOKVFN6PNDIZK6DWMBH6W","json":"https://pith.science/pith/N44CLGOKVFN6PNDIZK6DWMBH6W.json","graph_json":"https://pith.science/api/pith-number/N44CLGOKVFN6PNDIZK6DWMBH6W/graph.json","events_json":"https://pith.science/api/pith-number/N44CLGOKVFN6PNDIZK6DWMBH6W/events.json","paper":"https://pith.science/paper/N44CLGOK"},"agent_actions":{"view_html":"https://pith.science/pith/N44CLGOKVFN6PNDIZK6DWMBH6W","download_json":"https://pith.science/pith/N44CLGOKVFN6PNDIZK6DWMBH6W.json","view_paper":"https://pith.science/paper/N44CLGOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0002066&json=true","fetch_graph":"https://pith.science/api/pith-number/N44CLGOKVFN6PNDIZK6DWMBH6W/graph.json","fetch_events":"https://pith.science/api/pith-number/N44CLGOKVFN6PNDIZK6DWMBH6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N44CLGOKVFN6PNDIZK6DWMBH6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N44CLGOKVFN6PNDIZK6DWMBH6W/action/storage_attestation","attest_author":"https://pith.science/pith/N44CLGOKVFN6PNDIZK6DWMBH6W/action/author_attestation","sign_citation":"https://pith.science/pith/N44CLGOKVFN6PNDIZK6DWMBH6W/action/citation_signature","submit_replication":"https://pith.science/pith/N44CLGOKVFN6PNDIZK6DWMBH6W/action/replication_record"}},"created_at":"2026-07-04T14:45:26.765521+00:00","updated_at":"2026-07-04T14:45:26.765521+00:00"}