{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OF3TBG4BH7VPFPLDOT2KGW6RUV","short_pith_number":"pith:OF3TBG4B","schema_version":"1.0","canonical_sha256":"7177309b813feaf2bd6374f4a35bd1a55a6f1a3a63aff33c42e339e69792bbb5","source":{"kind":"arxiv","id":"2407.21225","version":1},"attestation_state":"computed","paper":{"title":"AI methods for approximate compiling of unitaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"David Kremer, Ismael Faro, Juan Cruz-Benito, Sanjay Vishwakarma, Victor Villar","submitted_at":"2024-07-30T22:30:15Z","abstract_excerpt":"This paper explores artificial intelligence (AI) methods for the approximate compiling of unitaries, focusing on the use of fixed two-qubit gates and arbitrary single-qubit rotations typical in superconducting hardware. Our approach involves three main stages: identifying an initial template that approximates the target unitary, predicting initial parameters for this template, and refining these parameters to maximize the fidelity of the circuit. We propose AI-driven approaches for the first two stages, with a deep learning model that suggests initial templates and an autoencoder-like model th"},"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":"2407.21225","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-30T22:30:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9bd6636631a5cfcc3cc62ab1aa4a5fae27f87213fab1779061ce703741c4efd0","abstract_canon_sha256":"0497aee8ba83b10210cd2ee8383274d66e2e0251f989941d020c6df8fc0c5f9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:50:36.205640Z","signature_b64":"G2F8WV2IwxHsL3ar9YoDUih1TL1dANpry171zXtZe/wd9tfSzkbl4Au77k5tIqD0Ogc8sxluM1kvwBq1cajDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7177309b813feaf2bd6374f4a35bd1a55a6f1a3a63aff33c42e339e69792bbb5","last_reissued_at":"2026-07-05T08:50:36.205249Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:50:36.205249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AI methods for approximate compiling of unitaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"David Kremer, Ismael Faro, Juan Cruz-Benito, Sanjay Vishwakarma, Victor Villar","submitted_at":"2024-07-30T22:30:15Z","abstract_excerpt":"This paper explores artificial intelligence (AI) methods for the approximate compiling of unitaries, focusing on the use of fixed two-qubit gates and arbitrary single-qubit rotations typical in superconducting hardware. Our approach involves three main stages: identifying an initial template that approximates the target unitary, predicting initial parameters for this template, and refining these parameters to maximize the fidelity of the circuit. We propose AI-driven approaches for the first two stages, with a deep learning model that suggests initial templates and an autoencoder-like model th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.21225","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/2407.21225/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":"2407.21225","created_at":"2026-07-05T08:50:36.205306+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.21225v1","created_at":"2026-07-05T08:50:36.205306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.21225","created_at":"2026-07-05T08:50:36.205306+00:00"},{"alias_kind":"pith_short_12","alias_value":"OF3TBG4BH7VP","created_at":"2026-07-05T08:50:36.205306+00:00"},{"alias_kind":"pith_short_16","alias_value":"OF3TBG4BH7VPFPLD","created_at":"2026-07-05T08:50:36.205306+00:00"},{"alias_kind":"pith_short_8","alias_value":"OF3TBG4B","created_at":"2026-07-05T08:50:36.205306+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.15990","citing_title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OF3TBG4BH7VPFPLDOT2KGW6RUV","json":"https://pith.science/pith/OF3TBG4BH7VPFPLDOT2KGW6RUV.json","graph_json":"https://pith.science/api/pith-number/OF3TBG4BH7VPFPLDOT2KGW6RUV/graph.json","events_json":"https://pith.science/api/pith-number/OF3TBG4BH7VPFPLDOT2KGW6RUV/events.json","paper":"https://pith.science/paper/OF3TBG4B"},"agent_actions":{"view_html":"https://pith.science/pith/OF3TBG4BH7VPFPLDOT2KGW6RUV","download_json":"https://pith.science/pith/OF3TBG4BH7VPFPLDOT2KGW6RUV.json","view_paper":"https://pith.science/paper/OF3TBG4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.21225&json=true","fetch_graph":"https://pith.science/api/pith-number/OF3TBG4BH7VPFPLDOT2KGW6RUV/graph.json","fetch_events":"https://pith.science/api/pith-number/OF3TBG4BH7VPFPLDOT2KGW6RUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OF3TBG4BH7VPFPLDOT2KGW6RUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OF3TBG4BH7VPFPLDOT2KGW6RUV/action/storage_attestation","attest_author":"https://pith.science/pith/OF3TBG4BH7VPFPLDOT2KGW6RUV/action/author_attestation","sign_citation":"https://pith.science/pith/OF3TBG4BH7VPFPLDOT2KGW6RUV/action/citation_signature","submit_replication":"https://pith.science/pith/OF3TBG4BH7VPFPLDOT2KGW6RUV/action/replication_record"}},"created_at":"2026-07-05T08:50:36.205306+00:00","updated_at":"2026-07-05T08:50:36.205306+00:00"}