{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:272RO7VL2KOUETPUA5AWJA4YBH","short_pith_number":"pith:272RO7VL","schema_version":"1.0","canonical_sha256":"d7f5177eabd29d424df4074164839809fb7c98d32277a1dc254d21d74ffac3e7","source":{"kind":"arxiv","id":"2603.19130","version":2},"attestation_state":"computed","paper":{"title":"Quantum block encoding for one-pair semiseparable matrices","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.NA","math.QA"],"primary_cat":"quant-ph","authors_text":"Giacomo Antonioli, Gianna M. Del Corso, Margherita Porcelli, Paola Boito","submitted_at":"2026-03-19T16:49:13Z","abstract_excerpt":"Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE has mostly focused on sparse matrices; less effort has been devoted to data-sparse (e.g., rank-structured) matrices.\n  In this work we examine a particular case of rank structure, namely, one-pair semiseparable matrices. We present a new block encoding approach that relies on a suitable factorization of the given matrix as the product of triangular and diag"},"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":"2603.19130","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-19T16:49:13Z","cross_cats_sorted":["cs.NA","math.NA","math.QA"],"title_canon_sha256":"4319d3fc96bde8dbbcfd7c8f9154b90c84dea067adc0307b40640a6b06de67eb","abstract_canon_sha256":"64758a8383df23e84a237dcad3b024330645cc691a35bc5333e42903d21b8e79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:18.687025Z","signature_b64":"LRnRZEEtRo8V2NP6s4Y7/GjnHpZtc3DX6WiAEhAd1NpdSbbdKaQbnOjVimHo3KTKYhKmpgirjCzvx/w3llZwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7f5177eabd29d424df4074164839809fb7c98d32277a1dc254d21d74ffac3e7","last_reissued_at":"2026-06-30T02:17:18.686230Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:18.686230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum block encoding for one-pair semiseparable matrices","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.NA","math.QA"],"primary_cat":"quant-ph","authors_text":"Giacomo Antonioli, Gianna M. Del Corso, Margherita Porcelli, Paola Boito","submitted_at":"2026-03-19T16:49:13Z","abstract_excerpt":"Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE has mostly focused on sparse matrices; less effort has been devoted to data-sparse (e.g., rank-structured) matrices.\n  In this work we examine a particular case of rank structure, namely, one-pair semiseparable matrices. We present a new block encoding approach that relies on a suitable factorization of the given matrix as the product of triangular and diag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.19130","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/2603.19130/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":"2603.19130","created_at":"2026-06-30T02:17:18.686354+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.19130v2","created_at":"2026-06-30T02:17:18.686354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.19130","created_at":"2026-06-30T02:17:18.686354+00:00"},{"alias_kind":"pith_short_12","alias_value":"272RO7VL2KOU","created_at":"2026-06-30T02:17:18.686354+00:00"},{"alias_kind":"pith_short_16","alias_value":"272RO7VL2KOUETPU","created_at":"2026-06-30T02:17:18.686354+00:00"},{"alias_kind":"pith_short_8","alias_value":"272RO7VL","created_at":"2026-06-30T02:17:18.686354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.25825","citing_title":"A Quantum Spectral Framework for Solving PDEs","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/272RO7VL2KOUETPUA5AWJA4YBH","json":"https://pith.science/pith/272RO7VL2KOUETPUA5AWJA4YBH.json","graph_json":"https://pith.science/api/pith-number/272RO7VL2KOUETPUA5AWJA4YBH/graph.json","events_json":"https://pith.science/api/pith-number/272RO7VL2KOUETPUA5AWJA4YBH/events.json","paper":"https://pith.science/paper/272RO7VL"},"agent_actions":{"view_html":"https://pith.science/pith/272RO7VL2KOUETPUA5AWJA4YBH","download_json":"https://pith.science/pith/272RO7VL2KOUETPUA5AWJA4YBH.json","view_paper":"https://pith.science/paper/272RO7VL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.19130&json=true","fetch_graph":"https://pith.science/api/pith-number/272RO7VL2KOUETPUA5AWJA4YBH/graph.json","fetch_events":"https://pith.science/api/pith-number/272RO7VL2KOUETPUA5AWJA4YBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/272RO7VL2KOUETPUA5AWJA4YBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/272RO7VL2KOUETPUA5AWJA4YBH/action/storage_attestation","attest_author":"https://pith.science/pith/272RO7VL2KOUETPUA5AWJA4YBH/action/author_attestation","sign_citation":"https://pith.science/pith/272RO7VL2KOUETPUA5AWJA4YBH/action/citation_signature","submit_replication":"https://pith.science/pith/272RO7VL2KOUETPUA5AWJA4YBH/action/replication_record"}},"created_at":"2026-06-30T02:17:18.686354+00:00","updated_at":"2026-06-30T02:17:18.686354+00:00"}