{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:UDX3WSCLGPDJ56GWIM2LTZ5KZN","short_pith_number":"pith:UDX3WSCL","schema_version":"1.0","canonical_sha256":"a0efbb484b33c69ef8d64334b9e7aacb5cb3e80efc38c2513416f771dae14517","source":{"kind":"arxiv","id":"0911.5467","version":3},"attestation_state":"computed","paper":{"title":"Algorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of Quantum State Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anil Kumar, Ashok Ajoy, Pranaw Rungta, Rama Koteswara Rao","submitted_at":"2009-11-29T08:55:15Z","abstract_excerpt":"We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The algorithm product-decomposes $U$ in a chosen operator basis by identifying a certain symmetry of $U$ that is intimately related to the number of gates in the decomposition. We illustrate the algorithm by first obtaining a polynomial decomposition in the Pauli basis of the $n$-qubit Quantum State Transfer unitary by Di Franco et. al. (Phys. Rev. Lett. 101, 23050"},"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":"0911.5467","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-29T08:55:15Z","cross_cats_sorted":[],"title_canon_sha256":"2ee654e059d85d8521c3ccb37eaec481250e959c170ed709b3c8dd63ba680ce5","abstract_canon_sha256":"0a2313480a4e5799f9ff09288df9c7932ae7d1e612d9141766f5d17200a080be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:26.756748Z","signature_b64":"Wsa9ytiP4Te/PIdcpzKH67UiZT2HnBmXPfcWFSkhHzPw80Mb3/pJx5WrTMWID8rJY7WVq4djTrO6qxfucJzqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0efbb484b33c69ef8d64334b9e7aacb5cb3e80efc38c2513416f771dae14517","last_reissued_at":"2026-05-18T03:58:26.756071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:26.756071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of Quantum State Transfer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anil Kumar, Ashok Ajoy, Pranaw Rungta, Rama Koteswara Rao","submitted_at":"2009-11-29T08:55:15Z","abstract_excerpt":"We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The algorithm product-decomposes $U$ in a chosen operator basis by identifying a certain symmetry of $U$ that is intimately related to the number of gates in the decomposition. We illustrate the algorithm by first obtaining a polynomial decomposition in the Pauli basis of the $n$-qubit Quantum State Transfer unitary by Di Franco et. al. (Phys. Rev. Lett. 101, 23050"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.5467","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":""},"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":"0911.5467","created_at":"2026-05-18T03:58:26.756166+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.5467v3","created_at":"2026-05-18T03:58:26.756166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.5467","created_at":"2026-05-18T03:58:26.756166+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDX3WSCLGPDJ","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDX3WSCLGPDJ56GW","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDX3WSCL","created_at":"2026-05-18T12:26:02.257875+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/UDX3WSCLGPDJ56GWIM2LTZ5KZN","json":"https://pith.science/pith/UDX3WSCLGPDJ56GWIM2LTZ5KZN.json","graph_json":"https://pith.science/api/pith-number/UDX3WSCLGPDJ56GWIM2LTZ5KZN/graph.json","events_json":"https://pith.science/api/pith-number/UDX3WSCLGPDJ56GWIM2LTZ5KZN/events.json","paper":"https://pith.science/paper/UDX3WSCL"},"agent_actions":{"view_html":"https://pith.science/pith/UDX3WSCLGPDJ56GWIM2LTZ5KZN","download_json":"https://pith.science/pith/UDX3WSCLGPDJ56GWIM2LTZ5KZN.json","view_paper":"https://pith.science/paper/UDX3WSCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.5467&json=true","fetch_graph":"https://pith.science/api/pith-number/UDX3WSCLGPDJ56GWIM2LTZ5KZN/graph.json","fetch_events":"https://pith.science/api/pith-number/UDX3WSCLGPDJ56GWIM2LTZ5KZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDX3WSCLGPDJ56GWIM2LTZ5KZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDX3WSCLGPDJ56GWIM2LTZ5KZN/action/storage_attestation","attest_author":"https://pith.science/pith/UDX3WSCLGPDJ56GWIM2LTZ5KZN/action/author_attestation","sign_citation":"https://pith.science/pith/UDX3WSCLGPDJ56GWIM2LTZ5KZN/action/citation_signature","submit_replication":"https://pith.science/pith/UDX3WSCLGPDJ56GWIM2LTZ5KZN/action/replication_record"}},"created_at":"2026-05-18T03:58:26.756166+00:00","updated_at":"2026-05-18T03:58:26.756166+00:00"}