{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:57V35RVCN2JZ7EDGXAVHRGUSG7","short_pith_number":"pith:57V35RVC","schema_version":"1.0","canonical_sha256":"efebbec6a26e939f9066b82a789a9237f9126c9c6aebbddc078ead3ea5286849","source":{"kind":"arxiv","id":"2306.05622","version":1},"attestation_state":"computed","paper":{"title":"Improving Quantum Circuit Synthesis with Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Costin Iancu, Ed Younis, John Kubiatowicz, Justin Kalloor, Mathias Weiden","submitted_at":"2023-06-09T01:53:56Z","abstract_excerpt":"In the Noisy Intermediate Scale Quantum (NISQ) era, finding implementations of quantum algorithms that minimize the number of expensive and error prone multi-qubit gates is vital to ensure computations produce meaningful outputs. Unitary synthesis, the process of finding a quantum circuit that implements some target unitary matrix, is able to solve this problem optimally in many cases. However, current bottom-up unitary synthesis algorithms are limited by their exponentially growing run times. We show how applying machine learning to unitary datasets permits drastic speedups for synthesis algo"},"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":"2306.05622","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-09T01:53:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"06aebbd9d71771c9ef2bd768460bdbf44488af67fb2bac53827602123f8fb17d","abstract_canon_sha256":"6bdc68e74dddfcbf2e0d49532146f2bba71f21411ccb16a331fbe3c578e3fce3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:08.287280Z","signature_b64":"32habeLurac3hl91tOrUVCde0rO6NrLACtzYsqv6gNoKyShcvD7y7oV1U/PEj3rOGXEBlheF93VEkfUkVrUlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efebbec6a26e939f9066b82a789a9237f9126c9c6aebbddc078ead3ea5286849","last_reissued_at":"2026-07-05T06:19:08.286884Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:08.286884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Quantum Circuit Synthesis with Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Costin Iancu, Ed Younis, John Kubiatowicz, Justin Kalloor, Mathias Weiden","submitted_at":"2023-06-09T01:53:56Z","abstract_excerpt":"In the Noisy Intermediate Scale Quantum (NISQ) era, finding implementations of quantum algorithms that minimize the number of expensive and error prone multi-qubit gates is vital to ensure computations produce meaningful outputs. Unitary synthesis, the process of finding a quantum circuit that implements some target unitary matrix, is able to solve this problem optimally in many cases. However, current bottom-up unitary synthesis algorithms are limited by their exponentially growing run times. We show how applying machine learning to unitary datasets permits drastic speedups for synthesis algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.05622","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.05622/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":"2306.05622","created_at":"2026-07-05T06:19:08.286941+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.05622v1","created_at":"2026-07-05T06:19:08.286941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.05622","created_at":"2026-07-05T06:19:08.286941+00:00"},{"alias_kind":"pith_short_12","alias_value":"57V35RVCN2JZ","created_at":"2026-07-05T06:19:08.286941+00:00"},{"alias_kind":"pith_short_16","alias_value":"57V35RVCN2JZ7EDG","created_at":"2026-07-05T06:19:08.286941+00:00"},{"alias_kind":"pith_short_8","alias_value":"57V35RVC","created_at":"2026-07-05T06:19:08.286941+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/57V35RVCN2JZ7EDGXAVHRGUSG7","json":"https://pith.science/pith/57V35RVCN2JZ7EDGXAVHRGUSG7.json","graph_json":"https://pith.science/api/pith-number/57V35RVCN2JZ7EDGXAVHRGUSG7/graph.json","events_json":"https://pith.science/api/pith-number/57V35RVCN2JZ7EDGXAVHRGUSG7/events.json","paper":"https://pith.science/paper/57V35RVC"},"agent_actions":{"view_html":"https://pith.science/pith/57V35RVCN2JZ7EDGXAVHRGUSG7","download_json":"https://pith.science/pith/57V35RVCN2JZ7EDGXAVHRGUSG7.json","view_paper":"https://pith.science/paper/57V35RVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.05622&json=true","fetch_graph":"https://pith.science/api/pith-number/57V35RVCN2JZ7EDGXAVHRGUSG7/graph.json","fetch_events":"https://pith.science/api/pith-number/57V35RVCN2JZ7EDGXAVHRGUSG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57V35RVCN2JZ7EDGXAVHRGUSG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57V35RVCN2JZ7EDGXAVHRGUSG7/action/storage_attestation","attest_author":"https://pith.science/pith/57V35RVCN2JZ7EDGXAVHRGUSG7/action/author_attestation","sign_citation":"https://pith.science/pith/57V35RVCN2JZ7EDGXAVHRGUSG7/action/citation_signature","submit_replication":"https://pith.science/pith/57V35RVCN2JZ7EDGXAVHRGUSG7/action/replication_record"}},"created_at":"2026-07-05T06:19:08.286941+00:00","updated_at":"2026-07-05T06:19:08.286941+00:00"}