{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GCF3MANIECZQNQ3ZU4XHXHCUPE","short_pith_number":"pith:GCF3MANI","schema_version":"1.0","canonical_sha256":"308bb601a820b306c379a72e7b9c547926b58ea46f1430e72bd27c3e87d4a530","source":{"kind":"arxiv","id":"1811.03147","version":5},"attestation_state":"computed","paper":{"title":"Robust quantum compilation and circuit optimisation via energy minimisation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Simon C Benjamin, Tyson Jones","submitted_at":"2018-11-07T21:10:36Z","abstract_excerpt":"We explore a method for automatically recompiling a quantum circuit A into a target circuit B, with the goal that both circuits have the same action on a specific input i.e. B|in> = A|in>. This is of particular relevance to hybrid, NISQ-era algorithms for dynamical simulation or eigensolving. The user initially specifies B as a blank template: a layout of parameterised unitary gates configured to the identity. The compilation then proceeds using quantum hardware to perform an isomorphic energy-minimisation task, and an optional gate elimination phase to compress the circuit. If B is insufficie"},"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":"1811.03147","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-11-07T21:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"669637b0c2d8e2ed34e1620d3af38384269ca40ddadf4f20384743fa963ab2d1","abstract_canon_sha256":"4a847f894d622bd022ef728c0aea9b58e4b119f43501d47bbdf87c96fc778811"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:25.610563Z","signature_b64":"CWsw++7VHTNdnfmkHjqI59IE9F6uLDK1ZEH+viepe6w5tElJhduUBFV0xCXd+lC/R1byMOyU13SdaHBmxaBNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"308bb601a820b306c379a72e7b9c547926b58ea46f1430e72bd27c3e87d4a530","last_reissued_at":"2026-07-05T03:51:25.610113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:25.610113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust quantum compilation and circuit optimisation via energy minimisation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Simon C Benjamin, Tyson Jones","submitted_at":"2018-11-07T21:10:36Z","abstract_excerpt":"We explore a method for automatically recompiling a quantum circuit A into a target circuit B, with the goal that both circuits have the same action on a specific input i.e. B|in> = A|in>. This is of particular relevance to hybrid, NISQ-era algorithms for dynamical simulation or eigensolving. The user initially specifies B as a blank template: a layout of parameterised unitary gates configured to the identity. The compilation then proceeds using quantum hardware to perform an isomorphic energy-minimisation task, and an optional gate elimination phase to compress the circuit. If B is insufficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03147","kind":"arxiv","version":5},"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/1811.03147/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":"1811.03147","created_at":"2026-07-05T03:51:25.610169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03147v5","created_at":"2026-07-05T03:51:25.610169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03147","created_at":"2026-07-05T03:51:25.610169+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCF3MANIECZQ","created_at":"2026-07-05T03:51:25.610169+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCF3MANIECZQNQ3Z","created_at":"2026-07-05T03:51:25.610169+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCF3MANI","created_at":"2026-07-05T03:51:25.610169+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02196","citing_title":"Effects of Quantum Noise on Quantum Approximate Optimization Algorithm","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCF3MANIECZQNQ3ZU4XHXHCUPE","json":"https://pith.science/pith/GCF3MANIECZQNQ3ZU4XHXHCUPE.json","graph_json":"https://pith.science/api/pith-number/GCF3MANIECZQNQ3ZU4XHXHCUPE/graph.json","events_json":"https://pith.science/api/pith-number/GCF3MANIECZQNQ3ZU4XHXHCUPE/events.json","paper":"https://pith.science/paper/GCF3MANI"},"agent_actions":{"view_html":"https://pith.science/pith/GCF3MANIECZQNQ3ZU4XHXHCUPE","download_json":"https://pith.science/pith/GCF3MANIECZQNQ3ZU4XHXHCUPE.json","view_paper":"https://pith.science/paper/GCF3MANI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03147&json=true","fetch_graph":"https://pith.science/api/pith-number/GCF3MANIECZQNQ3ZU4XHXHCUPE/graph.json","fetch_events":"https://pith.science/api/pith-number/GCF3MANIECZQNQ3ZU4XHXHCUPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCF3MANIECZQNQ3ZU4XHXHCUPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCF3MANIECZQNQ3ZU4XHXHCUPE/action/storage_attestation","attest_author":"https://pith.science/pith/GCF3MANIECZQNQ3ZU4XHXHCUPE/action/author_attestation","sign_citation":"https://pith.science/pith/GCF3MANIECZQNQ3ZU4XHXHCUPE/action/citation_signature","submit_replication":"https://pith.science/pith/GCF3MANIECZQNQ3ZU4XHXHCUPE/action/replication_record"}},"created_at":"2026-07-05T03:51:25.610169+00:00","updated_at":"2026-07-05T03:51:25.610169+00:00"}