{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4Z6DAZP7OLD47RQCNGFHY55X3L","short_pith_number":"pith:4Z6DAZP7","schema_version":"1.0","canonical_sha256":"e67c3065ff72c7cfc602698a7c77b7daf7143eca40d3e96421425ec94388bd4a","source":{"kind":"arxiv","id":"2309.09957","version":1},"attestation_state":"computed","paper":{"title":"Quantum Circuit Optimization through Iteratively Pre-Conditioned Gradient Descent","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avik Dutt, Dhruv Srinivasan, Kushal Chakrabarti, Nikhil Chopra","submitted_at":"2023-09-18T17:30:03Z","abstract_excerpt":"For typical quantum subroutines in the gate-based model of quantum computing, explicit decompositions of circuits in terms of single-qubit and two-qubit entangling gates may exist. However, they often lead to large-depth circuits that are challenging for noisy intermediate-scale quantum (NISQ) hardware. Additionally, exact decompositions might only exist for some modular quantum circuits. Therefore, it is essential to find gate combinations that approximate these circuits to high fidelity with potentially low depth, for example, using gradient-based optimization. Traditional optimizers often r"},"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":"2309.09957","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-18T17:30:03Z","cross_cats_sorted":[],"title_canon_sha256":"5c9941dc0a1d02cd20b640778cc0550c139bc7d38df0d6f3e33d2d9f19b9a5a6","abstract_canon_sha256":"a3d0124df65d3559921b907ddd1a6b9deee25715f890623ab9bf0fd841d8073a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:01.383688Z","signature_b64":"TEY4fmTbeqqfxRHx3chjmH98buQ39wMYXvvdhfL/1RIsdOMoTGCov2rllyRgHIVyZ6ll8EKLvutYyJbb5j4iDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e67c3065ff72c7cfc602698a7c77b7daf7143eca40d3e96421425ec94388bd4a","last_reissued_at":"2026-07-05T09:09:01.383183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:01.383183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Circuit Optimization through Iteratively Pre-Conditioned Gradient Descent","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avik Dutt, Dhruv Srinivasan, Kushal Chakrabarti, Nikhil Chopra","submitted_at":"2023-09-18T17:30:03Z","abstract_excerpt":"For typical quantum subroutines in the gate-based model of quantum computing, explicit decompositions of circuits in terms of single-qubit and two-qubit entangling gates may exist. However, they often lead to large-depth circuits that are challenging for noisy intermediate-scale quantum (NISQ) hardware. Additionally, exact decompositions might only exist for some modular quantum circuits. Therefore, it is essential to find gate combinations that approximate these circuits to high fidelity with potentially low depth, for example, using gradient-based optimization. Traditional optimizers often r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09957","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/2309.09957/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":"2309.09957","created_at":"2026-07-05T09:09:01.383250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.09957v1","created_at":"2026-07-05T09:09:01.383250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09957","created_at":"2026-07-05T09:09:01.383250+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Z6DAZP7OLD4","created_at":"2026-07-05T09:09:01.383250+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Z6DAZP7OLD47RQC","created_at":"2026-07-05T09:09:01.383250+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Z6DAZP7","created_at":"2026-07-05T09:09:01.383250+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/4Z6DAZP7OLD47RQCNGFHY55X3L","json":"https://pith.science/pith/4Z6DAZP7OLD47RQCNGFHY55X3L.json","graph_json":"https://pith.science/api/pith-number/4Z6DAZP7OLD47RQCNGFHY55X3L/graph.json","events_json":"https://pith.science/api/pith-number/4Z6DAZP7OLD47RQCNGFHY55X3L/events.json","paper":"https://pith.science/paper/4Z6DAZP7"},"agent_actions":{"view_html":"https://pith.science/pith/4Z6DAZP7OLD47RQCNGFHY55X3L","download_json":"https://pith.science/pith/4Z6DAZP7OLD47RQCNGFHY55X3L.json","view_paper":"https://pith.science/paper/4Z6DAZP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.09957&json=true","fetch_graph":"https://pith.science/api/pith-number/4Z6DAZP7OLD47RQCNGFHY55X3L/graph.json","fetch_events":"https://pith.science/api/pith-number/4Z6DAZP7OLD47RQCNGFHY55X3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Z6DAZP7OLD47RQCNGFHY55X3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Z6DAZP7OLD47RQCNGFHY55X3L/action/storage_attestation","attest_author":"https://pith.science/pith/4Z6DAZP7OLD47RQCNGFHY55X3L/action/author_attestation","sign_citation":"https://pith.science/pith/4Z6DAZP7OLD47RQCNGFHY55X3L/action/citation_signature","submit_replication":"https://pith.science/pith/4Z6DAZP7OLD47RQCNGFHY55X3L/action/replication_record"}},"created_at":"2026-07-05T09:09:01.383250+00:00","updated_at":"2026-07-05T09:09:01.383250+00:00"}