{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PAJRIHXXHLCOTBL6VRMC42F3MA","short_pith_number":"pith:PAJRIHXX","schema_version":"1.0","canonical_sha256":"7813141ef73ac4e9857eac582e68bb603fab5de2d0106416805b9e69bf28eb9e","source":{"kind":"arxiv","id":"2310.18281","version":1},"attestation_state":"computed","paper":{"title":"Exploring Non-Linear Programming Formulations in QuantumCircuitOpt for Optimal Circuit Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Carleton Coffrin, Elena R. Henderson, Harsha Nagarajan","submitted_at":"2023-10-27T17:16:58Z","abstract_excerpt":"Given the limitations of current hardware, the theoretical gains promised by quantum computing remain unrealized across practical applications. But the gap between theory and hardware is closing, assisted by developments in quantum algorithmic modeling. One such recent development is QuantumCircuitOpt (QCOpt), an open-source software framework that leverages state-of-the-art optimization-based solvers to find provably optimal compact circuit decompositions, which are exact up to global phase and machine precision. The quantum circuit design problem can be modeled using non-linear, non-convex 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":"2310.18281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-27T17:16:58Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"10f37b35d54b6a11fc659c4e5d0c0bb043e5ed2a1a675d330a8860b8b0520c86","abstract_canon_sha256":"eca4b56ac8e1819b6b12a100d75fa35935c6ba6e8a82232f3cf2161d3c9ce179"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:05:59.844834Z","signature_b64":"8hz7dPzwFAqkv9SNrarByn44zq2dDNDJKCWrp/Ause7u13luxC3fDu/NBX1eU+Ovw29oISqp6Awwy+p6j6EqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7813141ef73ac4e9857eac582e68bb603fab5de2d0106416805b9e69bf28eb9e","last_reissued_at":"2026-07-05T07:05:59.844309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:05:59.844309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Non-Linear Programming Formulations in QuantumCircuitOpt for Optimal Circuit Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Carleton Coffrin, Elena R. Henderson, Harsha Nagarajan","submitted_at":"2023-10-27T17:16:58Z","abstract_excerpt":"Given the limitations of current hardware, the theoretical gains promised by quantum computing remain unrealized across practical applications. But the gap between theory and hardware is closing, assisted by developments in quantum algorithmic modeling. One such recent development is QuantumCircuitOpt (QCOpt), an open-source software framework that leverages state-of-the-art optimization-based solvers to find provably optimal compact circuit decompositions, which are exact up to global phase and machine precision. The quantum circuit design problem can be modeled using non-linear, non-convex c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18281","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/2310.18281/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":"2310.18281","created_at":"2026-07-05T07:05:59.844386+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.18281v1","created_at":"2026-07-05T07:05:59.844386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18281","created_at":"2026-07-05T07:05:59.844386+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAJRIHXXHLCO","created_at":"2026-07-05T07:05:59.844386+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAJRIHXXHLCOTBL6","created_at":"2026-07-05T07:05:59.844386+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAJRIHXX","created_at":"2026-07-05T07:05:59.844386+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28536","citing_title":"Pauli-Sparse regularised Counterdiabatic Shortcuts for Linear-Ramp QAOA","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PAJRIHXXHLCOTBL6VRMC42F3MA","json":"https://pith.science/pith/PAJRIHXXHLCOTBL6VRMC42F3MA.json","graph_json":"https://pith.science/api/pith-number/PAJRIHXXHLCOTBL6VRMC42F3MA/graph.json","events_json":"https://pith.science/api/pith-number/PAJRIHXXHLCOTBL6VRMC42F3MA/events.json","paper":"https://pith.science/paper/PAJRIHXX"},"agent_actions":{"view_html":"https://pith.science/pith/PAJRIHXXHLCOTBL6VRMC42F3MA","download_json":"https://pith.science/pith/PAJRIHXXHLCOTBL6VRMC42F3MA.json","view_paper":"https://pith.science/paper/PAJRIHXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.18281&json=true","fetch_graph":"https://pith.science/api/pith-number/PAJRIHXXHLCOTBL6VRMC42F3MA/graph.json","fetch_events":"https://pith.science/api/pith-number/PAJRIHXXHLCOTBL6VRMC42F3MA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAJRIHXXHLCOTBL6VRMC42F3MA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAJRIHXXHLCOTBL6VRMC42F3MA/action/storage_attestation","attest_author":"https://pith.science/pith/PAJRIHXXHLCOTBL6VRMC42F3MA/action/author_attestation","sign_citation":"https://pith.science/pith/PAJRIHXXHLCOTBL6VRMC42F3MA/action/citation_signature","submit_replication":"https://pith.science/pith/PAJRIHXXHLCOTBL6VRMC42F3MA/action/replication_record"}},"created_at":"2026-07-05T07:05:59.844386+00:00","updated_at":"2026-07-05T07:05:59.844386+00:00"}