{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YDRJHK54MBOJE6I6O2EDCCGJIE","short_pith_number":"pith:YDRJHK54","schema_version":"1.0","canonical_sha256":"c0e293abbc605c92791e76883108c9412e8df9f877760791e5519175ce27fd6b","source":{"kind":"arxiv","id":"2311.08502","version":3},"attestation_state":"computed","paper":{"title":"Variational Quantum Eigensolver with Constraints (VQEC): Solving Constrained Optimization Problems via VQE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Thinh Viet Le, Vassilis Kekatos","submitted_at":"2023-11-14T19:49:09Z","abstract_excerpt":"Variational quantum approaches have shown great promise in finding near-optimal solutions to computationally challenging tasks. Nonetheless, enforcing constraints in a disciplined fashion has been largely unexplored. To address this gap, this work proposes a hybrid quantum-classical algorithmic paradigm termed VQEC that extends the celebrated VQE to handle optimization with constraints. As with the standard VQE, the vector of optimization variables is captured by the state of a variational quantum circuit (VQC). To deal with constraints, VQEC optimizes a Lagrangian function classically over bo"},"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":"2311.08502","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-11-14T19:49:09Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"6fa4f25502f829a2a61da61f1de3b4977395a4fd7f832c672ceffeb7d4dea302","abstract_canon_sha256":"ca353f39eaef6fd06d00b14485620e58f5e8e87f3b22e87e492927bc7fcf9ae3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:46.192755Z","signature_b64":"Ke6Gu6f6N6Sx3db6OPhXLAckKDujI87LwDg8NLsdLmi8PK7Ic/hOn4LKFU2ydJPlzkGSE2eQsDxKW97KwoT8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e293abbc605c92791e76883108c9412e8df9f877760791e5519175ce27fd6b","last_reissued_at":"2026-07-05T08:12:46.192304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:46.192304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational Quantum Eigensolver with Constraints (VQEC): Solving Constrained Optimization Problems via VQE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Thinh Viet Le, Vassilis Kekatos","submitted_at":"2023-11-14T19:49:09Z","abstract_excerpt":"Variational quantum approaches have shown great promise in finding near-optimal solutions to computationally challenging tasks. Nonetheless, enforcing constraints in a disciplined fashion has been largely unexplored. To address this gap, this work proposes a hybrid quantum-classical algorithmic paradigm termed VQEC that extends the celebrated VQE to handle optimization with constraints. As with the standard VQE, the vector of optimization variables is captured by the state of a variational quantum circuit (VQC). To deal with constraints, VQEC optimizes a Lagrangian function classically over bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08502","kind":"arxiv","version":3},"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/2311.08502/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":"2311.08502","created_at":"2026-07-05T08:12:46.192376+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.08502v3","created_at":"2026-07-05T08:12:46.192376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08502","created_at":"2026-07-05T08:12:46.192376+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDRJHK54MBOJ","created_at":"2026-07-05T08:12:46.192376+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDRJHK54MBOJE6I6","created_at":"2026-07-05T08:12:46.192376+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDRJHK54","created_at":"2026-07-05T08:12:46.192376+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20088","citing_title":"CVaR-Assisted Custom Penalty Function for Constrained Optimization","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDRJHK54MBOJE6I6O2EDCCGJIE","json":"https://pith.science/pith/YDRJHK54MBOJE6I6O2EDCCGJIE.json","graph_json":"https://pith.science/api/pith-number/YDRJHK54MBOJE6I6O2EDCCGJIE/graph.json","events_json":"https://pith.science/api/pith-number/YDRJHK54MBOJE6I6O2EDCCGJIE/events.json","paper":"https://pith.science/paper/YDRJHK54"},"agent_actions":{"view_html":"https://pith.science/pith/YDRJHK54MBOJE6I6O2EDCCGJIE","download_json":"https://pith.science/pith/YDRJHK54MBOJE6I6O2EDCCGJIE.json","view_paper":"https://pith.science/paper/YDRJHK54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.08502&json=true","fetch_graph":"https://pith.science/api/pith-number/YDRJHK54MBOJE6I6O2EDCCGJIE/graph.json","fetch_events":"https://pith.science/api/pith-number/YDRJHK54MBOJE6I6O2EDCCGJIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDRJHK54MBOJE6I6O2EDCCGJIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDRJHK54MBOJE6I6O2EDCCGJIE/action/storage_attestation","attest_author":"https://pith.science/pith/YDRJHK54MBOJE6I6O2EDCCGJIE/action/author_attestation","sign_citation":"https://pith.science/pith/YDRJHK54MBOJE6I6O2EDCCGJIE/action/citation_signature","submit_replication":"https://pith.science/pith/YDRJHK54MBOJE6I6O2EDCCGJIE/action/replication_record"}},"created_at":"2026-07-05T08:12:46.192376+00:00","updated_at":"2026-07-05T08:12:46.192376+00:00"}