{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RQWLLZCEWZU7HNT3PZYKJMIQO3","short_pith_number":"pith:RQWLLZCE","schema_version":"1.0","canonical_sha256":"8c2cb5e444b669f3b67b7e70a4b11076fe6e39684da96c4dece98c30cde0f2c7","source":{"kind":"arxiv","id":"2404.16129","version":1},"attestation_state":"computed","paper":{"title":"Efficiently constructing a quantum uniform superposition over bit strings near a binary linear code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edward Farhi, Stephen P. Jordan","submitted_at":"2024-04-24T18:37:15Z","abstract_excerpt":"We demonstrate that a high fidelity approximation to $| \\Psi_b \\rangle$, the quantum superposition over all bit strings within Hamming distance $b$ of the codewords of a dimension-$k$ linear code over $\\mathbb{Z}_2^n$, can be efficiently constructed by a quantum circuit for large values of $n$, $b$ and $k$ which we characterize. We do numerical experiments at $n=1000$ which back up our claims. The achievable radius $b$ is much larger than the distance out to which known classical algorithms can efficiently find the nearest codeword. Hence, these states cannot be prepared by quantum constuction"},"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":"2404.16129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-24T18:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"e7e025c57d19c1cc1702932c36259bf5ef458057e6327e811450336ea99f5f2b","abstract_canon_sha256":"8e14c5a37133faea2ea3989ebc740a85d91ba2e10b778d867043b7377852ed31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:01.616891Z","signature_b64":"YIqemk9SnynV11tCzWctcoKISX1u4JEtMkfN12BAoO0Gcqh3862yL5niOJkY66ZtZWeXg5RH04og7/WYYhLiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c2cb5e444b669f3b67b7e70a4b11076fe6e39684da96c4dece98c30cde0f2c7","last_reissued_at":"2026-07-05T08:12:01.616432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:01.616432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently constructing a quantum uniform superposition over bit strings near a binary linear code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edward Farhi, Stephen P. Jordan","submitted_at":"2024-04-24T18:37:15Z","abstract_excerpt":"We demonstrate that a high fidelity approximation to $| \\Psi_b \\rangle$, the quantum superposition over all bit strings within Hamming distance $b$ of the codewords of a dimension-$k$ linear code over $\\mathbb{Z}_2^n$, can be efficiently constructed by a quantum circuit for large values of $n$, $b$ and $k$ which we characterize. We do numerical experiments at $n=1000$ which back up our claims. The achievable radius $b$ is much larger than the distance out to which known classical algorithms can efficiently find the nearest codeword. Hence, these states cannot be prepared by quantum constuction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16129","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/2404.16129/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":"2404.16129","created_at":"2026-07-05T08:12:01.616489+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.16129v1","created_at":"2026-07-05T08:12:01.616489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16129","created_at":"2026-07-05T08:12:01.616489+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQWLLZCEWZU7","created_at":"2026-07-05T08:12:01.616489+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQWLLZCEWZU7HNT3","created_at":"2026-07-05T08:12:01.616489+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQWLLZCE","created_at":"2026-07-05T08:12:01.616489+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24633","citing_title":"Optimization Using Locally-Quantum Decoders","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQWLLZCEWZU7HNT3PZYKJMIQO3","json":"https://pith.science/pith/RQWLLZCEWZU7HNT3PZYKJMIQO3.json","graph_json":"https://pith.science/api/pith-number/RQWLLZCEWZU7HNT3PZYKJMIQO3/graph.json","events_json":"https://pith.science/api/pith-number/RQWLLZCEWZU7HNT3PZYKJMIQO3/events.json","paper":"https://pith.science/paper/RQWLLZCE"},"agent_actions":{"view_html":"https://pith.science/pith/RQWLLZCEWZU7HNT3PZYKJMIQO3","download_json":"https://pith.science/pith/RQWLLZCEWZU7HNT3PZYKJMIQO3.json","view_paper":"https://pith.science/paper/RQWLLZCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.16129&json=true","fetch_graph":"https://pith.science/api/pith-number/RQWLLZCEWZU7HNT3PZYKJMIQO3/graph.json","fetch_events":"https://pith.science/api/pith-number/RQWLLZCEWZU7HNT3PZYKJMIQO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQWLLZCEWZU7HNT3PZYKJMIQO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQWLLZCEWZU7HNT3PZYKJMIQO3/action/storage_attestation","attest_author":"https://pith.science/pith/RQWLLZCEWZU7HNT3PZYKJMIQO3/action/author_attestation","sign_citation":"https://pith.science/pith/RQWLLZCEWZU7HNT3PZYKJMIQO3/action/citation_signature","submit_replication":"https://pith.science/pith/RQWLLZCEWZU7HNT3PZYKJMIQO3/action/replication_record"}},"created_at":"2026-07-05T08:12:01.616489+00:00","updated_at":"2026-07-05T08:12:01.616489+00:00"}