{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2LCDZYVNW2IRQVNRUHO73I7KFS","short_pith_number":"pith:2LCDZYVN","schema_version":"1.0","canonical_sha256":"d2c43ce2adb6911855b1a1ddfda3ea2c96b707dfc00364668d3de8d492b64d0b","source":{"kind":"arxiv","id":"2506.04223","version":1},"attestation_state":"computed","paper":{"title":"Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree-Fock Method","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","physics.chem-ph","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Alexis Ralli, Peter J. Love, Peter V. Coveney, Tim Weaving","submitted_at":"2025-06-04T17:59:02Z","abstract_excerpt":"In quantum chemistry, self-consistent field (SCF) algorithms define a nonlinear optimization problem, with both continuous and discrete components. In this work, we derive Hartree-Fock-inspired SCF algorithms that can be exactly written as a sequence of Quadratic Unconstrained Spin/Binary Optimization problems (QUSO/QUBO). We reformulate the optimization problem as a series of MaxCut graph problems, which can be efficiently solved using semi-definite programming techniques. This procedure provides performance guarantees at each SCF step, irrespective of the complexity of the optimization lands"},"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":"2506.04223","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-04T17:59:02Z","cross_cats_sorted":["cond-mat.mtrl-sci","physics.chem-ph","physics.comp-ph"],"title_canon_sha256":"8fde4a90bf9ceef154d0922b13a13ea690df84f900beb341bd77ca24d7ecd7a7","abstract_canon_sha256":"52b5a483f3cb3a92875c54eb9b060f06c3898568d5a50acff15d3e0701abbf2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:59.143591Z","signature_b64":"8dyqODRucs+vCwKh53I8hlrJ8V6PsuEpG5PJhE8bzXdPEhYTb4nsdfoEnM1s9ghMr+IXLbF86IsXCiHWPN1qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2c43ce2adb6911855b1a1ddfda3ea2c96b707dfc00364668d3de8d492b64d0b","last_reissued_at":"2026-07-05T11:15:59.143070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:59.143070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree-Fock Method","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","physics.chem-ph","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Alexis Ralli, Peter J. Love, Peter V. Coveney, Tim Weaving","submitted_at":"2025-06-04T17:59:02Z","abstract_excerpt":"In quantum chemistry, self-consistent field (SCF) algorithms define a nonlinear optimization problem, with both continuous and discrete components. In this work, we derive Hartree-Fock-inspired SCF algorithms that can be exactly written as a sequence of Quadratic Unconstrained Spin/Binary Optimization problems (QUSO/QUBO). We reformulate the optimization problem as a series of MaxCut graph problems, which can be efficiently solved using semi-definite programming techniques. This procedure provides performance guarantees at each SCF step, irrespective of the complexity of the optimization lands"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04223","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/2506.04223/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":"2506.04223","created_at":"2026-07-05T11:15:59.143131+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04223v1","created_at":"2026-07-05T11:15:59.143131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04223","created_at":"2026-07-05T11:15:59.143131+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LCDZYVNW2IR","created_at":"2026-07-05T11:15:59.143131+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LCDZYVNW2IRQVNR","created_at":"2026-07-05T11:15:59.143131+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LCDZYVN","created_at":"2026-07-05T11:15:59.143131+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00312","citing_title":"Quantum Decoding Algorithms: Quantum Speedups in Optimization","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2LCDZYVNW2IRQVNRUHO73I7KFS","json":"https://pith.science/pith/2LCDZYVNW2IRQVNRUHO73I7KFS.json","graph_json":"https://pith.science/api/pith-number/2LCDZYVNW2IRQVNRUHO73I7KFS/graph.json","events_json":"https://pith.science/api/pith-number/2LCDZYVNW2IRQVNRUHO73I7KFS/events.json","paper":"https://pith.science/paper/2LCDZYVN"},"agent_actions":{"view_html":"https://pith.science/pith/2LCDZYVNW2IRQVNRUHO73I7KFS","download_json":"https://pith.science/pith/2LCDZYVNW2IRQVNRUHO73I7KFS.json","view_paper":"https://pith.science/paper/2LCDZYVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04223&json=true","fetch_graph":"https://pith.science/api/pith-number/2LCDZYVNW2IRQVNRUHO73I7KFS/graph.json","fetch_events":"https://pith.science/api/pith-number/2LCDZYVNW2IRQVNRUHO73I7KFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LCDZYVNW2IRQVNRUHO73I7KFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LCDZYVNW2IRQVNRUHO73I7KFS/action/storage_attestation","attest_author":"https://pith.science/pith/2LCDZYVNW2IRQVNRUHO73I7KFS/action/author_attestation","sign_citation":"https://pith.science/pith/2LCDZYVNW2IRQVNRUHO73I7KFS/action/citation_signature","submit_replication":"https://pith.science/pith/2LCDZYVNW2IRQVNRUHO73I7KFS/action/replication_record"}},"created_at":"2026-07-05T11:15:59.143131+00:00","updated_at":"2026-07-05T11:15:59.143131+00:00"}