{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:66D2YW4CP5OGDO2YF6NEIXAZWS","short_pith_number":"pith:66D2YW4C","schema_version":"1.0","canonical_sha256":"f787ac5b827f5c61bb582f9a445c19b48ae9fb961295931e19ef3528d081bba9","source":{"kind":"arxiv","id":"2408.00354","version":1},"attestation_state":"computed","paper":{"title":"Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.PL"],"primary_cat":"quant-ph","authors_text":"Arianne Meijer-van de Griend, David Winderl, Qunsheng Huang, Richie Yeung","submitted_at":"2024-08-01T07:50:16Z","abstract_excerpt":"In quantum computing, the efficient optimization of Pauli string decompositions is a crucial aspect for the compilation of quantum circuits for many applications, such as chemistry simulations and quantum machine learning. In this paper, we propose a novel algorithm for the synthesis of trotterized time-evolution operators that results in circuits with significantly fewer gates than previous solutions. Our synthesis procedure takes the qubit connectivity of a target quantum computer into account. As a result, the generated quantum circuit does not require routing, and no additional CNOT gates "},"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":"2408.00354","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-01T07:50:16Z","cross_cats_sorted":["cs.DS","cs.PL"],"title_canon_sha256":"885e0c572ee0a9d7f15971aeebe3ed59f5e9b2952fb14234694ac4f9d299e14a","abstract_canon_sha256":"d28e538b3a39ad0bccc308738bfc116cc6fedf11ffbb5ec4b4994fd36760c6b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:51:02.348971Z","signature_b64":"O/xAmUwz6X/Zz3AiY3JlKpnLFu9crpO+P39utbQMBUSiHdBp7/nKHAIlDFLS0aSOuCe9vcLcMj826zvVc48GDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f787ac5b827f5c61bb582f9a445c19b48ae9fb961295931e19ef3528d081bba9","last_reissued_at":"2026-07-05T08:51:02.348520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:51:02.348520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.PL"],"primary_cat":"quant-ph","authors_text":"Arianne Meijer-van de Griend, David Winderl, Qunsheng Huang, Richie Yeung","submitted_at":"2024-08-01T07:50:16Z","abstract_excerpt":"In quantum computing, the efficient optimization of Pauli string decompositions is a crucial aspect for the compilation of quantum circuits for many applications, such as chemistry simulations and quantum machine learning. In this paper, we propose a novel algorithm for the synthesis of trotterized time-evolution operators that results in circuits with significantly fewer gates than previous solutions. Our synthesis procedure takes the qubit connectivity of a target quantum computer into account. As a result, the generated quantum circuit does not require routing, and no additional CNOT gates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00354","kind":"arxiv","version":1},"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/2408.00354/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":"2408.00354","created_at":"2026-07-05T08:51:02.348583+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.00354v1","created_at":"2026-07-05T08:51:02.348583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00354","created_at":"2026-07-05T08:51:02.348583+00:00"},{"alias_kind":"pith_short_12","alias_value":"66D2YW4CP5OG","created_at":"2026-07-05T08:51:02.348583+00:00"},{"alias_kind":"pith_short_16","alias_value":"66D2YW4CP5OGDO2Y","created_at":"2026-07-05T08:51:02.348583+00:00"},{"alias_kind":"pith_short_8","alias_value":"66D2YW4C","created_at":"2026-07-05T08:51:02.348583+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09781","citing_title":"Decomposition of multi-qutrit gates generated by Weyl-Heisenberg strings","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/66D2YW4CP5OGDO2YF6NEIXAZWS","json":"https://pith.science/pith/66D2YW4CP5OGDO2YF6NEIXAZWS.json","graph_json":"https://pith.science/api/pith-number/66D2YW4CP5OGDO2YF6NEIXAZWS/graph.json","events_json":"https://pith.science/api/pith-number/66D2YW4CP5OGDO2YF6NEIXAZWS/events.json","paper":"https://pith.science/paper/66D2YW4C"},"agent_actions":{"view_html":"https://pith.science/pith/66D2YW4CP5OGDO2YF6NEIXAZWS","download_json":"https://pith.science/pith/66D2YW4CP5OGDO2YF6NEIXAZWS.json","view_paper":"https://pith.science/paper/66D2YW4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.00354&json=true","fetch_graph":"https://pith.science/api/pith-number/66D2YW4CP5OGDO2YF6NEIXAZWS/graph.json","fetch_events":"https://pith.science/api/pith-number/66D2YW4CP5OGDO2YF6NEIXAZWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66D2YW4CP5OGDO2YF6NEIXAZWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66D2YW4CP5OGDO2YF6NEIXAZWS/action/storage_attestation","attest_author":"https://pith.science/pith/66D2YW4CP5OGDO2YF6NEIXAZWS/action/author_attestation","sign_citation":"https://pith.science/pith/66D2YW4CP5OGDO2YF6NEIXAZWS/action/citation_signature","submit_replication":"https://pith.science/pith/66D2YW4CP5OGDO2YF6NEIXAZWS/action/replication_record"}},"created_at":"2026-07-05T08:51:02.348583+00:00","updated_at":"2026-07-05T08:51:02.348583+00:00"}