{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NIJSV7JHB2FOI5HFYHE2VZBS77","short_pith_number":"pith:NIJSV7JH","schema_version":"1.0","canonical_sha256":"6a132afd270e8ae474e5c1c9aae432ffd87032221702f858774b43712865d011","source":{"kind":"arxiv","id":"1312.1414","version":2},"attestation_state":"computed","paper":{"title":"Exponential improvement in precision for simulating sparse Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Dominic W. Berry, Richard Cleve, Robin Kothari, Rolando D. Somma","submitted_at":"2013-12-05T02:53:46Z","abstract_excerpt":"We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically, we show that a $d$-sparse Hamiltonian $H$ acting on $n$ qubits can be simulated for time $t$ with precision $\\epsilon$ using $O\\big(\\tau \\frac{\\log(\\tau/\\epsilon)}{\\log\\log(\\tau/\\epsilon)}\\big)$ queries and $O\\big(\\tau \\frac{\\log^2(\\tau/\\epsilon)}{\\log\\log(\\tau/\\epsilon)}n\\big)$ additional 2-qubit gates, where $\\tau = d^2 \\|{H}\\|_{\\max} t$. Unlike previous approaches based on product formulas, the "},"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":"1312.1414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-05T02:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"e22cde47fa6de30970d3da393590a5c4deb81aac37f6273ea25df18a5787a84c","abstract_canon_sha256":"53ba1b5e08e47514f3ca1b7159428555009560f68122bd626b33833c55a3b344"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:54.129381Z","signature_b64":"+g3gKyfg+vcOl7Nm3l5DkfxFy20DavBktaVkuD1+ZaM5LENbdI6bMlxAnkZkTTXv+MfmzZK7yI8zS0o7kTmCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a132afd270e8ae474e5c1c9aae432ffd87032221702f858774b43712865d011","last_reissued_at":"2026-05-18T02:40:54.128933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:54.128933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential improvement in precision for simulating sparse Hamiltonians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Dominic W. Berry, Richard Cleve, Robin Kothari, Rolando D. Somma","submitted_at":"2013-12-05T02:53:46Z","abstract_excerpt":"We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically, we show that a $d$-sparse Hamiltonian $H$ acting on $n$ qubits can be simulated for time $t$ with precision $\\epsilon$ using $O\\big(\\tau \\frac{\\log(\\tau/\\epsilon)}{\\log\\log(\\tau/\\epsilon)}\\big)$ queries and $O\\big(\\tau \\frac{\\log^2(\\tau/\\epsilon)}{\\log\\log(\\tau/\\epsilon)}n\\big)$ additional 2-qubit gates, where $\\tau = d^2 \\|{H}\\|_{\\max} t$. Unlike previous approaches based on product formulas, the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1414","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":""},"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":"1312.1414","created_at":"2026-05-18T02:40:54.128991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1414v2","created_at":"2026-05-18T02:40:54.128991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1414","created_at":"2026-05-18T02:40:54.128991+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIJSV7JHB2FO","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIJSV7JHB2FOI5HF","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIJSV7JH","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23670","citing_title":"Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NIJSV7JHB2FOI5HFYHE2VZBS77","json":"https://pith.science/pith/NIJSV7JHB2FOI5HFYHE2VZBS77.json","graph_json":"https://pith.science/api/pith-number/NIJSV7JHB2FOI5HFYHE2VZBS77/graph.json","events_json":"https://pith.science/api/pith-number/NIJSV7JHB2FOI5HFYHE2VZBS77/events.json","paper":"https://pith.science/paper/NIJSV7JH"},"agent_actions":{"view_html":"https://pith.science/pith/NIJSV7JHB2FOI5HFYHE2VZBS77","download_json":"https://pith.science/pith/NIJSV7JHB2FOI5HFYHE2VZBS77.json","view_paper":"https://pith.science/paper/NIJSV7JH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1414&json=true","fetch_graph":"https://pith.science/api/pith-number/NIJSV7JHB2FOI5HFYHE2VZBS77/graph.json","fetch_events":"https://pith.science/api/pith-number/NIJSV7JHB2FOI5HFYHE2VZBS77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIJSV7JHB2FOI5HFYHE2VZBS77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIJSV7JHB2FOI5HFYHE2VZBS77/action/storage_attestation","attest_author":"https://pith.science/pith/NIJSV7JHB2FOI5HFYHE2VZBS77/action/author_attestation","sign_citation":"https://pith.science/pith/NIJSV7JHB2FOI5HFYHE2VZBS77/action/citation_signature","submit_replication":"https://pith.science/pith/NIJSV7JHB2FOI5HFYHE2VZBS77/action/replication_record"}},"created_at":"2026-05-18T02:40:54.128991+00:00","updated_at":"2026-05-18T02:40:54.128991+00:00"}