{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LLYW7EW5G6DKPBL2S5JDWG4A3J","short_pith_number":"pith:LLYW7EW5","schema_version":"1.0","canonical_sha256":"5af16f92dd3786a7857a97523b1b80da6dfc70daf73c8a5e49e96a04ec022ba7","source":{"kind":"arxiv","id":"2103.08602","version":4},"attestation_state":"computed","paper":{"title":"Graph Optimization Perspective for Low-Depth Trotter-Suzuki Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","math-ph","math.MP","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Albert T. Schmitz, A. Y. Matsuura, Nicolas P.D. Sawaya, Sonika Johri","submitted_at":"2021-03-15T18:00:01Z","abstract_excerpt":"Hamiltonian simulation represents an important module in a large class of quantum algorithms and simulations such as quantum machine learning, quantum linear algebra methods, and modeling for physics, material science and chemistry. One of the most prominent methods for realizing the time-evolution unitary is via the Trotter-Suzuki decomposition. However, there is a large class of possible decompositions for the infinitesimal time-evolution operator as the order in which the Hamiltonian terms are implemented is arbitrary. We introduce a novel perspective for generating a low-depth Trotter-Suzu"},"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":"2103.08602","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-03-15T18:00:01Z","cross_cats_sorted":["cond-mat.mtrl-sci","math-ph","math.MP","physics.comp-ph"],"title_canon_sha256":"4f4151980ddbad7fb84526381329d34b1157ea58160b9bd895b304d87536f085","abstract_canon_sha256":"098f5b60f013f78e847aa7a869c299248361a534dbd191475852330521c81351"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:22.029652Z","signature_b64":"nLb26iUKP6ovmBwvivMsFbHDhByVQkUmwwIg5HWe9y9jdUFE+AgDp4ao8iFEB2DWXx0Y0RXx8egr/x7nSaHJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5af16f92dd3786a7857a97523b1b80da6dfc70daf73c8a5e49e96a04ec022ba7","last_reissued_at":"2026-07-05T06:14:22.029223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:22.029223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Optimization Perspective for Low-Depth Trotter-Suzuki Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","math-ph","math.MP","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Albert T. Schmitz, A. Y. Matsuura, Nicolas P.D. Sawaya, Sonika Johri","submitted_at":"2021-03-15T18:00:01Z","abstract_excerpt":"Hamiltonian simulation represents an important module in a large class of quantum algorithms and simulations such as quantum machine learning, quantum linear algebra methods, and modeling for physics, material science and chemistry. One of the most prominent methods for realizing the time-evolution unitary is via the Trotter-Suzuki decomposition. However, there is a large class of possible decompositions for the infinitesimal time-evolution operator as the order in which the Hamiltonian terms are implemented is arbitrary. We introduce a novel perspective for generating a low-depth Trotter-Suzu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.08602","kind":"arxiv","version":4},"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/2103.08602/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":"2103.08602","created_at":"2026-07-05T06:14:22.029279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.08602v4","created_at":"2026-07-05T06:14:22.029279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.08602","created_at":"2026-07-05T06:14:22.029279+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLYW7EW5G6DK","created_at":"2026-07-05T06:14:22.029279+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLYW7EW5G6DKPBL2","created_at":"2026-07-05T06:14:22.029279+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLYW7EW5","created_at":"2026-07-05T06:14:22.029279+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03545","citing_title":"Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli Exponentials to Quantum Circuits","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLYW7EW5G6DKPBL2S5JDWG4A3J","json":"https://pith.science/pith/LLYW7EW5G6DKPBL2S5JDWG4A3J.json","graph_json":"https://pith.science/api/pith-number/LLYW7EW5G6DKPBL2S5JDWG4A3J/graph.json","events_json":"https://pith.science/api/pith-number/LLYW7EW5G6DKPBL2S5JDWG4A3J/events.json","paper":"https://pith.science/paper/LLYW7EW5"},"agent_actions":{"view_html":"https://pith.science/pith/LLYW7EW5G6DKPBL2S5JDWG4A3J","download_json":"https://pith.science/pith/LLYW7EW5G6DKPBL2S5JDWG4A3J.json","view_paper":"https://pith.science/paper/LLYW7EW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.08602&json=true","fetch_graph":"https://pith.science/api/pith-number/LLYW7EW5G6DKPBL2S5JDWG4A3J/graph.json","fetch_events":"https://pith.science/api/pith-number/LLYW7EW5G6DKPBL2S5JDWG4A3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLYW7EW5G6DKPBL2S5JDWG4A3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLYW7EW5G6DKPBL2S5JDWG4A3J/action/storage_attestation","attest_author":"https://pith.science/pith/LLYW7EW5G6DKPBL2S5JDWG4A3J/action/author_attestation","sign_citation":"https://pith.science/pith/LLYW7EW5G6DKPBL2S5JDWG4A3J/action/citation_signature","submit_replication":"https://pith.science/pith/LLYW7EW5G6DKPBL2S5JDWG4A3J/action/replication_record"}},"created_at":"2026-07-05T06:14:22.029279+00:00","updated_at":"2026-07-05T06:14:22.029279+00:00"}