{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:72SGQJJRD7TAV7ZU4VSJIG32XC","short_pith_number":"pith:72SGQJJR","schema_version":"1.0","canonical_sha256":"fea46825311fe60aff34e564941b7ab8a1d07f0b48eb25c94773a644c2bed3cb","source":{"kind":"arxiv","id":"2211.12489","version":2},"attestation_state":"computed","paper":{"title":"End-to-end resource analysis for quantum interior point methods and portfolio optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander M. Dalzell, B. David Clader, Cedric Yen-Yu Lin, David A. Bader, Fernando G. S. L. Brand\\~ao, Grant Salton, Helmut G. Katzgraber, Mario Berta, Martin J. A. Schuetz, Nikitas Stamatopoulos, William J. Zeng","submitted_at":"2022-11-22T18:54:48Z","abstract_excerpt":"We study quantum interior point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio optimization (PO). We provide a complete quantum circuit-level description of the algorithm from problem input to problem output, making several improvements to the implementation of the QIPM. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm, including constant factors. The resource counts we find depend on instance-specific parameters, such as the condition number of certain linear systems within "},"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":"2211.12489","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-11-22T18:54:48Z","cross_cats_sorted":[],"title_canon_sha256":"7605e0825ef051e3b6a988c508a6297a4f161462f38953e2f65a7c3c57bcac52","abstract_canon_sha256":"9487589df69aa1a1033bda9fb1e6a073df297ece59936ed09edd0f7ec6b8c9a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:30.550051Z","signature_b64":"DWP8TFb5HHYUaKDFnAB3j32AKpXBxjnM37cFk9CRhXKC7BePt4DYLWMwzFOcxFk3XSZyjZa8JzQt/t9UihSEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fea46825311fe60aff34e564941b7ab8a1d07f0b48eb25c94773a644c2bed3cb","last_reissued_at":"2026-07-05T08:22:30.549514Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:30.549514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end resource analysis for quantum interior point methods and portfolio optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander M. Dalzell, B. David Clader, Cedric Yen-Yu Lin, David A. Bader, Fernando G. S. L. Brand\\~ao, Grant Salton, Helmut G. Katzgraber, Mario Berta, Martin J. A. Schuetz, Nikitas Stamatopoulos, William J. Zeng","submitted_at":"2022-11-22T18:54:48Z","abstract_excerpt":"We study quantum interior point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio optimization (PO). We provide a complete quantum circuit-level description of the algorithm from problem input to problem output, making several improvements to the implementation of the QIPM. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm, including constant factors. The resource counts we find depend on instance-specific parameters, such as the condition number of certain linear systems within "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12489","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/2211.12489/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":"2211.12489","created_at":"2026-07-05T08:22:30.549573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.12489v2","created_at":"2026-07-05T08:22:30.549573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12489","created_at":"2026-07-05T08:22:30.549573+00:00"},{"alias_kind":"pith_short_12","alias_value":"72SGQJJRD7TA","created_at":"2026-07-05T08:22:30.549573+00:00"},{"alias_kind":"pith_short_16","alias_value":"72SGQJJRD7TAV7ZU","created_at":"2026-07-05T08:22:30.549573+00:00"},{"alias_kind":"pith_short_8","alias_value":"72SGQJJR","created_at":"2026-07-05T08:22:30.549573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/72SGQJJRD7TAV7ZU4VSJIG32XC","json":"https://pith.science/pith/72SGQJJRD7TAV7ZU4VSJIG32XC.json","graph_json":"https://pith.science/api/pith-number/72SGQJJRD7TAV7ZU4VSJIG32XC/graph.json","events_json":"https://pith.science/api/pith-number/72SGQJJRD7TAV7ZU4VSJIG32XC/events.json","paper":"https://pith.science/paper/72SGQJJR"},"agent_actions":{"view_html":"https://pith.science/pith/72SGQJJRD7TAV7ZU4VSJIG32XC","download_json":"https://pith.science/pith/72SGQJJRD7TAV7ZU4VSJIG32XC.json","view_paper":"https://pith.science/paper/72SGQJJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.12489&json=true","fetch_graph":"https://pith.science/api/pith-number/72SGQJJRD7TAV7ZU4VSJIG32XC/graph.json","fetch_events":"https://pith.science/api/pith-number/72SGQJJRD7TAV7ZU4VSJIG32XC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72SGQJJRD7TAV7ZU4VSJIG32XC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72SGQJJRD7TAV7ZU4VSJIG32XC/action/storage_attestation","attest_author":"https://pith.science/pith/72SGQJJRD7TAV7ZU4VSJIG32XC/action/author_attestation","sign_citation":"https://pith.science/pith/72SGQJJRD7TAV7ZU4VSJIG32XC/action/citation_signature","submit_replication":"https://pith.science/pith/72SGQJJRD7TAV7ZU4VSJIG32XC/action/replication_record"}},"created_at":"2026-07-05T08:22:30.549573+00:00","updated_at":"2026-07-05T08:22:30.549573+00:00"}