{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RPHJX4XCEDZMU5VYJ3JJDSTGAN","short_pith_number":"pith:RPHJX4XC","schema_version":"1.0","canonical_sha256":"8bce9bf2e220f2ca76b84ed291ca66036413aa8549434ce2b9afce7bd7aa22bd","source":{"kind":"arxiv","id":"2001.05983","version":3},"attestation_state":"computed","paper":{"title":"Term Grouping and Travelling Salesperson for Digital Quantum Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic T. Chong, Kaiwen Gui, Margaret Martonosi, Martin Suchara, Pranav Gokhale, Teague Tomesh, Yunong Shi","submitted_at":"2020-01-16T18:33:24Z","abstract_excerpt":"Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian, however, makes such an approach unsuitable for near-term devices with limited gate fidelities that cause high physical errors. In addition, Trotter error caused by noncommuting terms can accumulate and harm the overall circuit fidelity, thus causing algorithmic errors. In this paper, we propose a new term ordering strategy, max-commut"},"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":"2001.05983","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-16T18:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"71ebde8db91c2d2ac42985a71c396eb5df561e3e124ce0b327945da5add6d93d","abstract_canon_sha256":"de1a3c7396d4c793dcd2fafd0ec9089bae4baeccacac5788be9ed6938872c14a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:21.628352Z","signature_b64":"c8eFgeh47jxPSpYFUZPiPcDDr5udqNvWzXwv5OgJeGuqkm8x6O3VvGBZtcHCaeLWAtIaDjvIpqWhIYbOpyxICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bce9bf2e220f2ca76b84ed291ca66036413aa8549434ce2b9afce7bd7aa22bd","last_reissued_at":"2026-07-05T02:22:21.627769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:21.627769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Term Grouping and Travelling Salesperson for Digital Quantum Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic T. Chong, Kaiwen Gui, Margaret Martonosi, Martin Suchara, Pranav Gokhale, Teague Tomesh, Yunong Shi","submitted_at":"2020-01-16T18:33:24Z","abstract_excerpt":"Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian, however, makes such an approach unsuitable for near-term devices with limited gate fidelities that cause high physical errors. In addition, Trotter error caused by noncommuting terms can accumulate and harm the overall circuit fidelity, thus causing algorithmic errors. In this paper, we propose a new term ordering strategy, max-commut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.05983","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/2001.05983/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":"2001.05983","created_at":"2026-07-05T02:22:21.627842+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.05983v3","created_at":"2026-07-05T02:22:21.627842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.05983","created_at":"2026-07-05T02:22:21.627842+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPHJX4XCEDZM","created_at":"2026-07-05T02:22:21.627842+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPHJX4XCEDZMU5VY","created_at":"2026-07-05T02:22:21.627842+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPHJX4XC","created_at":"2026-07-05T02:22:21.627842+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17630","citing_title":"Randomized Subsystem Descent for Fermion-to-Qubit Mapping","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPHJX4XCEDZMU5VYJ3JJDSTGAN","json":"https://pith.science/pith/RPHJX4XCEDZMU5VYJ3JJDSTGAN.json","graph_json":"https://pith.science/api/pith-number/RPHJX4XCEDZMU5VYJ3JJDSTGAN/graph.json","events_json":"https://pith.science/api/pith-number/RPHJX4XCEDZMU5VYJ3JJDSTGAN/events.json","paper":"https://pith.science/paper/RPHJX4XC"},"agent_actions":{"view_html":"https://pith.science/pith/RPHJX4XCEDZMU5VYJ3JJDSTGAN","download_json":"https://pith.science/pith/RPHJX4XCEDZMU5VYJ3JJDSTGAN.json","view_paper":"https://pith.science/paper/RPHJX4XC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.05983&json=true","fetch_graph":"https://pith.science/api/pith-number/RPHJX4XCEDZMU5VYJ3JJDSTGAN/graph.json","fetch_events":"https://pith.science/api/pith-number/RPHJX4XCEDZMU5VYJ3JJDSTGAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPHJX4XCEDZMU5VYJ3JJDSTGAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPHJX4XCEDZMU5VYJ3JJDSTGAN/action/storage_attestation","attest_author":"https://pith.science/pith/RPHJX4XCEDZMU5VYJ3JJDSTGAN/action/author_attestation","sign_citation":"https://pith.science/pith/RPHJX4XCEDZMU5VYJ3JJDSTGAN/action/citation_signature","submit_replication":"https://pith.science/pith/RPHJX4XCEDZMU5VYJ3JJDSTGAN/action/replication_record"}},"created_at":"2026-07-05T02:22:21.627842+00:00","updated_at":"2026-07-05T02:22:21.627842+00:00"}