{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KBZYMNRXW6VTVYHWJCQHOUQ6HQ","short_pith_number":"pith:KBZYMNRX","schema_version":"1.0","canonical_sha256":"5073863637b7ab3ae0f648a077521e3c068e687eef3d13aef0d7588f8b1d562a","source":{"kind":"arxiv","id":"1408.1612","version":1},"attestation_state":"computed","paper":{"title":"OptQC: An optimised parallel quantum compiler","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. B. Wang, T. Loke","submitted_at":"2014-08-07T14:55:48Z","abstract_excerpt":"The software package \\emph{Qcompiler} (CPC, 184 (2013) 853) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this paper, we present an extended software \\emph{OptQC}, which finds permutation matrices $P$ and $Q$ for a given unitary matrix $U$ such that the number of gates in the quantum circuit of $U = Q^TP^TU'PQ$ is significantly reduced, where $U'$ is equivalent to $U$ up to a permutation and the quantum circuit implementation of each matrix component is considered se"},"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":"1408.1612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-08-07T14:55:48Z","cross_cats_sorted":[],"title_canon_sha256":"ec8287465db32d49c2610b7576646be281921b01cddbb2b4398925f151ebd29c","abstract_canon_sha256":"ea2956f89b2c7d5cbe3ce8609e767be2a98ba6479615c161472cfa09d632af8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:40.079234Z","signature_b64":"KuUAMv5ct8JTR/342dvg9XipgitCb6yqksHL0dI+vFj4o0bhk2YtB66Sa/34GJPVMd7G9KzfJDPBmjedVOHhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5073863637b7ab3ae0f648a077521e3c068e687eef3d13aef0d7588f8b1d562a","last_reissued_at":"2026-05-18T02:45:40.078571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:40.078571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OptQC: An optimised parallel quantum compiler","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. B. Wang, T. Loke","submitted_at":"2014-08-07T14:55:48Z","abstract_excerpt":"The software package \\emph{Qcompiler} (CPC, 184 (2013) 853) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this paper, we present an extended software \\emph{OptQC}, which finds permutation matrices $P$ and $Q$ for a given unitary matrix $U$ such that the number of gates in the quantum circuit of $U = Q^TP^TU'PQ$ is significantly reduced, where $U'$ is equivalent to $U$ up to a permutation and the quantum circuit implementation of each matrix component is considered se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1612","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":""},"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":"1408.1612","created_at":"2026-05-18T02:45:40.078671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1612v1","created_at":"2026-05-18T02:45:40.078671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1612","created_at":"2026-05-18T02:45:40.078671+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBZYMNRXW6VT","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBZYMNRXW6VTVYHW","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBZYMNRX","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ","json":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ.json","graph_json":"https://pith.science/api/pith-number/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/graph.json","events_json":"https://pith.science/api/pith-number/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/events.json","paper":"https://pith.science/paper/KBZYMNRX"},"agent_actions":{"view_html":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ","download_json":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ.json","view_paper":"https://pith.science/paper/KBZYMNRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1612&json=true","fetch_graph":"https://pith.science/api/pith-number/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/action/storage_attestation","attest_author":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/action/author_attestation","sign_citation":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/action/citation_signature","submit_replication":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/action/replication_record"}},"created_at":"2026-05-18T02:45:40.078671+00:00","updated_at":"2026-05-18T02:45:40.078671+00:00"}