{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GFTX56BZML7HU5UHKJUVQNJWP3","short_pith_number":"pith:GFTX56BZ","schema_version":"1.0","canonical_sha256":"31677ef83962fe7a768752695835367ee70b010cd2f46e5afbc93d30b9e50888","source":{"kind":"arxiv","id":"2503.23723","version":1},"attestation_state":"computed","paper":{"title":"Undecidable problems associated with variational quantum algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Georgios Korpas, Jakub Mare\\v{c}ek, Vyacheslav Kungurtsev","submitted_at":"2025-03-31T04:52:43Z","abstract_excerpt":"Variational Quantum Algorithms (VQAs), such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), are widely studied as candidates for near-term quantum advantage. Recent work has shown that training VQAs is NP-hard in general. In this paper, we present a conditional result suggesting that the training of VQAs is undecidable, even in idealized, noiseless settings. We reduce the decision version of the digitized VQA training problem-where circuit parameters are drawn from a discrete set-to the question of whether a universal Diophantine equation"},"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":"2503.23723","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-31T04:52:43Z","cross_cats_sorted":[],"title_canon_sha256":"f3c566a1ebc87fa20fe82486b57dac7078d44d0c91bacc09361d54bc3189bde8","abstract_canon_sha256":"6c332834bb489ba3758d3fe511e040794fd75c80a1318d2f5da3b4a50e73d3b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:58.519824Z","signature_b64":"DOO/6w/SYhC/IKYRn0uuyZF7JPU07bJGKTIVUoez1CMRsu8yJiL0I4cDQzAx3ENxydkN3FTZ2B8cjPdqgBNLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31677ef83962fe7a768752695835367ee70b010cd2f46e5afbc93d30b9e50888","last_reissued_at":"2026-07-05T10:41:58.519325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:58.519325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Undecidable problems associated with variational quantum algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Georgios Korpas, Jakub Mare\\v{c}ek, Vyacheslav Kungurtsev","submitted_at":"2025-03-31T04:52:43Z","abstract_excerpt":"Variational Quantum Algorithms (VQAs), such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), are widely studied as candidates for near-term quantum advantage. Recent work has shown that training VQAs is NP-hard in general. In this paper, we present a conditional result suggesting that the training of VQAs is undecidable, even in idealized, noiseless settings. We reduce the decision version of the digitized VQA training problem-where circuit parameters are drawn from a discrete set-to the question of whether a universal Diophantine equation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23723","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/2503.23723/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":"2503.23723","created_at":"2026-07-05T10:41:58.519385+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.23723v1","created_at":"2026-07-05T10:41:58.519385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23723","created_at":"2026-07-05T10:41:58.519385+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFTX56BZML7H","created_at":"2026-07-05T10:41:58.519385+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFTX56BZML7HU5UH","created_at":"2026-07-05T10:41:58.519385+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFTX56BZ","created_at":"2026-07-05T10:41:58.519385+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GFTX56BZML7HU5UHKJUVQNJWP3","json":"https://pith.science/pith/GFTX56BZML7HU5UHKJUVQNJWP3.json","graph_json":"https://pith.science/api/pith-number/GFTX56BZML7HU5UHKJUVQNJWP3/graph.json","events_json":"https://pith.science/api/pith-number/GFTX56BZML7HU5UHKJUVQNJWP3/events.json","paper":"https://pith.science/paper/GFTX56BZ"},"agent_actions":{"view_html":"https://pith.science/pith/GFTX56BZML7HU5UHKJUVQNJWP3","download_json":"https://pith.science/pith/GFTX56BZML7HU5UHKJUVQNJWP3.json","view_paper":"https://pith.science/paper/GFTX56BZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.23723&json=true","fetch_graph":"https://pith.science/api/pith-number/GFTX56BZML7HU5UHKJUVQNJWP3/graph.json","fetch_events":"https://pith.science/api/pith-number/GFTX56BZML7HU5UHKJUVQNJWP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFTX56BZML7HU5UHKJUVQNJWP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFTX56BZML7HU5UHKJUVQNJWP3/action/storage_attestation","attest_author":"https://pith.science/pith/GFTX56BZML7HU5UHKJUVQNJWP3/action/author_attestation","sign_citation":"https://pith.science/pith/GFTX56BZML7HU5UHKJUVQNJWP3/action/citation_signature","submit_replication":"https://pith.science/pith/GFTX56BZML7HU5UHKJUVQNJWP3/action/replication_record"}},"created_at":"2026-07-05T10:41:58.519385+00:00","updated_at":"2026-07-05T10:41:58.519385+00:00"}