{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NIZXNPUME4VU2YTQZ4JTM7P4T3","short_pith_number":"pith:NIZXNPUM","schema_version":"1.0","canonical_sha256":"6a3376be8c272b4d6270cf13367dfc9ee5296c172e222a3c6d9d5b52bca9941b","source":{"kind":"arxiv","id":"2311.03977","version":2},"attestation_state":"computed","paper":{"title":"A quantum central path algorithm for linear optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Brandon Augustino, Giacomo Nannicini, Jiaqi Leng, Tam\\'as Terlaky, Xiaodi Wu","submitted_at":"2023-11-07T13:26:20Z","abstract_excerpt":"We propose a novel quantum algorithm for solving linear optimization problems by quantum-mechanical simulation of the central path. While interior point methods follow the central path with an iterative algorithm that works with successive linearizations of the perturbed KKT conditions, we perform a single simulation working directly with the nonlinear complementarity equations. This approach yields an algorithm for solving linear optimization problems involving $m$ constraints and $n$ variables to $\\varepsilon$-optimality using $\\mathcal{O} \\left( \\sqrt{m + n} \\frac{R_{1}}{\\varepsilon}\\right)"},"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":"2311.03977","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-07T13:26:20Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"d1197758d42a36ed02e206a6a815bf6ee8d024671bc0918e4f3c7ca514904cf4","abstract_canon_sha256":"ee56c0301fc2e7cac391fe97ac9b8ae70fe21d66ba596f968c3d9bedbdb696e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:25.106693Z","signature_b64":"c1vSAc6LU1kCQ3mFrVuZoXjhck20/fAI5wCRbNylIYStow++hHNguInb9lIhLKsrGwXOSM6SV0jF/BUcDc3IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a3376be8c272b4d6270cf13367dfc9ee5296c172e222a3c6d9d5b52bca9941b","last_reissued_at":"2026-07-05T09:21:25.106205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:25.106205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantum central path algorithm for linear optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Brandon Augustino, Giacomo Nannicini, Jiaqi Leng, Tam\\'as Terlaky, Xiaodi Wu","submitted_at":"2023-11-07T13:26:20Z","abstract_excerpt":"We propose a novel quantum algorithm for solving linear optimization problems by quantum-mechanical simulation of the central path. While interior point methods follow the central path with an iterative algorithm that works with successive linearizations of the perturbed KKT conditions, we perform a single simulation working directly with the nonlinear complementarity equations. This approach yields an algorithm for solving linear optimization problems involving $m$ constraints and $n$ variables to $\\varepsilon$-optimality using $\\mathcal{O} \\left( \\sqrt{m + n} \\frac{R_{1}}{\\varepsilon}\\right)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03977","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/2311.03977/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":"2311.03977","created_at":"2026-07-05T09:21:25.106268+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.03977v2","created_at":"2026-07-05T09:21:25.106268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03977","created_at":"2026-07-05T09:21:25.106268+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIZXNPUME4VU","created_at":"2026-07-05T09:21:25.106268+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIZXNPUME4VU2YTQ","created_at":"2026-07-05T09:21:25.106268+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIZXNPUM","created_at":"2026-07-05T09:21:25.106268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06165","citing_title":"Young Measure Based Quantum Linear Programming Algorithms for Nonlinear/Stochastic Multiscale Partial Differential Equations and Homogenization","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11825","citing_title":"Quantum algorithms for Young measures: applications to nonlinear partial differential equations","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NIZXNPUME4VU2YTQZ4JTM7P4T3","json":"https://pith.science/pith/NIZXNPUME4VU2YTQZ4JTM7P4T3.json","graph_json":"https://pith.science/api/pith-number/NIZXNPUME4VU2YTQZ4JTM7P4T3/graph.json","events_json":"https://pith.science/api/pith-number/NIZXNPUME4VU2YTQZ4JTM7P4T3/events.json","paper":"https://pith.science/paper/NIZXNPUM"},"agent_actions":{"view_html":"https://pith.science/pith/NIZXNPUME4VU2YTQZ4JTM7P4T3","download_json":"https://pith.science/pith/NIZXNPUME4VU2YTQZ4JTM7P4T3.json","view_paper":"https://pith.science/paper/NIZXNPUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.03977&json=true","fetch_graph":"https://pith.science/api/pith-number/NIZXNPUME4VU2YTQZ4JTM7P4T3/graph.json","fetch_events":"https://pith.science/api/pith-number/NIZXNPUME4VU2YTQZ4JTM7P4T3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIZXNPUME4VU2YTQZ4JTM7P4T3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIZXNPUME4VU2YTQZ4JTM7P4T3/action/storage_attestation","attest_author":"https://pith.science/pith/NIZXNPUME4VU2YTQZ4JTM7P4T3/action/author_attestation","sign_citation":"https://pith.science/pith/NIZXNPUME4VU2YTQZ4JTM7P4T3/action/citation_signature","submit_replication":"https://pith.science/pith/NIZXNPUME4VU2YTQZ4JTM7P4T3/action/replication_record"}},"created_at":"2026-07-05T09:21:25.106268+00:00","updated_at":"2026-07-05T09:21:25.106268+00:00"}