{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HGX63X56YQRERN54MPHJVMOTER","short_pith_number":"pith:HGX63X56","schema_version":"1.0","canonical_sha256":"39afeddfbec42248b7bc63ce9ab1d324461231b1255264a72feb3c50c4177fe7","source":{"kind":"arxiv","id":"2501.18515","version":2},"attestation_state":"computed","paper":{"title":"Hamiltonian dynamics simulation using linear combination of unitaries on an ion trap quantum computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Mu\\~noz Ramo, Michelle Wynne Sze, Nathan Fitzpatrick, Ross Duncan, Silas Dilkes, Yao Tang","submitted_at":"2025-01-30T17:26:41Z","abstract_excerpt":"The linear combination of unitaries (LCU) method has proven to scale better than existing product formulas in simulating long time Hamiltonian dynamics. However, given the number of multi-control gate operations in the standard prepare-select-unprepare architecture of LCU, it is still resource-intensive to implement on the current quantum computers. In this work, we demonstrate LCU implementations on an ion trap quantum computer for calculating squared overlaps $|\\langle \\psi(t=0)|\\psi(t>0)\\rangle|^2$ of time-evolved states. This is achieved by an optimized LCU method, based on pre-selecting r"},"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":"2501.18515","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-30T17:26:41Z","cross_cats_sorted":[],"title_canon_sha256":"ac613daf5f287129933f1f1d7503a266d2cbfe9f1a66bfd7b62fbf4f29032adc","abstract_canon_sha256":"e1b334ff97a79585b30fd9cc623235fff1800aff22ce46e6b20954e0913b097b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:48.479414Z","signature_b64":"VEhABxU/IPXb+Lc/yjx4c6TxVC0AdsqH9JMosbAPPnyGI/FDqPcU/+Lpe6bV5QqBkbqrTLxadQHVZ5g6Nt2aAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39afeddfbec42248b7bc63ce9ab1d324461231b1255264a72feb3c50c4177fe7","last_reissued_at":"2026-07-05T10:10:48.478937Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:48.478937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian dynamics simulation using linear combination of unitaries on an ion trap quantum computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Mu\\~noz Ramo, Michelle Wynne Sze, Nathan Fitzpatrick, Ross Duncan, Silas Dilkes, Yao Tang","submitted_at":"2025-01-30T17:26:41Z","abstract_excerpt":"The linear combination of unitaries (LCU) method has proven to scale better than existing product formulas in simulating long time Hamiltonian dynamics. However, given the number of multi-control gate operations in the standard prepare-select-unprepare architecture of LCU, it is still resource-intensive to implement on the current quantum computers. In this work, we demonstrate LCU implementations on an ion trap quantum computer for calculating squared overlaps $|\\langle \\psi(t=0)|\\psi(t>0)\\rangle|^2$ of time-evolved states. This is achieved by an optimized LCU method, based on pre-selecting r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18515","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/2501.18515/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.18515","created_at":"2026-07-05T10:10:48.478994+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18515v2","created_at":"2026-07-05T10:10:48.478994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18515","created_at":"2026-07-05T10:10:48.478994+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGX63X56YQRE","created_at":"2026-07-05T10:10:48.478994+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGX63X56YQRERN54","created_at":"2026-07-05T10:10:48.478994+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGX63X56","created_at":"2026-07-05T10:10:48.478994+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20887","citing_title":"Efficient LCU block encodings through Dicke states preparation","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HGX63X56YQRERN54MPHJVMOTER","json":"https://pith.science/pith/HGX63X56YQRERN54MPHJVMOTER.json","graph_json":"https://pith.science/api/pith-number/HGX63X56YQRERN54MPHJVMOTER/graph.json","events_json":"https://pith.science/api/pith-number/HGX63X56YQRERN54MPHJVMOTER/events.json","paper":"https://pith.science/paper/HGX63X56"},"agent_actions":{"view_html":"https://pith.science/pith/HGX63X56YQRERN54MPHJVMOTER","download_json":"https://pith.science/pith/HGX63X56YQRERN54MPHJVMOTER.json","view_paper":"https://pith.science/paper/HGX63X56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18515&json=true","fetch_graph":"https://pith.science/api/pith-number/HGX63X56YQRERN54MPHJVMOTER/graph.json","fetch_events":"https://pith.science/api/pith-number/HGX63X56YQRERN54MPHJVMOTER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGX63X56YQRERN54MPHJVMOTER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGX63X56YQRERN54MPHJVMOTER/action/storage_attestation","attest_author":"https://pith.science/pith/HGX63X56YQRERN54MPHJVMOTER/action/author_attestation","sign_citation":"https://pith.science/pith/HGX63X56YQRERN54MPHJVMOTER/action/citation_signature","submit_replication":"https://pith.science/pith/HGX63X56YQRERN54MPHJVMOTER/action/replication_record"}},"created_at":"2026-07-05T10:10:48.478994+00:00","updated_at":"2026-07-05T10:10:48.478994+00:00"}