{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:X6BIMKXB4KLWJFFD3VAWSYM44A","short_pith_number":"pith:X6BIMKXB","schema_version":"1.0","canonical_sha256":"bf82862ae1e2976494a3dd4169619ce004fd02496d31185a20f5a4f6c30bd49d","source":{"kind":"arxiv","id":"2508.02822","version":2},"attestation_state":"computed","paper":{"title":"Quantum algorithm for linear matrix equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic W. Berry, Guang Hao Low, Rolando D. Somma, Ryan Babbush","submitted_at":"2025-08-04T18:45:05Z","abstract_excerpt":"We describe an efficient quantum algorithm for solving the linear matrix equation AX+XB=C, where A, B, and C are given complex matrices and X is unknown. This is known as the Sylvester equation, a fundamental equation with applications in control theory and physics. Our approach constructs the solution matrix X/x in a block-encoding, where x is a rescaling factor needed for normalization. This allows us to obtain certain properties of the entries of X exponentially faster than would be possible from preparing X as a quantum state. The query and gate complexities of the quantum circuit that imp"},"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":"2508.02822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-04T18:45:05Z","cross_cats_sorted":[],"title_canon_sha256":"9e9eb6c795f42c3af5120732038938a2b953845963ab4243de5b24d4122cf629","abstract_canon_sha256":"42e218a7c8eef791cd5a97c78e36c57152ce530842ea37ec0b5aec0607839f62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:00.357813Z","signature_b64":"dbNth2I5Yr8ybmzu+2gl8nZzw0pToN/WuW7kIVpgA+2oClek9A0NkTkWf8x4Gxqp1UL79mFxiPbTzU/ZwI8FBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf82862ae1e2976494a3dd4169619ce004fd02496d31185a20f5a4f6c30bd49d","last_reissued_at":"2026-07-05T11:57:00.357153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:00.357153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithm for linear matrix equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic W. Berry, Guang Hao Low, Rolando D. Somma, Ryan Babbush","submitted_at":"2025-08-04T18:45:05Z","abstract_excerpt":"We describe an efficient quantum algorithm for solving the linear matrix equation AX+XB=C, where A, B, and C are given complex matrices and X is unknown. This is known as the Sylvester equation, a fundamental equation with applications in control theory and physics. Our approach constructs the solution matrix X/x in a block-encoding, where x is a rescaling factor needed for normalization. This allows us to obtain certain properties of the entries of X exponentially faster than would be possible from preparing X as a quantum state. The query and gate complexities of the quantum circuit that imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02822","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/2508.02822/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":"2508.02822","created_at":"2026-07-05T11:57:00.357242+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.02822v2","created_at":"2026-07-05T11:57:00.357242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02822","created_at":"2026-07-05T11:57:00.357242+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6BIMKXB4KLW","created_at":"2026-07-05T11:57:00.357242+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6BIMKXB4KLWJFFD","created_at":"2026-07-05T11:57:00.357242+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6BIMKXB","created_at":"2026-07-05T11:57:00.357242+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24899","citing_title":"From Meta Idea to Advanced Mathematical Discovery -- Human-AI Co-Discovery of Sign-Embedding Quantum Algorithms","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16195","citing_title":"Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16195","citing_title":"Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems","ref_index":96,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19054","citing_title":"Quantum Koopman Algorithms","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2508.04689","citing_title":"Probabilistic quantum algorithm for Lyapunov equations and matrix inversion","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25333","citing_title":"Sign Embedding Quantum Algorithms for Matrix Equations and Matrix Functions","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07639","citing_title":"Exponential quantum advantage in processing massive classical data","ref_index":177,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18276","citing_title":"Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6BIMKXB4KLWJFFD3VAWSYM44A","json":"https://pith.science/pith/X6BIMKXB4KLWJFFD3VAWSYM44A.json","graph_json":"https://pith.science/api/pith-number/X6BIMKXB4KLWJFFD3VAWSYM44A/graph.json","events_json":"https://pith.science/api/pith-number/X6BIMKXB4KLWJFFD3VAWSYM44A/events.json","paper":"https://pith.science/paper/X6BIMKXB"},"agent_actions":{"view_html":"https://pith.science/pith/X6BIMKXB4KLWJFFD3VAWSYM44A","download_json":"https://pith.science/pith/X6BIMKXB4KLWJFFD3VAWSYM44A.json","view_paper":"https://pith.science/paper/X6BIMKXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.02822&json=true","fetch_graph":"https://pith.science/api/pith-number/X6BIMKXB4KLWJFFD3VAWSYM44A/graph.json","fetch_events":"https://pith.science/api/pith-number/X6BIMKXB4KLWJFFD3VAWSYM44A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6BIMKXB4KLWJFFD3VAWSYM44A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6BIMKXB4KLWJFFD3VAWSYM44A/action/storage_attestation","attest_author":"https://pith.science/pith/X6BIMKXB4KLWJFFD3VAWSYM44A/action/author_attestation","sign_citation":"https://pith.science/pith/X6BIMKXB4KLWJFFD3VAWSYM44A/action/citation_signature","submit_replication":"https://pith.science/pith/X6BIMKXB4KLWJFFD3VAWSYM44A/action/replication_record"}},"created_at":"2026-07-05T11:57:00.357242+00:00","updated_at":"2026-07-05T11:57:00.357242+00:00"}