{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AS5LY33GHAALEE4YPCOVBL5HBK","short_pith_number":"pith:AS5LY33G","schema_version":"1.0","canonical_sha256":"04babc6f663800b21398789d50afa70aad5663b8daac7e800188de5765c531f0","source":{"kind":"arxiv","id":"2312.14151","version":3},"attestation_state":"computed","paper":{"title":"Variational Quantum Multi-Objective Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hao Wang, Linus Ekstrom, Sebastian Schmitt","submitted_at":"2023-12-21T18:59:21Z","abstract_excerpt":"Solving combinatorial optimization problems on near-term quantum devices has gained a lot of attraction in recent years. Currently, most works have focused on single-objective problems, whereas many real-world applications need to consider multiple, mostly conflicting objectives, such as cost and quality. We present a variational quantum optimization algorithm to solve discrete multi-objective optimization problems on quantum computers. The proposed quantum multi-objective optimization (QMOO) algorithm incorporates all cost Hamiltonians representing the classical objective functions in the qua"},"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":"2312.14151","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-21T18:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"e1390b3ad52ae9f6dd4e390b5b98a1d685f211ea231ab03dd64fc41c5805be7a","abstract_canon_sha256":"ab36f7eb87246961cb0adb171e118c5d8c9a96837dcae6c89a75a459fb339f82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:27.136071Z","signature_b64":"/d/aP5MtzfzggzagmybzvS4kbY6haGRlKJrkkWxKydS3dV203faj/6rmQ+P4QYe4eHWCCwOSi+TwcAU+zbTRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04babc6f663800b21398789d50afa70aad5663b8daac7e800188de5765c531f0","last_reissued_at":"2026-07-05T11:16:27.135526Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:27.135526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational Quantum Multi-Objective Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hao Wang, Linus Ekstrom, Sebastian Schmitt","submitted_at":"2023-12-21T18:59:21Z","abstract_excerpt":"Solving combinatorial optimization problems on near-term quantum devices has gained a lot of attraction in recent years. Currently, most works have focused on single-objective problems, whereas many real-world applications need to consider multiple, mostly conflicting objectives, such as cost and quality. We present a variational quantum optimization algorithm to solve discrete multi-objective optimization problems on quantum computers. The proposed quantum multi-objective optimization (QMOO) algorithm incorporates all cost Hamiltonians representing the classical objective functions in the qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14151","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/2312.14151/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":"2312.14151","created_at":"2026-07-05T11:16:27.135585+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.14151v3","created_at":"2026-07-05T11:16:27.135585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14151","created_at":"2026-07-05T11:16:27.135585+00:00"},{"alias_kind":"pith_short_12","alias_value":"AS5LY33GHAAL","created_at":"2026-07-05T11:16:27.135585+00:00"},{"alias_kind":"pith_short_16","alias_value":"AS5LY33GHAALEE4Y","created_at":"2026-07-05T11:16:27.135585+00:00"},{"alias_kind":"pith_short_8","alias_value":"AS5LY33G","created_at":"2026-07-05T11:16:27.135585+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22159","citing_title":"Enhancing Variational Quantum Algorithms for Multicriteria Optimization","ref_index":2005,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK","json":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK.json","graph_json":"https://pith.science/api/pith-number/AS5LY33GHAALEE4YPCOVBL5HBK/graph.json","events_json":"https://pith.science/api/pith-number/AS5LY33GHAALEE4YPCOVBL5HBK/events.json","paper":"https://pith.science/paper/AS5LY33G"},"agent_actions":{"view_html":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK","download_json":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK.json","view_paper":"https://pith.science/paper/AS5LY33G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.14151&json=true","fetch_graph":"https://pith.science/api/pith-number/AS5LY33GHAALEE4YPCOVBL5HBK/graph.json","fetch_events":"https://pith.science/api/pith-number/AS5LY33GHAALEE4YPCOVBL5HBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK/action/storage_attestation","attest_author":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK/action/author_attestation","sign_citation":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK/action/citation_signature","submit_replication":"https://pith.science/pith/AS5LY33GHAALEE4YPCOVBL5HBK/action/replication_record"}},"created_at":"2026-07-05T11:16:27.135585+00:00","updated_at":"2026-07-05T11:16:27.135585+00:00"}