{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TLZGKVV4HCOFLZO7FGA4MEQDZC","short_pith_number":"pith:TLZGKVV4","schema_version":"1.0","canonical_sha256":"9af26556bc389c55e5df2981c61203c88c1efe6789f2435d530b9b79bb5e33fc","source":{"kind":"arxiv","id":"1411.5729","version":1},"attestation_state":"computed","paper":{"title":"Forrelation: A Problem that Optimally Separates Quantum from Classical Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Scott Aaronson","submitted_at":"2014-11-21T00:21:03Z","abstract_excerpt":"We achieve essentially the largest possible separation between quantum and classical query complexities. We do so using a property-testing problem called Forrelation, where one needs to decide whether one Boolean function is highly correlated with the Fourier transform of a second function. This problem can be solved using 1 quantum query, yet we show that any randomized algorithm needs ~sqrt(N)/log(N) queries (improving an ~N^{1/4} lower bound of Aaronson). Conversely, we show that this 1 versus ~sqrt(N) separation is optimal: indeed, any t-query quantum algorithm whatsoever can be simulated "},"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":"1411.5729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-21T00:21:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"dcfae4cc2643b2b3b485b3dd237a66a604fab3a19f8230716433d206ec2c59d7","abstract_canon_sha256":"f8f90ea3f6c873cf024ccbbdd32788c14e26bb340dfe893b330f80244e381ff1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:07.218146Z","signature_b64":"OI/mXB+qQ49ZG/jYGM2rRl5s8b5LFdfh/Ub/gTfL+MCAFfjpxQUE2sDqPywpxNalmKmbNhDOSD1Wr0OhrgSPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9af26556bc389c55e5df2981c61203c88c1efe6789f2435d530b9b79bb5e33fc","last_reissued_at":"2026-05-18T02:33:07.217632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:07.217632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forrelation: A Problem that Optimally Separates Quantum from Classical Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Scott Aaronson","submitted_at":"2014-11-21T00:21:03Z","abstract_excerpt":"We achieve essentially the largest possible separation between quantum and classical query complexities. We do so using a property-testing problem called Forrelation, where one needs to decide whether one Boolean function is highly correlated with the Fourier transform of a second function. This problem can be solved using 1 quantum query, yet we show that any randomized algorithm needs ~sqrt(N)/log(N) queries (improving an ~N^{1/4} lower bound of Aaronson). Conversely, we show that this 1 versus ~sqrt(N) separation is optimal: indeed, any t-query quantum algorithm whatsoever can be simulated "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5729","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":"1411.5729","created_at":"2026-05-18T02:33:07.217706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5729v1","created_at":"2026-05-18T02:33:07.217706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5729","created_at":"2026-05-18T02:33:07.217706+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLZGKVV4HCOF","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLZGKVV4HCOFLZO7","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLZGKVV4","created_at":"2026-05-18T12:28:49.207871+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/TLZGKVV4HCOFLZO7FGA4MEQDZC","json":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC.json","graph_json":"https://pith.science/api/pith-number/TLZGKVV4HCOFLZO7FGA4MEQDZC/graph.json","events_json":"https://pith.science/api/pith-number/TLZGKVV4HCOFLZO7FGA4MEQDZC/events.json","paper":"https://pith.science/paper/TLZGKVV4"},"agent_actions":{"view_html":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC","download_json":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC.json","view_paper":"https://pith.science/paper/TLZGKVV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5729&json=true","fetch_graph":"https://pith.science/api/pith-number/TLZGKVV4HCOFLZO7FGA4MEQDZC/graph.json","fetch_events":"https://pith.science/api/pith-number/TLZGKVV4HCOFLZO7FGA4MEQDZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/action/storage_attestation","attest_author":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/action/author_attestation","sign_citation":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/action/citation_signature","submit_replication":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/action/replication_record"}},"created_at":"2026-05-18T02:33:07.217706+00:00","updated_at":"2026-05-18T02:33:07.217706+00:00"}