{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:G7DGJ7ASMTV2QKTZM45AUDEZ22","short_pith_number":"pith:G7DGJ7AS","schema_version":"1.0","canonical_sha256":"37c664fc1264eba82a79673a0a0c99d6aaa1297b0b52a1d61ab7a2c8245af8ea","source":{"kind":"arxiv","id":"2310.01540","version":1},"attestation_state":"computed","paper":{"title":"On the power of geometrically-local classical and quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Kishor Bharti, Rahul Jain","submitted_at":"2023-10-02T18:27:53Z","abstract_excerpt":"We show a relation, based on parallel repetition of the Magic Square game, that can be solved, with probability exponentially close to $1$ (worst-case input), by $1D$ (uniform) depth $2$, geometrically-local, noisy (noise below a threshold), fan-in $4$, quantum circuits. We show that the same relation cannot be solved, with an exponentially small success probability (averaged over inputs drawn uniformly), by $1D$ (non-uniform) geometrically-local, sub-linear depth, classical circuits consisting of fan-in $2$ NAND gates. Quantum and classical circuits are allowed to use input-independent (geome"},"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":"2310.01540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-02T18:27:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7225ac4aa5504871c0b0f75a840b06060e1cbf32a50432416122c362626272f1","abstract_canon_sha256":"a685da6b28f12b1ebdc396c57a878da21547e02ccfbdbadf0d2dea418fb4c39a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:41.668012Z","signature_b64":"zC8BSQ+WRXqyWniJCYMijwbNNS/WfCDTg2OiUdnAx6zLHmqt2xd12N2h41hTl1o8REvyakR7lxL4XzDqTYXGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c664fc1264eba82a79673a0a0c99d6aaa1297b0b52a1d61ab7a2c8245af8ea","last_reissued_at":"2026-07-05T06:56:41.667511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:41.667511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the power of geometrically-local classical and quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Kishor Bharti, Rahul Jain","submitted_at":"2023-10-02T18:27:53Z","abstract_excerpt":"We show a relation, based on parallel repetition of the Magic Square game, that can be solved, with probability exponentially close to $1$ (worst-case input), by $1D$ (uniform) depth $2$, geometrically-local, noisy (noise below a threshold), fan-in $4$, quantum circuits. We show that the same relation cannot be solved, with an exponentially small success probability (averaged over inputs drawn uniformly), by $1D$ (non-uniform) geometrically-local, sub-linear depth, classical circuits consisting of fan-in $2$ NAND gates. Quantum and classical circuits are allowed to use input-independent (geome"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01540","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/2310.01540/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":"2310.01540","created_at":"2026-07-05T06:56:41.667577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.01540v1","created_at":"2026-07-05T06:56:41.667577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01540","created_at":"2026-07-05T06:56:41.667577+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7DGJ7ASMTV2","created_at":"2026-07-05T06:56:41.667577+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7DGJ7ASMTV2QKTZ","created_at":"2026-07-05T06:56:41.667577+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7DGJ7AS","created_at":"2026-07-05T06:56:41.667577+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.16457","citing_title":"Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26605","citing_title":"All pure entangled states can lead to fully nonlocal correlations","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G7DGJ7ASMTV2QKTZM45AUDEZ22","json":"https://pith.science/pith/G7DGJ7ASMTV2QKTZM45AUDEZ22.json","graph_json":"https://pith.science/api/pith-number/G7DGJ7ASMTV2QKTZM45AUDEZ22/graph.json","events_json":"https://pith.science/api/pith-number/G7DGJ7ASMTV2QKTZM45AUDEZ22/events.json","paper":"https://pith.science/paper/G7DGJ7AS"},"agent_actions":{"view_html":"https://pith.science/pith/G7DGJ7ASMTV2QKTZM45AUDEZ22","download_json":"https://pith.science/pith/G7DGJ7ASMTV2QKTZM45AUDEZ22.json","view_paper":"https://pith.science/paper/G7DGJ7AS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.01540&json=true","fetch_graph":"https://pith.science/api/pith-number/G7DGJ7ASMTV2QKTZM45AUDEZ22/graph.json","fetch_events":"https://pith.science/api/pith-number/G7DGJ7ASMTV2QKTZM45AUDEZ22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7DGJ7ASMTV2QKTZM45AUDEZ22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7DGJ7ASMTV2QKTZM45AUDEZ22/action/storage_attestation","attest_author":"https://pith.science/pith/G7DGJ7ASMTV2QKTZM45AUDEZ22/action/author_attestation","sign_citation":"https://pith.science/pith/G7DGJ7ASMTV2QKTZM45AUDEZ22/action/citation_signature","submit_replication":"https://pith.science/pith/G7DGJ7ASMTV2QKTZM45AUDEZ22/action/replication_record"}},"created_at":"2026-07-05T06:56:41.667577+00:00","updated_at":"2026-07-05T06:56:41.667577+00:00"}