{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:V6TYIOKQEBZB2NIMYVK7DQZQND","short_pith_number":"pith:V6TYIOKQ","schema_version":"1.0","canonical_sha256":"afa784395020721d350cc555f1c33068e0e0ce7f38a10220d76e4f6c5355e131","source":{"kind":"arxiv","id":"2309.07881","version":3},"attestation_state":"computed","paper":{"title":"The cost of solving linear differential equations on a quantum computer: fast-forwarding to explicit resource counts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew T. Sornborger, David Jennings, Matteo Lostaglio, Robert B. Lowrie, Sam Pallister","submitted_at":"2023-09-14T17:25:43Z","abstract_excerpt":"How well can quantum computers simulate classical dynamical systems? There is increasing effort in developing quantum algorithms to efficiently simulate dynamics beyond Hamiltonian simulation, but so far exact resource estimates are not known. In this work, we provide two significant contributions. First, we give the first non-asymptotic computation of the cost of encoding the solution to general linear ordinary differential equations into quantum states -- either the solution at a final time, or an encoding of the whole history within a time interval. Second, we show that the stability proper"},"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":"2309.07881","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-14T17:25:43Z","cross_cats_sorted":[],"title_canon_sha256":"e95d288f50ac6a0afe6d4894005af5e832cbc0a57c4c37f153076290247c9ce9","abstract_canon_sha256":"f52a492648d6cbd257a043e2abb6567f011d4b6499d662cc2187127c23850efc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:42.987785Z","signature_b64":"1B6GM/j4tSRIp3ZWAvU68qCPgxCXjfz4I5N1SBHOw2dwBqaWnRn8dt3BBuO6hLGOkRNXmnAV/vc+bSABco09BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afa784395020721d350cc555f1c33068e0e0ce7f38a10220d76e4f6c5355e131","last_reissued_at":"2026-07-05T09:46:42.987237Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:42.987237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The cost of solving linear differential equations on a quantum computer: fast-forwarding to explicit resource counts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew T. Sornborger, David Jennings, Matteo Lostaglio, Robert B. Lowrie, Sam Pallister","submitted_at":"2023-09-14T17:25:43Z","abstract_excerpt":"How well can quantum computers simulate classical dynamical systems? There is increasing effort in developing quantum algorithms to efficiently simulate dynamics beyond Hamiltonian simulation, but so far exact resource estimates are not known. In this work, we provide two significant contributions. First, we give the first non-asymptotic computation of the cost of encoding the solution to general linear ordinary differential equations into quantum states -- either the solution at a final time, or an encoding of the whole history within a time interval. Second, we show that the stability proper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.07881","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/2309.07881/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":"2309.07881","created_at":"2026-07-05T09:46:42.987294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.07881v3","created_at":"2026-07-05T09:46:42.987294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.07881","created_at":"2026-07-05T09:46:42.987294+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6TYIOKQEBZB","created_at":"2026-07-05T09:46:42.987294+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6TYIOKQEBZB2NIM","created_at":"2026-07-05T09:46:42.987294+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6TYIOKQ","created_at":"2026-07-05T09:46:42.987294+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2412.15134","citing_title":"Use of Faulty States in Cat-Code Error Correction","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V6TYIOKQEBZB2NIMYVK7DQZQND","json":"https://pith.science/pith/V6TYIOKQEBZB2NIMYVK7DQZQND.json","graph_json":"https://pith.science/api/pith-number/V6TYIOKQEBZB2NIMYVK7DQZQND/graph.json","events_json":"https://pith.science/api/pith-number/V6TYIOKQEBZB2NIMYVK7DQZQND/events.json","paper":"https://pith.science/paper/V6TYIOKQ"},"agent_actions":{"view_html":"https://pith.science/pith/V6TYIOKQEBZB2NIMYVK7DQZQND","download_json":"https://pith.science/pith/V6TYIOKQEBZB2NIMYVK7DQZQND.json","view_paper":"https://pith.science/paper/V6TYIOKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.07881&json=true","fetch_graph":"https://pith.science/api/pith-number/V6TYIOKQEBZB2NIMYVK7DQZQND/graph.json","fetch_events":"https://pith.science/api/pith-number/V6TYIOKQEBZB2NIMYVK7DQZQND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6TYIOKQEBZB2NIMYVK7DQZQND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6TYIOKQEBZB2NIMYVK7DQZQND/action/storage_attestation","attest_author":"https://pith.science/pith/V6TYIOKQEBZB2NIMYVK7DQZQND/action/author_attestation","sign_citation":"https://pith.science/pith/V6TYIOKQEBZB2NIMYVK7DQZQND/action/citation_signature","submit_replication":"https://pith.science/pith/V6TYIOKQEBZB2NIMYVK7DQZQND/action/replication_record"}},"created_at":"2026-07-05T09:46:42.987294+00:00","updated_at":"2026-07-05T09:46:42.987294+00:00"}