{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AN2WTPXCPTL45LQ4PQTC5KDSQ5","short_pith_number":"pith:AN2WTPXC","schema_version":"1.0","canonical_sha256":"037569bee27cd7ceae1c7c262ea872875cd12d9b6213daab9cfb9e53666c175e","source":{"kind":"arxiv","id":"2212.01002","version":1},"attestation_state":"computed","paper":{"title":"Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kai Huang, Lvzhou Li, Shihao Zhang","submitted_at":"2022-12-02T06:58:26Z","abstract_excerpt":"Current noisy intermediate-scale quantum (NISQ) devices can only execute small circuits with shallow depth, as they are still constrained by the presence of noise: quantum gates have error rates and quantum states are fragile due to decoherence. Hence, it is of great importance to optimize the depth/gate-count when designing quantum circuits for specific tasks. Diagonal unitary matrices are well-known to be key building blocks of many quantum algorithms or quantum computing procedures. Prior work has discussed the synthesis of diagonal unitary matrices over the primitive gate set $\\{\\text{CNOT"},"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":"2212.01002","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-02T06:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"05fd15c967d263005120552f8aac93cb9f90b56beb68c8061efbb173163eb8c5","abstract_canon_sha256":"3256ea31dfb3ce84ae31b7df9fc0a15c7655e4bf2728c519c16005dc08c802c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:56.021955Z","signature_b64":"6BGUedHMdlZ1DKCEa6TS+wUS9P9XlahXwY0hwxIdJbos3EphoBJXrQGVZ79zCg/Ultni2hcGic4n5nrKseSGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037569bee27cd7ceae1c7c262ea872875cd12d9b6213daab9cfb9e53666c175e","last_reissued_at":"2026-07-05T08:28:56.021517Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:56.021517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kai Huang, Lvzhou Li, Shihao Zhang","submitted_at":"2022-12-02T06:58:26Z","abstract_excerpt":"Current noisy intermediate-scale quantum (NISQ) devices can only execute small circuits with shallow depth, as they are still constrained by the presence of noise: quantum gates have error rates and quantum states are fragile due to decoherence. Hence, it is of great importance to optimize the depth/gate-count when designing quantum circuits for specific tasks. Diagonal unitary matrices are well-known to be key building blocks of many quantum algorithms or quantum computing procedures. Prior work has discussed the synthesis of diagonal unitary matrices over the primitive gate set $\\{\\text{CNOT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01002","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/2212.01002/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":"2212.01002","created_at":"2026-07-05T08:28:56.021571+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.01002v1","created_at":"2026-07-05T08:28:56.021571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01002","created_at":"2026-07-05T08:28:56.021571+00:00"},{"alias_kind":"pith_short_12","alias_value":"AN2WTPXCPTL4","created_at":"2026-07-05T08:28:56.021571+00:00"},{"alias_kind":"pith_short_16","alias_value":"AN2WTPXCPTL45LQ4","created_at":"2026-07-05T08:28:56.021571+00:00"},{"alias_kind":"pith_short_8","alias_value":"AN2WTPXC","created_at":"2026-07-05T08:28:56.021571+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01464","citing_title":"Predicting symmetries of quantum dynamics with optimal samples","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AN2WTPXCPTL45LQ4PQTC5KDSQ5","json":"https://pith.science/pith/AN2WTPXCPTL45LQ4PQTC5KDSQ5.json","graph_json":"https://pith.science/api/pith-number/AN2WTPXCPTL45LQ4PQTC5KDSQ5/graph.json","events_json":"https://pith.science/api/pith-number/AN2WTPXCPTL45LQ4PQTC5KDSQ5/events.json","paper":"https://pith.science/paper/AN2WTPXC"},"agent_actions":{"view_html":"https://pith.science/pith/AN2WTPXCPTL45LQ4PQTC5KDSQ5","download_json":"https://pith.science/pith/AN2WTPXCPTL45LQ4PQTC5KDSQ5.json","view_paper":"https://pith.science/paper/AN2WTPXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.01002&json=true","fetch_graph":"https://pith.science/api/pith-number/AN2WTPXCPTL45LQ4PQTC5KDSQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/AN2WTPXCPTL45LQ4PQTC5KDSQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AN2WTPXCPTL45LQ4PQTC5KDSQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AN2WTPXCPTL45LQ4PQTC5KDSQ5/action/storage_attestation","attest_author":"https://pith.science/pith/AN2WTPXCPTL45LQ4PQTC5KDSQ5/action/author_attestation","sign_citation":"https://pith.science/pith/AN2WTPXCPTL45LQ4PQTC5KDSQ5/action/citation_signature","submit_replication":"https://pith.science/pith/AN2WTPXCPTL45LQ4PQTC5KDSQ5/action/replication_record"}},"created_at":"2026-07-05T08:28:56.021571+00:00","updated_at":"2026-07-05T08:28:56.021571+00:00"}