{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6XWC7GIAWVYHHD56TF6ASVZXQZ","short_pith_number":"pith:6XWC7GIA","schema_version":"1.0","canonical_sha256":"f5ec2f9900b570738fbe997c095737866d0a28b97c122a85e94921d2186de749","source":{"kind":"arxiv","id":"2209.15024","version":6},"attestation_state":"computed","paper":{"title":"Constrained Optimization via Quantum Zeno Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Arthur Rattew, Dylan Herman, Marco Pistoia, Pierre Minssen, Romina Yalovetzky, Ruslan Shaydulin, Shaohan Hu, Shouvanik Chakrabarti, Yue Sun","submitted_at":"2022-09-29T18:00:40Z","abstract_excerpt":"Constrained optimization problems are ubiquitous in science and industry. Quantum algorithms have shown promise in solving optimization problems, yet none of the current algorithms can effectively handle arbitrary constraints. We introduce a technique that uses quantum Zeno dynamics to solve optimization problems with multiple arbitrary constraints, including inequalities. We show that the dynamics of quantum optimization can be efficiently restricted to the in-constraint subspace on a fault-tolerant quantum computer via repeated projective measurements, requiring only a small number of auxili"},"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":"2209.15024","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-09-29T18:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"998842bcc7ebb9c1bf0b61547e95bcd60ed381f17e3ce6436522b900e6bb0b0e","abstract_canon_sha256":"dac340a31c17fe497cb5d89c44cd0dc8128a3d58281b2472788d88e15c45cbc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:20.791147Z","signature_b64":"4qpegX40etpSiR4qHl+61tPkuQTAHe685OvoFXeq9F2Lbt5KvL7EQFitew8nomrU4FZyAAGGCnNhJRv/sQC3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5ec2f9900b570738fbe997c095737866d0a28b97c122a85e94921d2186de749","last_reissued_at":"2026-07-05T06:46:20.790583Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:20.790583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Optimization via Quantum Zeno Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Arthur Rattew, Dylan Herman, Marco Pistoia, Pierre Minssen, Romina Yalovetzky, Ruslan Shaydulin, Shaohan Hu, Shouvanik Chakrabarti, Yue Sun","submitted_at":"2022-09-29T18:00:40Z","abstract_excerpt":"Constrained optimization problems are ubiquitous in science and industry. Quantum algorithms have shown promise in solving optimization problems, yet none of the current algorithms can effectively handle arbitrary constraints. We introduce a technique that uses quantum Zeno dynamics to solve optimization problems with multiple arbitrary constraints, including inequalities. We show that the dynamics of quantum optimization can be efficiently restricted to the in-constraint subspace on a fault-tolerant quantum computer via repeated projective measurements, requiring only a small number of auxili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.15024","kind":"arxiv","version":6},"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/2209.15024/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":"2209.15024","created_at":"2026-07-05T06:46:20.790658+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.15024v6","created_at":"2026-07-05T06:46:20.790658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.15024","created_at":"2026-07-05T06:46:20.790658+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XWC7GIAWVYH","created_at":"2026-07-05T06:46:20.790658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XWC7GIAWVYHHD56","created_at":"2026-07-05T06:46:20.790658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XWC7GIA","created_at":"2026-07-05T06:46:20.790658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.02416","citing_title":"Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6XWC7GIAWVYHHD56TF6ASVZXQZ","json":"https://pith.science/pith/6XWC7GIAWVYHHD56TF6ASVZXQZ.json","graph_json":"https://pith.science/api/pith-number/6XWC7GIAWVYHHD56TF6ASVZXQZ/graph.json","events_json":"https://pith.science/api/pith-number/6XWC7GIAWVYHHD56TF6ASVZXQZ/events.json","paper":"https://pith.science/paper/6XWC7GIA"},"agent_actions":{"view_html":"https://pith.science/pith/6XWC7GIAWVYHHD56TF6ASVZXQZ","download_json":"https://pith.science/pith/6XWC7GIAWVYHHD56TF6ASVZXQZ.json","view_paper":"https://pith.science/paper/6XWC7GIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.15024&json=true","fetch_graph":"https://pith.science/api/pith-number/6XWC7GIAWVYHHD56TF6ASVZXQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6XWC7GIAWVYHHD56TF6ASVZXQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XWC7GIAWVYHHD56TF6ASVZXQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XWC7GIAWVYHHD56TF6ASVZXQZ/action/storage_attestation","attest_author":"https://pith.science/pith/6XWC7GIAWVYHHD56TF6ASVZXQZ/action/author_attestation","sign_citation":"https://pith.science/pith/6XWC7GIAWVYHHD56TF6ASVZXQZ/action/citation_signature","submit_replication":"https://pith.science/pith/6XWC7GIAWVYHHD56TF6ASVZXQZ/action/replication_record"}},"created_at":"2026-07-05T06:46:20.790658+00:00","updated_at":"2026-07-05T06:46:20.790658+00:00"}