{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HSWVZVWTMNUCVX753OUX2GS4M6","short_pith_number":"pith:HSWVZVWT","schema_version":"1.0","canonical_sha256":"3cad5cd6d363682adffddba97d1a5c6790c8af8a57e98f45e6cdf6b501a64356","source":{"kind":"arxiv","id":"1910.10649","version":9},"attestation_state":"computed","paper":{"title":"Fast quantum subroutines for the simplex method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Giacomo Nannicini","submitted_at":"2019-10-23T16:14:25Z","abstract_excerpt":"We propose quantum subroutines for the simplex method that avoid classical computation of the basis inverse. We show how to quantize all steps of the simplex algorithm, including checking optimality, unboundedness, and identifying a pivot (i.e., pricing the columns and performing the ratio test) according to Dantzig's rule or the steepest edge rule. The quantized subroutines obtain a polynomial speedup in the dimension of the problem, but have worse dependence on other numerical parameters. For example, for a problem with $m$ constraints, $n$ variables, at most $d_c$ nonzero elements per colum"},"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":"1910.10649","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-23T16:14:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4cd9cb64decc5f9caa574f4379b44c9bac46850ee472e4419422622165d8828c","abstract_canon_sha256":"ef42a3d23dd361d111107bdfc8fa2e9abae9d66a44229a438042fc5466670b17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:08.887682Z","signature_b64":"d90W1XtsTSXI+Ud/3aQpeuG9MbX6TQK0IS82Ml4I0eiFmc26PG/xLP8Fz/gGc3SMZYqWTzX1IOg8xecFnWgQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cad5cd6d363682adffddba97d1a5c6790c8af8a57e98f45e6cdf6b501a64356","last_reissued_at":"2026-07-05T04:56:08.887268Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:08.887268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast quantum subroutines for the simplex method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Giacomo Nannicini","submitted_at":"2019-10-23T16:14:25Z","abstract_excerpt":"We propose quantum subroutines for the simplex method that avoid classical computation of the basis inverse. We show how to quantize all steps of the simplex algorithm, including checking optimality, unboundedness, and identifying a pivot (i.e., pricing the columns and performing the ratio test) according to Dantzig's rule or the steepest edge rule. The quantized subroutines obtain a polynomial speedup in the dimension of the problem, but have worse dependence on other numerical parameters. For example, for a problem with $m$ constraints, $n$ variables, at most $d_c$ nonzero elements per colum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.10649","kind":"arxiv","version":9},"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/1910.10649/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":"1910.10649","created_at":"2026-07-05T04:56:08.887321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.10649v9","created_at":"2026-07-05T04:56:08.887321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.10649","created_at":"2026-07-05T04:56:08.887321+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSWVZVWTMNUC","created_at":"2026-07-05T04:56:08.887321+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSWVZVWTMNUCVX75","created_at":"2026-07-05T04:56:08.887321+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSWVZVWT","created_at":"2026-07-05T04:56:08.887321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04438","citing_title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HSWVZVWTMNUCVX753OUX2GS4M6","json":"https://pith.science/pith/HSWVZVWTMNUCVX753OUX2GS4M6.json","graph_json":"https://pith.science/api/pith-number/HSWVZVWTMNUCVX753OUX2GS4M6/graph.json","events_json":"https://pith.science/api/pith-number/HSWVZVWTMNUCVX753OUX2GS4M6/events.json","paper":"https://pith.science/paper/HSWVZVWT"},"agent_actions":{"view_html":"https://pith.science/pith/HSWVZVWTMNUCVX753OUX2GS4M6","download_json":"https://pith.science/pith/HSWVZVWTMNUCVX753OUX2GS4M6.json","view_paper":"https://pith.science/paper/HSWVZVWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.10649&json=true","fetch_graph":"https://pith.science/api/pith-number/HSWVZVWTMNUCVX753OUX2GS4M6/graph.json","fetch_events":"https://pith.science/api/pith-number/HSWVZVWTMNUCVX753OUX2GS4M6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSWVZVWTMNUCVX753OUX2GS4M6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSWVZVWTMNUCVX753OUX2GS4M6/action/storage_attestation","attest_author":"https://pith.science/pith/HSWVZVWTMNUCVX753OUX2GS4M6/action/author_attestation","sign_citation":"https://pith.science/pith/HSWVZVWTMNUCVX753OUX2GS4M6/action/citation_signature","submit_replication":"https://pith.science/pith/HSWVZVWTMNUCVX753OUX2GS4M6/action/replication_record"}},"created_at":"2026-07-05T04:56:08.887321+00:00","updated_at":"2026-07-05T04:56:08.887321+00:00"}