{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4SXDRS3XO6ESIA3OLO4SGOTF5M","short_pith_number":"pith:4SXDRS3X","schema_version":"1.0","canonical_sha256":"e4ae38cb77778924036e5bb9233a65eb2d5ae61147794e9cce54dd3cedfd59c1","source":{"kind":"arxiv","id":"1608.00281","version":1},"attestation_state":"computed","paper":{"title":"Hamiltonian Simulation with Optimal Sample Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, Shelby Kimmel, Theodore J. Yoder","submitted_at":"2016-07-31T23:39:55Z","abstract_excerpt":"We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and Rebentrost [Nat. Phys., 10(9):631--633, 2014] is optimal for this task. We further extend their method to the case of multiple input states, showing how to simulate any Hermitian polynomial of the states provided. As applications, we derive optimal algorithms for commutator simulation and orthogonality testing, and we give a protocol for creating "},"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":"1608.00281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-31T23:39:55Z","cross_cats_sorted":[],"title_canon_sha256":"87fc6d636abece712cae851c3e117bb206a9e4ef2b652199bd058b4d25c9276b","abstract_canon_sha256":"80811d5be4b98a600c8b34b070873012b182eb82ab8f5b03db5d8f178a10effc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:12.899294Z","signature_b64":"lrSrw4hBkP/n79kd44FCPCZZtEaazF3Nbn9WK6O3gXyBWCHMYkibL/S/RS7UtoWbeSr5Vr8ujc6z7BP8T3c+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ae38cb77778924036e5bb9233a65eb2d5ae61147794e9cce54dd3cedfd59c1","last_reissued_at":"2026-05-18T00:42:12.898797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:12.898797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian Simulation with Optimal Sample Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, Shelby Kimmel, Theodore J. Yoder","submitted_at":"2016-07-31T23:39:55Z","abstract_excerpt":"We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and Rebentrost [Nat. Phys., 10(9):631--633, 2014] is optimal for this task. We further extend their method to the case of multiple input states, showing how to simulate any Hermitian polynomial of the states provided. As applications, we derive optimal algorithms for commutator simulation and orthogonality testing, and we give a protocol for creating "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00281","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":""},"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":"1608.00281","created_at":"2026-05-18T00:42:12.898876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00281v1","created_at":"2026-05-18T00:42:12.898876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00281","created_at":"2026-05-18T00:42:12.898876+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SXDRS3XO6ES","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SXDRS3XO6ESIA3O","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SXDRS3X","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M","json":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M.json","graph_json":"https://pith.science/api/pith-number/4SXDRS3XO6ESIA3OLO4SGOTF5M/graph.json","events_json":"https://pith.science/api/pith-number/4SXDRS3XO6ESIA3OLO4SGOTF5M/events.json","paper":"https://pith.science/paper/4SXDRS3X"},"agent_actions":{"view_html":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M","download_json":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M.json","view_paper":"https://pith.science/paper/4SXDRS3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00281&json=true","fetch_graph":"https://pith.science/api/pith-number/4SXDRS3XO6ESIA3OLO4SGOTF5M/graph.json","fetch_events":"https://pith.science/api/pith-number/4SXDRS3XO6ESIA3OLO4SGOTF5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/action/storage_attestation","attest_author":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/action/author_attestation","sign_citation":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/action/citation_signature","submit_replication":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/action/replication_record"}},"created_at":"2026-05-18T00:42:12.898876+00:00","updated_at":"2026-05-18T00:42:12.898876+00:00"}