{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FF2UJSN5RBWSDTMG572HOLEPIB","short_pith_number":"pith:FF2UJSN5","schema_version":"1.0","canonical_sha256":"297544c9bd886d21cd86eff4772c8f407d8ed297e40be3dd903a830de06f94ea","source":{"kind":"arxiv","id":"1612.09512","version":3},"attestation_state":"computed","paper":{"title":"Efficient Quantum Algorithms for Simulating Lindblad Evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chunhao Wang, Richard Cleve","submitted_at":"2016-12-30T15:57:09Z","abstract_excerpt":"We consider the natural generalization of the Schr\\\"{o}dinger equation to Markovian open system dynamics: the so-called the Lindblad equation. We give a quantum algorithm for simulating the evolution of an $n$-qubit system for time $t$ within precision $\\epsilon$. If the Lindbladian consists of $\\mathrm{poly}(n)$ operators that can each be expressed as a linear combination of $\\mathrm{poly}(n)$ tensor products of Pauli operators then the gate cost of our algorithm is $O(t\\, \\mathrm{polylog}(t/\\epsilon)\\mathrm{poly}(n))$. We also obtain similar bounds for the cases where the Lindbladian consist"},"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":"1612.09512","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-30T15:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"166a513f5522936b3044ab13ef18e89c8df51f598f9016360f911ae0b77da2ef","abstract_canon_sha256":"515abcde210885aecce74154943e4a414c2338bc85d0daff0c263a60c537ae89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:58.897874Z","signature_b64":"8qeb9oFQ5BdrRGt2Whr8UhAQYce6WVV6TSRELb/0fW44mMEL6HBZgGH5CuKp0O+5jxNbKINuuvB93uwuL07dBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297544c9bd886d21cd86eff4772c8f407d8ed297e40be3dd903a830de06f94ea","last_reissued_at":"2026-05-17T23:56:58.897203Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:58.897203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Quantum Algorithms for Simulating Lindblad Evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chunhao Wang, Richard Cleve","submitted_at":"2016-12-30T15:57:09Z","abstract_excerpt":"We consider the natural generalization of the Schr\\\"{o}dinger equation to Markovian open system dynamics: the so-called the Lindblad equation. We give a quantum algorithm for simulating the evolution of an $n$-qubit system for time $t$ within precision $\\epsilon$. If the Lindbladian consists of $\\mathrm{poly}(n)$ operators that can each be expressed as a linear combination of $\\mathrm{poly}(n)$ tensor products of Pauli operators then the gate cost of our algorithm is $O(t\\, \\mathrm{polylog}(t/\\epsilon)\\mathrm{poly}(n))$. We also obtain similar bounds for the cases where the Lindbladian consist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09512","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":""},"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":"1612.09512","created_at":"2026-05-17T23:56:58.897307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.09512v3","created_at":"2026-05-17T23:56:58.897307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09512","created_at":"2026-05-17T23:56:58.897307+00:00"},{"alias_kind":"pith_short_12","alias_value":"FF2UJSN5RBWS","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FF2UJSN5RBWSDTMG","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FF2UJSN5","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.16195","citing_title":"Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2509.10425","citing_title":"Quantum algorithms based on quantum trajectories","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2509.03586","citing_title":"Quantum simulation of out-of-equilibrium dynamics in gauge theories","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18533","citing_title":"Hamiltonian dynamics from pure dissipation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19973","citing_title":"Dissipative microcanonical ensemble preparation from KMS-detailed balance","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FF2UJSN5RBWSDTMG572HOLEPIB","json":"https://pith.science/pith/FF2UJSN5RBWSDTMG572HOLEPIB.json","graph_json":"https://pith.science/api/pith-number/FF2UJSN5RBWSDTMG572HOLEPIB/graph.json","events_json":"https://pith.science/api/pith-number/FF2UJSN5RBWSDTMG572HOLEPIB/events.json","paper":"https://pith.science/paper/FF2UJSN5"},"agent_actions":{"view_html":"https://pith.science/pith/FF2UJSN5RBWSDTMG572HOLEPIB","download_json":"https://pith.science/pith/FF2UJSN5RBWSDTMG572HOLEPIB.json","view_paper":"https://pith.science/paper/FF2UJSN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.09512&json=true","fetch_graph":"https://pith.science/api/pith-number/FF2UJSN5RBWSDTMG572HOLEPIB/graph.json","fetch_events":"https://pith.science/api/pith-number/FF2UJSN5RBWSDTMG572HOLEPIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FF2UJSN5RBWSDTMG572HOLEPIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FF2UJSN5RBWSDTMG572HOLEPIB/action/storage_attestation","attest_author":"https://pith.science/pith/FF2UJSN5RBWSDTMG572HOLEPIB/action/author_attestation","sign_citation":"https://pith.science/pith/FF2UJSN5RBWSDTMG572HOLEPIB/action/citation_signature","submit_replication":"https://pith.science/pith/FF2UJSN5RBWSDTMG572HOLEPIB/action/replication_record"}},"created_at":"2026-05-17T23:56:58.897307+00:00","updated_at":"2026-05-17T23:56:58.897307+00:00"}