{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WRLQAFKAFCSUOROOKBBTUJGH3T","short_pith_number":"pith:WRLQAFKA","schema_version":"1.0","canonical_sha256":"b45700154028a54745ce50433a24c7dce8f35265fa4585f19e9e9fd46fcb18ff","source":{"kind":"arxiv","id":"1701.06942","version":1},"attestation_state":"computed","paper":{"title":"Optimal one-shot quantum algorithm for EQUALITY and AND","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Janis Iraids","submitted_at":"2017-01-24T15:46:34Z","abstract_excerpt":"We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\\{0,1\\}\\to\\{0,1\\}$ on an input $x\\in\\{0,1\\}^n$ that can be accessed by querying the black box. Quantum algorithms are inherently probabilistic; we are interested in the lowest possible probability that the algorithm outputs incorrect answer (the error probability) for a fixed number of queries. We show that the lowest possible error probability for $AND_n$ and $EQUALITY_{n+1}$ is $1/2-n/(n^2+1)$."},"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":"1701.06942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-24T15:46:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f1629fa88458d5fc5cbcc180d1b6b8df2330939bd18aca8062a9644b1b23c772","abstract_canon_sha256":"963a235da5796fec4350b115ceb49a1f9086dd62083e4aae9db8d985495083a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:10.075372Z","signature_b64":"W38CY2KlQGtQpjj7qBfmfO3cJ5jxLcdv02xfxqWfp87SIH8n7WDywAkQR7lXT60WeNnMA72jeNcGjQSoZwQTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b45700154028a54745ce50433a24c7dce8f35265fa4585f19e9e9fd46fcb18ff","last_reissued_at":"2026-05-18T00:52:10.074835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:10.074835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal one-shot quantum algorithm for EQUALITY and AND","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Janis Iraids","submitted_at":"2017-01-24T15:46:34Z","abstract_excerpt":"We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\\{0,1\\}\\to\\{0,1\\}$ on an input $x\\in\\{0,1\\}^n$ that can be accessed by querying the black box. Quantum algorithms are inherently probabilistic; we are interested in the lowest possible probability that the algorithm outputs incorrect answer (the error probability) for a fixed number of queries. We show that the lowest possible error probability for $AND_n$ and $EQUALITY_{n+1}$ is $1/2-n/(n^2+1)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06942","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":""},"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":"1701.06942","created_at":"2026-05-18T00:52:10.074913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06942v1","created_at":"2026-05-18T00:52:10.074913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06942","created_at":"2026-05-18T00:52:10.074913+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRLQAFKAFCSU","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRLQAFKAFCSUOROO","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRLQAFKA","created_at":"2026-05-18T12:31:53.515858+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/WRLQAFKAFCSUOROOKBBTUJGH3T","json":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T.json","graph_json":"https://pith.science/api/pith-number/WRLQAFKAFCSUOROOKBBTUJGH3T/graph.json","events_json":"https://pith.science/api/pith-number/WRLQAFKAFCSUOROOKBBTUJGH3T/events.json","paper":"https://pith.science/paper/WRLQAFKA"},"agent_actions":{"view_html":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T","download_json":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T.json","view_paper":"https://pith.science/paper/WRLQAFKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06942&json=true","fetch_graph":"https://pith.science/api/pith-number/WRLQAFKAFCSUOROOKBBTUJGH3T/graph.json","fetch_events":"https://pith.science/api/pith-number/WRLQAFKAFCSUOROOKBBTUJGH3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/action/storage_attestation","attest_author":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/action/author_attestation","sign_citation":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/action/citation_signature","submit_replication":"https://pith.science/pith/WRLQAFKAFCSUOROOKBBTUJGH3T/action/replication_record"}},"created_at":"2026-05-18T00:52:10.074913+00:00","updated_at":"2026-05-18T00:52:10.074913+00:00"}