{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BGUXFRELYEXBXJPTY5SACVO6SR","short_pith_number":"pith:BGUXFREL","schema_version":"1.0","canonical_sha256":"09a972c48bc12e1ba5f3c7640155de944e799b183ca5f6661fe21ec378987622","source":{"kind":"arxiv","id":"2405.20408","version":3},"attestation_state":"computed","paper":{"title":"Quantum encoder for fixed Hamming-weight subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giancarlo Camilo, Leandro Aolita, Renato M. S. Farias, Ruge Lin, Sergi Ramos-Calderer, Thiago O. Maciel","submitted_at":"2024-05-30T18:26:41Z","abstract_excerpt":"We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex-valued data vectors of $d=\\binom{n}{k}$ components into a subspace of fixed Hamming weight $k$. This represents a polynomial space compression of degree $k$. The circuit is optimal in that it expresses an arbitrary data vector using only $d-1$ (controlled) Reconfigurable Beam Splitter (RBS) gates and is constructed by an efficient classical algorithm that sequentially generates all bitstrings of weight $k$ and identifies the gates that superpose the corresponding states with the correct amplitudes. An expli"},"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":"2405.20408","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-30T18:26:41Z","cross_cats_sorted":[],"title_canon_sha256":"eed78e015f3f3e4c9e7063e477bd0e76bfcfb7519112f6522ae0ece9131eb6c2","abstract_canon_sha256":"b3f30185e838b3d1447f6a89df1efb86731a0f2069d8ca98e9cb0fb5254da9a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:37.615121Z","signature_b64":"L7OwmQw77+KPu41GVeR8PZohtDx6Q3DaLWMTzQ2uzpzgbpj80ya4DQ2WxrCAnT11bms0V9pvYIpFfMVoF55uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09a972c48bc12e1ba5f3c7640155de944e799b183ca5f6661fe21ec378987622","last_reissued_at":"2026-07-05T10:44:37.614614Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:37.614614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum encoder for fixed Hamming-weight subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giancarlo Camilo, Leandro Aolita, Renato M. S. Farias, Ruge Lin, Sergi Ramos-Calderer, Thiago O. Maciel","submitted_at":"2024-05-30T18:26:41Z","abstract_excerpt":"We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex-valued data vectors of $d=\\binom{n}{k}$ components into a subspace of fixed Hamming weight $k$. This represents a polynomial space compression of degree $k$. The circuit is optimal in that it expresses an arbitrary data vector using only $d-1$ (controlled) Reconfigurable Beam Splitter (RBS) gates and is constructed by an efficient classical algorithm that sequentially generates all bitstrings of weight $k$ and identifies the gates that superpose the corresponding states with the correct amplitudes. An expli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20408","kind":"arxiv","version":3},"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/2405.20408/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":"2405.20408","created_at":"2026-07-05T10:44:37.614673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.20408v3","created_at":"2026-07-05T10:44:37.614673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20408","created_at":"2026-07-05T10:44:37.614673+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGUXFRELYEXB","created_at":"2026-07-05T10:44:37.614673+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGUXFRELYEXBXJPT","created_at":"2026-07-05T10:44:37.614673+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGUXFREL","created_at":"2026-07-05T10:44:37.614673+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BGUXFRELYEXBXJPTY5SACVO6SR","json":"https://pith.science/pith/BGUXFRELYEXBXJPTY5SACVO6SR.json","graph_json":"https://pith.science/api/pith-number/BGUXFRELYEXBXJPTY5SACVO6SR/graph.json","events_json":"https://pith.science/api/pith-number/BGUXFRELYEXBXJPTY5SACVO6SR/events.json","paper":"https://pith.science/paper/BGUXFREL"},"agent_actions":{"view_html":"https://pith.science/pith/BGUXFRELYEXBXJPTY5SACVO6SR","download_json":"https://pith.science/pith/BGUXFRELYEXBXJPTY5SACVO6SR.json","view_paper":"https://pith.science/paper/BGUXFREL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.20408&json=true","fetch_graph":"https://pith.science/api/pith-number/BGUXFRELYEXBXJPTY5SACVO6SR/graph.json","fetch_events":"https://pith.science/api/pith-number/BGUXFRELYEXBXJPTY5SACVO6SR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGUXFRELYEXBXJPTY5SACVO6SR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGUXFRELYEXBXJPTY5SACVO6SR/action/storage_attestation","attest_author":"https://pith.science/pith/BGUXFRELYEXBXJPTY5SACVO6SR/action/author_attestation","sign_citation":"https://pith.science/pith/BGUXFRELYEXBXJPTY5SACVO6SR/action/citation_signature","submit_replication":"https://pith.science/pith/BGUXFRELYEXBXJPTY5SACVO6SR/action/replication_record"}},"created_at":"2026-07-05T10:44:37.614673+00:00","updated_at":"2026-07-05T10:44:37.614673+00:00"}