{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3KNUUEJE7WCCG2TYZWOJIXTSE4","short_pith_number":"pith:3KNUUEJE","canonical_record":{"source":{"id":"2011.05283","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2020-11-10T18:00:42Z","cross_cats_sorted":[],"title_canon_sha256":"f62d8ccca604616de6f96c7f4712f6b4c04ae0444a4758da4b3e75f7c06b33f2","abstract_canon_sha256":"e9d462187bd8c89296f82f17e6f929e1dfafd53edda4f577a15e87313d11cc9d"},"schema_version":"1.0"},"canonical_sha256":"da9b4a1124fd84236a78cd9c945e72270f091a84de7e19a84024d7d2ff993703","source":{"kind":"arxiv","id":"2011.05283","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.05283","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"2011.05283v3","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05283","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"3KNUUEJE7WCC","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_16","alias_value":"3KNUUEJE7WCCG2TY","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_8","alias_value":"3KNUUEJE","created_at":"2026-07-05T07:55:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3KNUUEJE7WCCG2TYZWOJIXTSE4","target":"record","payload":{"canonical_record":{"source":{"id":"2011.05283","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2020-11-10T18:00:42Z","cross_cats_sorted":[],"title_canon_sha256":"f62d8ccca604616de6f96c7f4712f6b4c04ae0444a4758da4b3e75f7c06b33f2","abstract_canon_sha256":"e9d462187bd8c89296f82f17e6f929e1dfafd53edda4f577a15e87313d11cc9d"},"schema_version":"1.0"},"canonical_sha256":"da9b4a1124fd84236a78cd9c945e72270f091a84de7e19a84024d7d2ff993703","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:17.449491Z","signature_b64":"iwHVX+pRm6M759OeN7j7yywjM67xuzkQ3RdzYAl4LSgMZoOyVOPcQyUcIBThMHGWi/21jIkprQHTotpM77jsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da9b4a1124fd84236a78cd9c945e72270f091a84de7e19a84024d7d2ff993703","last_reissued_at":"2026-07-05T07:55:17.448869Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:17.448869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.05283","source_version":3,"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-05T07:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+HW2081cANyHNfr0me9Fi1nSIPgwjBn+KbELr2f1aNqQtZWCeWsxlQUn2aBJD5m/pB6ofSB88wr+zqVv8z+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:29:10.070402Z"},"content_sha256":"7819cf736b40ae33c41da128ff3153c0e26c742d4a38b23dff48592b789da484","schema_version":"1.0","event_id":"sha256:7819cf736b40ae33c41da128ff3153c0e26c742d4a38b23dff48592b789da484"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3KNUUEJE7WCCG2TYZWOJIXTSE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-depth Hamiltonian Simulation by Adaptive Product Formula","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jinzhao Sun, Man-Hong Yung, Xiao Yuan, Zi-jian Zhang","submitted_at":"2020-11-10T18:00:42Z","abstract_excerpt":"Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep quantum circuit that is beyond the capability of near-term noisy quantum devices. Here, focusing on the time evolution of a fixed input quantum state, we propose an adaptive approach to construct a low-depth time evolution circuit. By introducing a measurable quantifier that characterizes the simulation error, we use an adaptive strategy to learn the shallow quan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05283","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/2011.05283/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-05T07:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEy17Uy4DLv+qG/5TW122YdKM9vR5nF5wuBOYAMEOSqAeLrpAK6LCKcMu4v+fey2P9Pn+imnGlMkpinf//ANCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:29:10.070788Z"},"content_sha256":"e2c0f07a09d88b671abb8c11fecdf74251ce77578d22a031b59eaebc3ac80fdb","schema_version":"1.0","event_id":"sha256:e2c0f07a09d88b671abb8c11fecdf74251ce77578d22a031b59eaebc3ac80fdb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KNUUEJE7WCCG2TYZWOJIXTSE4/bundle.json","state_url":"https://pith.science/pith/3KNUUEJE7WCCG2TYZWOJIXTSE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KNUUEJE7WCCG2TYZWOJIXTSE4/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-07-06T12:29:10Z","links":{"resolver":"https://pith.science/pith/3KNUUEJE7WCCG2TYZWOJIXTSE4","bundle":"https://pith.science/pith/3KNUUEJE7WCCG2TYZWOJIXTSE4/bundle.json","state":"https://pith.science/pith/3KNUUEJE7WCCG2TYZWOJIXTSE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KNUUEJE7WCCG2TYZWOJIXTSE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3KNUUEJE7WCCG2TYZWOJIXTSE4","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":"e9d462187bd8c89296f82f17e6f929e1dfafd53edda4f577a15e87313d11cc9d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2020-11-10T18:00:42Z","title_canon_sha256":"f62d8ccca604616de6f96c7f4712f6b4c04ae0444a4758da4b3e75f7c06b33f2"},"schema_version":"1.0","source":{"id":"2011.05283","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.05283","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"2011.05283v3","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05283","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"3KNUUEJE7WCC","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_16","alias_value":"3KNUUEJE7WCCG2TY","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_8","alias_value":"3KNUUEJE","created_at":"2026-07-05T07:55:17Z"}],"graph_snapshots":[{"event_id":"sha256:e2c0f07a09d88b671abb8c11fecdf74251ce77578d22a031b59eaebc3ac80fdb","target":"graph","created_at":"2026-07-05T07:55:17Z","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/2011.05283/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep quantum circuit that is beyond the capability of near-term noisy quantum devices. Here, focusing on the time evolution of a fixed input quantum state, we propose an adaptive approach to construct a low-depth time evolution circuit. By introducing a measurable quantifier that characterizes the simulation error, we use an adaptive strategy to learn the shallow quan","authors_text":"Jinzhao Sun, Man-Hong Yung, Xiao Yuan, Zi-jian Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2020-11-10T18:00:42Z","title":"Low-depth Hamiltonian Simulation by Adaptive Product Formula"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05283","kind":"arxiv","version":3},"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:7819cf736b40ae33c41da128ff3153c0e26c742d4a38b23dff48592b789da484","target":"record","created_at":"2026-07-05T07:55:17Z","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":"e9d462187bd8c89296f82f17e6f929e1dfafd53edda4f577a15e87313d11cc9d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2020-11-10T18:00:42Z","title_canon_sha256":"f62d8ccca604616de6f96c7f4712f6b4c04ae0444a4758da4b3e75f7c06b33f2"},"schema_version":"1.0","source":{"id":"2011.05283","kind":"arxiv","version":3}},"canonical_sha256":"da9b4a1124fd84236a78cd9c945e72270f091a84de7e19a84024d7d2ff993703","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da9b4a1124fd84236a78cd9c945e72270f091a84de7e19a84024d7d2ff993703","first_computed_at":"2026-07-05T07:55:17.448869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:55:17.448869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iwHVX+pRm6M759OeN7j7yywjM67xuzkQ3RdzYAl4LSgMZoOyVOPcQyUcIBThMHGWi/21jIkprQHTotpM77jsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:55:17.449491Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.05283","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7819cf736b40ae33c41da128ff3153c0e26c742d4a38b23dff48592b789da484","sha256:e2c0f07a09d88b671abb8c11fecdf74251ce77578d22a031b59eaebc3ac80fdb"],"state_sha256":"5c426c7808dc2f12646d88996f511193517a0a45322b7e238785f29b375f3260"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwUiTKQMItUR+wSA4UWu/K3owptjxK4UuWxGjfrlWnLVZ16b840yY0AuGCNJj9RvALHO0oYJqAw99G1T2ALaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T12:29:10.072893Z","bundle_sha256":"9b47b6b88fa12d3be7f1db56b780dd0324bab7668be62e413874b5a995220bfc"}}