{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZKHHKMYMSWJZ5NDRA2JY3OE52D","short_pith_number":"pith:ZKHHKMYM","schema_version":"1.0","canonical_sha256":"ca8e75330c95939eb47106938db89dd0fea5269268dc161aac20dae88e5c11fc","source":{"kind":"arxiv","id":"2110.03057","version":2},"attestation_state":"computed","paper":{"title":"Supervised Learning Enhanced Quantum Circuit Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sanjiang Li, Xiangzhen Zhou, Yuan Feng","submitted_at":"2021-10-06T20:32:28Z","abstract_excerpt":"A quantum circuit transformation (QCT) is required when executing a quantum program in a real quantum processing unit (QPU). Through inserting auxiliary SWAP gates, a QCT algorithm transforms a quantum circuit to one that satisfies the connectivity constraint imposed by the QPU. Due to the non-negligible gate error and the limited qubit coherence time of the QPU, QCT algorithms which minimize gate number or circuit depth or maximize the fidelity of output circuits are in urgent need. Unfortunately, finding optimized transformations often involves exhaustive searches, which are extremely time-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":"2110.03057","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-06T20:32:28Z","cross_cats_sorted":[],"title_canon_sha256":"57fc710fdb9d6b5ae5cd2340cd60f38040efe5ba74214707e3dddff9b8359e25","abstract_canon_sha256":"5f8c0ab64c7a562209645b5e9657f4be95bc5aaaa9d6117ba03c5a3fc4080a92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:28.219855Z","signature_b64":"FMJwgEtB/dXFvXxU/AKzQSI0F5InwL3zXodyl4HfSdBmHuuReYTGg8TWMvPfhTFfcw5U24nqe14w7nm26Jm9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca8e75330c95939eb47106938db89dd0fea5269268dc161aac20dae88e5c11fc","last_reissued_at":"2026-07-05T04:28:28.219399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:28.219399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supervised Learning Enhanced Quantum Circuit Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sanjiang Li, Xiangzhen Zhou, Yuan Feng","submitted_at":"2021-10-06T20:32:28Z","abstract_excerpt":"A quantum circuit transformation (QCT) is required when executing a quantum program in a real quantum processing unit (QPU). Through inserting auxiliary SWAP gates, a QCT algorithm transforms a quantum circuit to one that satisfies the connectivity constraint imposed by the QPU. Due to the non-negligible gate error and the limited qubit coherence time of the QPU, QCT algorithms which minimize gate number or circuit depth or maximize the fidelity of output circuits are in urgent need. Unfortunately, finding optimized transformations often involves exhaustive searches, which are extremely time-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03057","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/2110.03057/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":"2110.03057","created_at":"2026-07-05T04:28:28.219460+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.03057v2","created_at":"2026-07-05T04:28:28.219460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03057","created_at":"2026-07-05T04:28:28.219460+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKHHKMYMSWJZ","created_at":"2026-07-05T04:28:28.219460+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKHHKMYMSWJZ5NDR","created_at":"2026-07-05T04:28:28.219460+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKHHKMYM","created_at":"2026-07-05T04:28:28.219460+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/ZKHHKMYMSWJZ5NDRA2JY3OE52D","json":"https://pith.science/pith/ZKHHKMYMSWJZ5NDRA2JY3OE52D.json","graph_json":"https://pith.science/api/pith-number/ZKHHKMYMSWJZ5NDRA2JY3OE52D/graph.json","events_json":"https://pith.science/api/pith-number/ZKHHKMYMSWJZ5NDRA2JY3OE52D/events.json","paper":"https://pith.science/paper/ZKHHKMYM"},"agent_actions":{"view_html":"https://pith.science/pith/ZKHHKMYMSWJZ5NDRA2JY3OE52D","download_json":"https://pith.science/pith/ZKHHKMYMSWJZ5NDRA2JY3OE52D.json","view_paper":"https://pith.science/paper/ZKHHKMYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.03057&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKHHKMYMSWJZ5NDRA2JY3OE52D/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKHHKMYMSWJZ5NDRA2JY3OE52D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKHHKMYMSWJZ5NDRA2JY3OE52D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKHHKMYMSWJZ5NDRA2JY3OE52D/action/storage_attestation","attest_author":"https://pith.science/pith/ZKHHKMYMSWJZ5NDRA2JY3OE52D/action/author_attestation","sign_citation":"https://pith.science/pith/ZKHHKMYMSWJZ5NDRA2JY3OE52D/action/citation_signature","submit_replication":"https://pith.science/pith/ZKHHKMYMSWJZ5NDRA2JY3OE52D/action/replication_record"}},"created_at":"2026-07-05T04:28:28.219460+00:00","updated_at":"2026-07-05T04:28:28.219460+00:00"}