{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KOLZ5MCLDTLQ7MOVMLGDRLRBZV","short_pith_number":"pith:KOLZ5MCL","canonical_record":{"source":{"id":"1805.08385","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-05-22T04:20:40Z","cross_cats_sorted":[],"title_canon_sha256":"f54c268f70e4c0340ea672315f841afa97bb2a08b8bae12ae20e08e014fccaa7","abstract_canon_sha256":"abdcf8bba6eecc7e66af7c2453329ea33d8d15d547994902921047d70ba113a8"},"schema_version":"1.0"},"canonical_sha256":"53979eb04b1cd70fb1d562cc38ae21cd7c7b556c85f14ba69274d7177c395e56","source":{"kind":"arxiv","id":"1805.08385","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08385","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08385v2","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08385","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"KOLZ5MCLDTLQ","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"pith_short_16","alias_value":"KOLZ5MCLDTLQ7MOV","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"pith_short_8","alias_value":"KOLZ5MCL","created_at":"2026-07-05T00:02:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KOLZ5MCLDTLQ7MOVMLGDRLRBZV","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08385","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-05-22T04:20:40Z","cross_cats_sorted":[],"title_canon_sha256":"f54c268f70e4c0340ea672315f841afa97bb2a08b8bae12ae20e08e014fccaa7","abstract_canon_sha256":"abdcf8bba6eecc7e66af7c2453329ea33d8d15d547994902921047d70ba113a8"},"schema_version":"1.0"},"canonical_sha256":"53979eb04b1cd70fb1d562cc38ae21cd7c7b556c85f14ba69274d7177c395e56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:08.156446Z","signature_b64":"ehW/JgGBhRki+uiXz75sUJou2oJG05tn/sK6/j5sz8fhCAVULRVGaiVFmHWeOjVPUTNo+/AUTztufExBaNQrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53979eb04b1cd70fb1d562cc38ae21cd7c7b556c85f14ba69274d7177c395e56","last_reissued_at":"2026-07-05T00:02:08.156003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:08.156003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08385","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"er4dPjQt5hnf9UFztFe8ZivsmpL51ZORkkZZ/iBVuX/6S14ziYXPC6BV1XR+fToru3DBlwmbASIXdbK5R9x7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:01:24.011401Z"},"content_sha256":"4aee86851dc7315298a014eaa20e6343f4616c1d1de26e34d1399adc22a89263","schema_version":"1.0","event_id":"sha256:4aee86851dc7315298a014eaa20e6343f4616c1d1de26e34d1399adc22a89263"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KOLZ5MCLDTLQ7MOVMLGDRLRBZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster quantum simulation by randomization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aaron Ostrander, Andrew M. Childs, Yuan Su","submitted_at":"2018-05-22T04:20:40Z","abstract_excerpt":"Product formulas can be used to simulate Hamiltonian dynamics on a quantum computer by approximating the exponential of a sum of operators by a product of exponentials of the individual summands. This approach is both straightforward and surprisingly efficient. We show that by simply randomizing how the summands are ordered, one can prove stronger bounds on the quality of approximation for product formulas of any given order, and thereby give more efficient simulations. Indeed, we show that these bounds can be asymptotically better than previous bounds that exploit commutation between the summ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08385","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.08385/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2Cbd8/OijSpC03j6rs94ONhA/9vWrRIwyzqfYNX2bJsPSw5yRxCynW+q0S7wrvh03IVLhxK7e24maYnxTbvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:01:24.011906Z"},"content_sha256":"0f79281136c529b8670d0566c48202257d426f3bfed6ebdff6a3bc1e1758e5e3","schema_version":"1.0","event_id":"sha256:0f79281136c529b8670d0566c48202257d426f3bfed6ebdff6a3bc1e1758e5e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOLZ5MCLDTLQ7MOVMLGDRLRBZV/bundle.json","state_url":"https://pith.science/pith/KOLZ5MCLDTLQ7MOVMLGDRLRBZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOLZ5MCLDTLQ7MOVMLGDRLRBZV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T16:01:24Z","links":{"resolver":"https://pith.science/pith/KOLZ5MCLDTLQ7MOVMLGDRLRBZV","bundle":"https://pith.science/pith/KOLZ5MCLDTLQ7MOVMLGDRLRBZV/bundle.json","state":"https://pith.science/pith/KOLZ5MCLDTLQ7MOVMLGDRLRBZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOLZ5MCLDTLQ7MOVMLGDRLRBZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KOLZ5MCLDTLQ7MOVMLGDRLRBZV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"abdcf8bba6eecc7e66af7c2453329ea33d8d15d547994902921047d70ba113a8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-05-22T04:20:40Z","title_canon_sha256":"f54c268f70e4c0340ea672315f841afa97bb2a08b8bae12ae20e08e014fccaa7"},"schema_version":"1.0","source":{"id":"1805.08385","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08385","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08385v2","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08385","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"KOLZ5MCLDTLQ","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"pith_short_16","alias_value":"KOLZ5MCLDTLQ7MOV","created_at":"2026-07-05T00:02:08Z"},{"alias_kind":"pith_short_8","alias_value":"KOLZ5MCL","created_at":"2026-07-05T00:02:08Z"}],"graph_snapshots":[{"event_id":"sha256:0f79281136c529b8670d0566c48202257d426f3bfed6ebdff6a3bc1e1758e5e3","target":"graph","created_at":"2026-07-05T00:02:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1805.08385/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Product formulas can be used to simulate Hamiltonian dynamics on a quantum computer by approximating the exponential of a sum of operators by a product of exponentials of the individual summands. This approach is both straightforward and surprisingly efficient. We show that by simply randomizing how the summands are ordered, one can prove stronger bounds on the quality of approximation for product formulas of any given order, and thereby give more efficient simulations. Indeed, we show that these bounds can be asymptotically better than previous bounds that exploit commutation between the summ","authors_text":"Aaron Ostrander, Andrew M. Childs, Yuan Su","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-05-22T04:20:40Z","title":"Faster quantum simulation by randomization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08385","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4aee86851dc7315298a014eaa20e6343f4616c1d1de26e34d1399adc22a89263","target":"record","created_at":"2026-07-05T00:02:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"abdcf8bba6eecc7e66af7c2453329ea33d8d15d547994902921047d70ba113a8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-05-22T04:20:40Z","title_canon_sha256":"f54c268f70e4c0340ea672315f841afa97bb2a08b8bae12ae20e08e014fccaa7"},"schema_version":"1.0","source":{"id":"1805.08385","kind":"arxiv","version":2}},"canonical_sha256":"53979eb04b1cd70fb1d562cc38ae21cd7c7b556c85f14ba69274d7177c395e56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53979eb04b1cd70fb1d562cc38ae21cd7c7b556c85f14ba69274d7177c395e56","first_computed_at":"2026-07-05T00:02:08.156003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:08.156003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ehW/JgGBhRki+uiXz75sUJou2oJG05tn/sK6/j5sz8fhCAVULRVGaiVFmHWeOjVPUTNo+/AUTztufExBaNQrBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:08.156446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08385","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4aee86851dc7315298a014eaa20e6343f4616c1d1de26e34d1399adc22a89263","sha256:0f79281136c529b8670d0566c48202257d426f3bfed6ebdff6a3bc1e1758e5e3"],"state_sha256":"1b0e8a55965aec9825a74f975dcbc0ddedb78f512ec3c1d44eb2717febc21b43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9y4zBATfgzZzHUi2Vhv0WqvexlfHhJbNk4mqrZmOlPxYX8E74yj2fJjS45noS4A51E0tVTZIpgy4E03WgNxFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T16:01:24.015074Z","bundle_sha256":"93fb4da47d638e3cdbb243f6f17777099ca30bdd2b98bc22bce49fcb485d0bcb"}}