{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TLZGKVV4HCOFLZO7FGA4MEQDZC","short_pith_number":"pith:TLZGKVV4","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"},"canonical_sha256":"9af26556bc389c55e5df2981c61203c88c1efe6789f2435d530b9b79bb5e33fc","source":{"kind":"arxiv","id":"1411.5729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5729","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5729v1","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5729","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"TLZGKVV4HCOF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TLZGKVV4HCOFLZO7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TLZGKVV4","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TLZGKVV4HCOFLZO7FGA4MEQDZC","target":"record","payload":{"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"},"canonical_sha256":"9af26556bc389c55e5df2981c61203c88c1efe6789f2435d530b9b79bb5e33fc","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"},"source_kind":"arxiv","source_id":"1411.5729","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmQ078nxd4LY3n2BhIdUclYr0kqNPMwpFvOCw9TiYgOQom654SmhVBAfC25sV8B3u+3KpxOAr/aN2Ijp2R0hDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:11:12.530067Z"},"content_sha256":"ac98114cfbce588c074abb17a774bc585f8ff43a76d1bc45026f0885ae387815","schema_version":"1.0","event_id":"sha256:ac98114cfbce588c074abb17a774bc585f8ff43a76d1bc45026f0885ae387815"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TLZGKVV4HCOFLZO7FGA4MEQDZC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIaba4YRJPkRiN8Vd7cM73UExtSfkCK8p9W28sNZ53pecxQZcbGyRFIQgg1iQek+6KADxOuagFndZWFgnOzvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:11:12.530696Z"},"content_sha256":"d30142e1288f9eca86668b5769cf8f726baef22d915b3c71c4bb50693a67db08","schema_version":"1.0","event_id":"sha256:d30142e1288f9eca86668b5769cf8f726baef22d915b3c71c4bb50693a67db08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/bundle.json","state_url":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T17:11:12Z","links":{"resolver":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC","bundle":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/bundle.json","state":"https://pith.science/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLZGKVV4HCOFLZO7FGA4MEQDZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TLZGKVV4HCOFLZO7FGA4MEQDZC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f8f90ea3f6c873cf024ccbbdd32788c14e26bb340dfe893b330f80244e381ff1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-21T00:21:03Z","title_canon_sha256":"dcfae4cc2643b2b3b485b3dd237a66a604fab3a19f8230716433d206ec2c59d7"},"schema_version":"1.0","source":{"id":"1411.5729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5729","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5729v1","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5729","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"TLZGKVV4HCOF","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TLZGKVV4HCOFLZO7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TLZGKVV4","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:d30142e1288f9eca86668b5769cf8f726baef22d915b3c71c4bb50693a67db08","target":"graph","created_at":"2026-05-18T02:33:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Andris Ambainis, Scott Aaronson","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-21T00:21:03Z","title":"Forrelation: A Problem that Optimally Separates Quantum from Classical Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5729","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ac98114cfbce588c074abb17a774bc585f8ff43a76d1bc45026f0885ae387815","target":"record","created_at":"2026-05-18T02:33:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f8f90ea3f6c873cf024ccbbdd32788c14e26bb340dfe893b330f80244e381ff1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-21T00:21:03Z","title_canon_sha256":"dcfae4cc2643b2b3b485b3dd237a66a604fab3a19f8230716433d206ec2c59d7"},"schema_version":"1.0","source":{"id":"1411.5729","kind":"arxiv","version":1}},"canonical_sha256":"9af26556bc389c55e5df2981c61203c88c1efe6789f2435d530b9b79bb5e33fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9af26556bc389c55e5df2981c61203c88c1efe6789f2435d530b9b79bb5e33fc","first_computed_at":"2026-05-18T02:33:07.217632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:07.217632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OI/mXB+qQ49ZG/jYGM2rRl5s8b5LFdfh/Ub/gTfL+MCAFfjpxQUE2sDqPywpxNalmKmbNhDOSD1Wr0OhrgSPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:07.218146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac98114cfbce588c074abb17a774bc585f8ff43a76d1bc45026f0885ae387815","sha256:d30142e1288f9eca86668b5769cf8f726baef22d915b3c71c4bb50693a67db08"],"state_sha256":"358e90e17c2c7c0b6d04c20c51608ad12fa82ea1a52f6a6cf10f11879e963985"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6XDePVijQY7Q6N74Vgr2Q3PGipG3ZF6OewZ1eDWmLF5osfct84Y28pHklM0uECwfdVw8SFFnCKWbi5tR55PAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:11:12.533600Z","bundle_sha256":"606f6cf73bfc72e675d1083f8d10e4b921747f98085fc0e184e406dced7184dd"}}