{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KBZYMNRXW6VTVYHWJCQHOUQ6HQ","short_pith_number":"pith:KBZYMNRX","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"},"canonical_sha256":"5073863637b7ab3ae0f648a077521e3c068e687eef3d13aef0d7588f8b1d562a","source":{"kind":"arxiv","id":"1408.1612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1612","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1612v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1612","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"KBZYMNRXW6VT","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KBZYMNRXW6VTVYHW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KBZYMNRX","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KBZYMNRXW6VTVYHWJCQHOUQ6HQ","target":"record","payload":{"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"},"canonical_sha256":"5073863637b7ab3ae0f648a077521e3c068e687eef3d13aef0d7588f8b1d562a","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"},"source_kind":"arxiv","source_id":"1408.1612","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+B/Lh0dr4KHEF54ozgALvbKaf+huO1weCpPPgJdSgGWocfJ9RJvK3pC4bFrqTXYqhpBZjONfNJZifnNT/CPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:32:50.752988Z"},"content_sha256":"a5318cf5805edd79a4d9e302ffa37be2f141b93a110722e3ab18ddbcef19a6d5","schema_version":"1.0","event_id":"sha256:a5318cf5805edd79a4d9e302ffa37be2f141b93a110722e3ab18ddbcef19a6d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KBZYMNRXW6VTVYHWJCQHOUQ6HQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zo1NSOiAmOHZX6bztzBmBUb60QtiEAIK6EFaca1X7GZI0kHEgSRqzcL/vbWyZTEnEoEGVpoOh2zE6CXnUnISAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:32:50.753424Z"},"content_sha256":"c4065b00c14edc8d3242dee6b13fd359c9d6b7bcea864f6c600d460d876f86a5","schema_version":"1.0","event_id":"sha256:c4065b00c14edc8d3242dee6b13fd359c9d6b7bcea864f6c600d460d876f86a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/bundle.json","state_url":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T23:32:50Z","links":{"resolver":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ","bundle":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/bundle.json","state":"https://pith.science/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBZYMNRXW6VTVYHWJCQHOUQ6HQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KBZYMNRXW6VTVYHWJCQHOUQ6HQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ea2956f89b2c7d5cbe3ce8609e767be2a98ba6479615c161472cfa09d632af8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-08-07T14:55:48Z","title_canon_sha256":"ec8287465db32d49c2610b7576646be281921b01cddbb2b4398925f151ebd29c"},"schema_version":"1.0","source":{"id":"1408.1612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1612","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1612v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1612","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"KBZYMNRXW6VT","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KBZYMNRXW6VTVYHW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KBZYMNRX","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:c4065b00c14edc8d3242dee6b13fd359c9d6b7bcea864f6c600d460d876f86a5","target":"graph","created_at":"2026-05-18T02:45:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"J. B. Wang, T. Loke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-08-07T14:55:48Z","title":"OptQC: An optimised parallel quantum compiler"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1612","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a5318cf5805edd79a4d9e302ffa37be2f141b93a110722e3ab18ddbcef19a6d5","target":"record","created_at":"2026-05-18T02:45:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ea2956f89b2c7d5cbe3ce8609e767be2a98ba6479615c161472cfa09d632af8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-08-07T14:55:48Z","title_canon_sha256":"ec8287465db32d49c2610b7576646be281921b01cddbb2b4398925f151ebd29c"},"schema_version":"1.0","source":{"id":"1408.1612","kind":"arxiv","version":1}},"canonical_sha256":"5073863637b7ab3ae0f648a077521e3c068e687eef3d13aef0d7588f8b1d562a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5073863637b7ab3ae0f648a077521e3c068e687eef3d13aef0d7588f8b1d562a","first_computed_at":"2026-05-18T02:45:40.078571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:40.078571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KuUAMv5ct8JTR/342dvg9XipgitCb6yqksHL0dI+vFj4o0bhk2YtB66Sa/34GJPVMd7G9KzfJDPBmjedVOHhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:40.079234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5318cf5805edd79a4d9e302ffa37be2f141b93a110722e3ab18ddbcef19a6d5","sha256:c4065b00c14edc8d3242dee6b13fd359c9d6b7bcea864f6c600d460d876f86a5"],"state_sha256":"4570ac65ea38cab7fa541e2cc9ff68f42b668e57fe315113c4137832a8c759d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXQvJ0lyE86rp51NeT7ZIbZCotIhSGTC38/zWK5uaqU69sx3PgwzKa5rMTpQjiy3kZVhY3AwxlGjfm38scT1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:32:50.757031Z","bundle_sha256":"440eb33292dc9c50d744a82e1e74acc20194ba98daee7342ed5607e1d6c91dc1"}}