{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HAENKH4NYMNFICE5ORI4MHHZQP","short_pith_number":"pith:HAENKH4N","schema_version":"1.0","canonical_sha256":"3808d51f8dc31a54089d7451c61cf983eebe051131730ed78fe743e4fe6e769c","source":{"kind":"arxiv","id":"2108.02099","version":2},"attestation_state":"computed","paper":{"title":"2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dan E. Browne, Lingling Lao","submitted_at":"2021-08-04T15:03:47Z","abstract_excerpt":"Simulating quantum systems is one of the most important potential applications of quantum computers. The high-level circuit defining the simulation needs to be compiled into one that complies with hardware limitations such as qubit architecture (connectivity) and instruction (gate) set. General-purpose quantum compilers work at the gate level and have little knowledge of the mathematical properties of quantum applications, missing further optimization opportunities. Existing application-specific compilers only apply advanced optimizations in the scheduling procedure and are restricted to the C"},"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":"2108.02099","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-08-04T15:03:47Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"65475a130d97d3ad0752c80ee0aec9eff102a4135463a76bdcd3b66573eaf2e5","abstract_canon_sha256":"31642f8dc943c1a095d5f9fbe18f9c2b0647eb0e3b381e8a6e5def1a9613e36f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:51.394144Z","signature_b64":"7OX1Z3+ddFucaD1CS4NIW+9uvrL4uqbORWaJ+IiVe6mx4txNrFoeY4Xy41Q+0YrfiiKl+gBxCkc/WsLQkikxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3808d51f8dc31a54089d7451c61cf983eebe051131730ed78fe743e4fe6e769c","last_reissued_at":"2026-07-05T03:29:51.393588Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:51.393588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dan E. Browne, Lingling Lao","submitted_at":"2021-08-04T15:03:47Z","abstract_excerpt":"Simulating quantum systems is one of the most important potential applications of quantum computers. The high-level circuit defining the simulation needs to be compiled into one that complies with hardware limitations such as qubit architecture (connectivity) and instruction (gate) set. General-purpose quantum compilers work at the gate level and have little knowledge of the mathematical properties of quantum applications, missing further optimization opportunities. Existing application-specific compilers only apply advanced optimizations in the scheduling procedure and are restricted to the C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.02099","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/2108.02099/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":"2108.02099","created_at":"2026-07-05T03:29:51.393644+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.02099v2","created_at":"2026-07-05T03:29:51.393644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.02099","created_at":"2026-07-05T03:29:51.393644+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAENKH4NYMNF","created_at":"2026-07-05T03:29:51.393644+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAENKH4NYMNFICE5","created_at":"2026-07-05T03:29:51.393644+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAENKH4N","created_at":"2026-07-05T03:29:51.393644+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.21172","citing_title":"Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAENKH4NYMNFICE5ORI4MHHZQP","json":"https://pith.science/pith/HAENKH4NYMNFICE5ORI4MHHZQP.json","graph_json":"https://pith.science/api/pith-number/HAENKH4NYMNFICE5ORI4MHHZQP/graph.json","events_json":"https://pith.science/api/pith-number/HAENKH4NYMNFICE5ORI4MHHZQP/events.json","paper":"https://pith.science/paper/HAENKH4N"},"agent_actions":{"view_html":"https://pith.science/pith/HAENKH4NYMNFICE5ORI4MHHZQP","download_json":"https://pith.science/pith/HAENKH4NYMNFICE5ORI4MHHZQP.json","view_paper":"https://pith.science/paper/HAENKH4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.02099&json=true","fetch_graph":"https://pith.science/api/pith-number/HAENKH4NYMNFICE5ORI4MHHZQP/graph.json","fetch_events":"https://pith.science/api/pith-number/HAENKH4NYMNFICE5ORI4MHHZQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAENKH4NYMNFICE5ORI4MHHZQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAENKH4NYMNFICE5ORI4MHHZQP/action/storage_attestation","attest_author":"https://pith.science/pith/HAENKH4NYMNFICE5ORI4MHHZQP/action/author_attestation","sign_citation":"https://pith.science/pith/HAENKH4NYMNFICE5ORI4MHHZQP/action/citation_signature","submit_replication":"https://pith.science/pith/HAENKH4NYMNFICE5ORI4MHHZQP/action/replication_record"}},"created_at":"2026-07-05T03:29:51.393644+00:00","updated_at":"2026-07-05T03:29:51.393644+00:00"}