{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:R6TUII5BRDHQQ3OCQY7YGRDCBV","short_pith_number":"pith:R6TUII5B","schema_version":"1.0","canonical_sha256":"8fa74423a188cf086dc2863f8344620d61532140838105d4ce9488712e69b371","source":{"kind":"arxiv","id":"2507.20887","version":2},"attestation_state":"computed","paper":{"title":"Efficient LCU block encodings through Dicke states preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Filippo Della Chiara, Martina Nibbi, Roel Van Beeumen, Yizhi Shen","submitted_at":"2025-07-28T14:39:16Z","abstract_excerpt":"With the Quantum Singular Value Transformation (QSVT) emerging as a unifying framework for diverse quantum speedups, the efficient construction of block encodings -- their fundamental input model -- has become increasingly crucial. However, devising explicit block encoding circuits remains a significant challenge. A widely adopted strategy is the Linear Combination of Unitaries (LCU) method. While general, its practical utility is often limited by substantial gate overhead. To address this, we introduce the Fast One-Qubit-Controlled Select LCU (FOQCS-LCU), a compact LCU formulation that requir"},"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":"2507.20887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-28T14:39:16Z","cross_cats_sorted":[],"title_canon_sha256":"15757132437b92fc14333ac953b2c78dae1b0088ac498cf1442f9c523e6d7d11","abstract_canon_sha256":"10e8d8aa4f9b861c864938e756928b1344171520fc8b01413e112ea0413f2a1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:38.191391Z","signature_b64":"GEoxoZ0nZisLiKeh0yOToAEa94JHwoGsgWFlI5IWXKzQPUSV9xATPl7cYG1XC3z5i9Up8i5kLltaPOWiT6NFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fa74423a188cf086dc2863f8344620d61532140838105d4ce9488712e69b371","last_reissued_at":"2026-07-05T11:57:38.190907Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:38.190907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient LCU block encodings through Dicke states preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Filippo Della Chiara, Martina Nibbi, Roel Van Beeumen, Yizhi Shen","submitted_at":"2025-07-28T14:39:16Z","abstract_excerpt":"With the Quantum Singular Value Transformation (QSVT) emerging as a unifying framework for diverse quantum speedups, the efficient construction of block encodings -- their fundamental input model -- has become increasingly crucial. However, devising explicit block encoding circuits remains a significant challenge. A widely adopted strategy is the Linear Combination of Unitaries (LCU) method. While general, its practical utility is often limited by substantial gate overhead. To address this, we introduce the Fast One-Qubit-Controlled Select LCU (FOQCS-LCU), a compact LCU formulation that requir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20887","kind":"arxiv","version":2},"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/2507.20887/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":"2507.20887","created_at":"2026-07-05T11:57:38.190963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20887v2","created_at":"2026-07-05T11:57:38.190963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20887","created_at":"2026-07-05T11:57:38.190963+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6TUII5BRDHQ","created_at":"2026-07-05T11:57:38.190963+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6TUII5BRDHQQ3OC","created_at":"2026-07-05T11:57:38.190963+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6TUII5B","created_at":"2026-07-05T11:57:38.190963+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06557","citing_title":"Quantum Channel Polynomial Processing","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.27430","citing_title":"Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27430","citing_title":"Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2601.05740","citing_title":"TARE: Block Encoding Linear Combinations of Pauli Strings Without Ancilla State Preparation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19717","citing_title":"Qubit Routing for (Almost) Free","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18276","citing_title":"Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R6TUII5BRDHQQ3OCQY7YGRDCBV","json":"https://pith.science/pith/R6TUII5BRDHQQ3OCQY7YGRDCBV.json","graph_json":"https://pith.science/api/pith-number/R6TUII5BRDHQQ3OCQY7YGRDCBV/graph.json","events_json":"https://pith.science/api/pith-number/R6TUII5BRDHQQ3OCQY7YGRDCBV/events.json","paper":"https://pith.science/paper/R6TUII5B"},"agent_actions":{"view_html":"https://pith.science/pith/R6TUII5BRDHQQ3OCQY7YGRDCBV","download_json":"https://pith.science/pith/R6TUII5BRDHQQ3OCQY7YGRDCBV.json","view_paper":"https://pith.science/paper/R6TUII5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20887&json=true","fetch_graph":"https://pith.science/api/pith-number/R6TUII5BRDHQQ3OCQY7YGRDCBV/graph.json","fetch_events":"https://pith.science/api/pith-number/R6TUII5BRDHQQ3OCQY7YGRDCBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6TUII5BRDHQQ3OCQY7YGRDCBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6TUII5BRDHQQ3OCQY7YGRDCBV/action/storage_attestation","attest_author":"https://pith.science/pith/R6TUII5BRDHQQ3OCQY7YGRDCBV/action/author_attestation","sign_citation":"https://pith.science/pith/R6TUII5BRDHQQ3OCQY7YGRDCBV/action/citation_signature","submit_replication":"https://pith.science/pith/R6TUII5BRDHQQ3OCQY7YGRDCBV/action/replication_record"}},"created_at":"2026-07-05T11:57:38.190963+00:00","updated_at":"2026-07-05T11:57:38.190963+00:00"}