{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7JAT3MB5L26Z5WDHRL3ZJF2ROR","short_pith_number":"pith:7JAT3MB5","schema_version":"1.0","canonical_sha256":"fa413db03d5ebd9ed8678af79497517466c76cbd925233a8ba306a90f593e878","source":{"kind":"arxiv","id":"2605.16195","version":1},"attestation_state":"computed","paper":{"title":"Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic W. Berry, Rolando D. Somma, Sophia Simon","submitted_at":"2026-05-15T17:11:07Z","abstract_excerpt":"We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity $\\widetilde{\\mathcal{O}}(\\nu \\mathcal{L} t/\\epsilon)$, where the constant $\\nu$ depends on the problem parameters, $\\mathcal{L}$ involves a time integral of upper bounds on the norms of evolution operators, and $\\epsilon$ is the error. In particular, $\\nu \\mathcal{L}$ is linear in $t$ for unitary dynamics"},"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":"2605.16195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-15T17:11:07Z","cross_cats_sorted":[],"title_canon_sha256":"d24cee47ba4f09e5d58491a72b736ec4f79c0e0c2fdf61d8a88979512441fd7f","abstract_canon_sha256":"52fa40615c2f414c5a4ac5b482f114aec70bdbd9de30746308cc92ff176b0194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:57.436044Z","signature_b64":"b4O8cZMACVPWNCmIArrA5LSwzc8eViPEmq/KoABdOfv68hWNMEZbpewPYUKxI7DUmtDho9ZJ+2LX2ZSOQDpMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa413db03d5ebd9ed8678af79497517466c76cbd925233a8ba306a90f593e878","last_reissued_at":"2026-05-20T00:01:57.435097Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:57.435097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic W. Berry, Rolando D. Somma, Sophia Simon","submitted_at":"2026-05-15T17:11:07Z","abstract_excerpt":"We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity $\\widetilde{\\mathcal{O}}(\\nu \\mathcal{L} t/\\epsilon)$, where the constant $\\nu$ depends on the problem parameters, $\\mathcal{L}$ involves a time integral of upper bounds on the norms of evolution operators, and $\\epsilon$ is the error. In particular, $\\nu \\mathcal{L}$ is linear in $t$ for unitary dynamics"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16195","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/2605.16195/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T17:51:56.330069Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T17:49:46.780952Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:29.740719Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T17:31:39.128255Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.408472Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"93542896a15939816b28b7f5f19588bd9c9e3adf508ee14806f0b0051ce4da83"},"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":"2605.16195","created_at":"2026-05-20T00:01:57.435216+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16195v1","created_at":"2026-05-20T00:01:57.435216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16195","created_at":"2026-05-20T00:01:57.435216+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JAT3MB5L26Z","created_at":"2026-05-20T00:01:57.435216+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JAT3MB5L26Z5WDH","created_at":"2026-05-20T00:01:57.435216+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JAT3MB5","created_at":"2026-05-20T00:01:57.435216+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19054","citing_title":"Quantum Koopman Algorithms","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7JAT3MB5L26Z5WDHRL3ZJF2ROR","json":"https://pith.science/pith/7JAT3MB5L26Z5WDHRL3ZJF2ROR.json","graph_json":"https://pith.science/api/pith-number/7JAT3MB5L26Z5WDHRL3ZJF2ROR/graph.json","events_json":"https://pith.science/api/pith-number/7JAT3MB5L26Z5WDHRL3ZJF2ROR/events.json","paper":"https://pith.science/paper/7JAT3MB5"},"agent_actions":{"view_html":"https://pith.science/pith/7JAT3MB5L26Z5WDHRL3ZJF2ROR","download_json":"https://pith.science/pith/7JAT3MB5L26Z5WDHRL3ZJF2ROR.json","view_paper":"https://pith.science/paper/7JAT3MB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16195&json=true","fetch_graph":"https://pith.science/api/pith-number/7JAT3MB5L26Z5WDHRL3ZJF2ROR/graph.json","fetch_events":"https://pith.science/api/pith-number/7JAT3MB5L26Z5WDHRL3ZJF2ROR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JAT3MB5L26Z5WDHRL3ZJF2ROR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JAT3MB5L26Z5WDHRL3ZJF2ROR/action/storage_attestation","attest_author":"https://pith.science/pith/7JAT3MB5L26Z5WDHRL3ZJF2ROR/action/author_attestation","sign_citation":"https://pith.science/pith/7JAT3MB5L26Z5WDHRL3ZJF2ROR/action/citation_signature","submit_replication":"https://pith.science/pith/7JAT3MB5L26Z5WDHRL3ZJF2ROR/action/replication_record"}},"created_at":"2026-05-20T00:01:57.435216+00:00","updated_at":"2026-05-20T00:01:57.435216+00:00"}