{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:O2E3ZXE2WNWHIJCVSQ3T7FVAZW","short_pith_number":"pith:O2E3ZXE2","schema_version":"1.0","canonical_sha256":"7689bcdc9ab36c74245594373f96a0cdab38cd7f5d8fd8f2f823125d1d48ef1e","source":{"kind":"arxiv","id":"2505.04700","version":2},"attestation_state":"computed","paper":{"title":"Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alberto Baiardi, Daniel J. Egger, Sabina Dr\\u{a}goi","submitted_at":"2025-05-07T18:00:07Z","abstract_excerpt":"Combinatorial optimization problems have wide-ranging applications in industry and academia. Quantum computers may help solve them by sampling from carefully prepared Ansatz quantum circuits. However, current quantum computers are limited by their qubit count, connectivity, and noise. This is particularly restrictive when considering optimization problems beyond the quadratic order. Here, we introduce Ansatze based on an approximate quadratization of high-order Hamiltonians which do not incur a qubit overhead. The price paid is a loss in the quality of the noiseless solution. Crucially, this a"},"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":"2505.04700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-07T18:00:07Z","cross_cats_sorted":[],"title_canon_sha256":"8169d1a79a41581a8fa708a4aab1ee3fb181ddfd4d0f275c12d008e9c202b22d","abstract_canon_sha256":"6ab0e50781a981f4493ae6b940215ce87f98f0e123d627880541bce2f3ee8b6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:20.273194Z","signature_b64":"7C26NO+Gc9tRxom5+HLvLgNwsKAWKKA3kHJJAfxXs960YHU7dEUVUGH1NA9YiRuqoBm46pQ4FCSStXa+Kh0lDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7689bcdc9ab36c74245594373f96a0cdab38cd7f5d8fd8f2f823125d1d48ef1e","last_reissued_at":"2026-06-24T01:14:20.272773Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:20.272773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alberto Baiardi, Daniel J. Egger, Sabina Dr\\u{a}goi","submitted_at":"2025-05-07T18:00:07Z","abstract_excerpt":"Combinatorial optimization problems have wide-ranging applications in industry and academia. Quantum computers may help solve them by sampling from carefully prepared Ansatz quantum circuits. However, current quantum computers are limited by their qubit count, connectivity, and noise. This is particularly restrictive when considering optimization problems beyond the quadratic order. Here, we introduce Ansatze based on an approximate quadratization of high-order Hamiltonians which do not incur a qubit overhead. The price paid is a loss in the quality of the noiseless solution. Crucially, this a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04700","kind":"arxiv","version":2},"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/2505.04700/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":"2505.04700","created_at":"2026-06-24T01:14:20.272832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04700v2","created_at":"2026-06-24T01:14:20.272832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04700","created_at":"2026-06-24T01:14:20.272832+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2E3ZXE2WNWH","created_at":"2026-06-24T01:14:20.272832+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2E3ZXE2WNWHIJCV","created_at":"2026-06-24T01:14:20.272832+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2E3ZXE2","created_at":"2026-06-24T01:14:20.272832+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.08663","citing_title":"Runtime Quantum Advantage with Digital Quantum Optimization","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O2E3ZXE2WNWHIJCVSQ3T7FVAZW","json":"https://pith.science/pith/O2E3ZXE2WNWHIJCVSQ3T7FVAZW.json","graph_json":"https://pith.science/api/pith-number/O2E3ZXE2WNWHIJCVSQ3T7FVAZW/graph.json","events_json":"https://pith.science/api/pith-number/O2E3ZXE2WNWHIJCVSQ3T7FVAZW/events.json","paper":"https://pith.science/paper/O2E3ZXE2"},"agent_actions":{"view_html":"https://pith.science/pith/O2E3ZXE2WNWHIJCVSQ3T7FVAZW","download_json":"https://pith.science/pith/O2E3ZXE2WNWHIJCVSQ3T7FVAZW.json","view_paper":"https://pith.science/paper/O2E3ZXE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04700&json=true","fetch_graph":"https://pith.science/api/pith-number/O2E3ZXE2WNWHIJCVSQ3T7FVAZW/graph.json","fetch_events":"https://pith.science/api/pith-number/O2E3ZXE2WNWHIJCVSQ3T7FVAZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2E3ZXE2WNWHIJCVSQ3T7FVAZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2E3ZXE2WNWHIJCVSQ3T7FVAZW/action/storage_attestation","attest_author":"https://pith.science/pith/O2E3ZXE2WNWHIJCVSQ3T7FVAZW/action/author_attestation","sign_citation":"https://pith.science/pith/O2E3ZXE2WNWHIJCVSQ3T7FVAZW/action/citation_signature","submit_replication":"https://pith.science/pith/O2E3ZXE2WNWHIJCVSQ3T7FVAZW/action/replication_record"}},"created_at":"2026-06-24T01:14:20.272832+00:00","updated_at":"2026-06-24T01:14:20.272832+00:00"}