{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3ESHPNYRNSIHHR2HOX55QV6ZK2","short_pith_number":"pith:3ESHPNYR","schema_version":"1.0","canonical_sha256":"d92477b7116c9073c74775fbd857d95688985a6cec23e8d33d68b471e0912949","source":{"kind":"arxiv","id":"2410.16265","version":1},"attestation_state":"computed","paper":{"title":"Quantifying the advantages of applying quantum approximate algorithms to portfolio optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher K. Long, Crispin H. W. Barnes, Haomu Yuan, Hugo V. Lepage","submitted_at":"2024-10-21T17:59:05Z","abstract_excerpt":"We present a quantum algorithm for portfolio optimisation. Specifically, We present an end-to-end quantum approximate optimisation algorithm (QAOA) to solve the discrete global minimum variance portfolio (DGMVP) model. This model finds a portfolio of risky assets with the lowest possible risk contingent on the number of traded assets being discrete. We provide a complete pipeline for this model and analyses its viability for noisy intermediate-scale quantum computers. We design initial states, a cost operator, and ans\\\"atze with hard mixing operators within a binary encoding. Further, we perfo"},"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":"2410.16265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-21T17:59:05Z","cross_cats_sorted":[],"title_canon_sha256":"3cbdb69e363378e41a5dfa56c710d0b2d9819eefff29becf05c2068c70d85004","abstract_canon_sha256":"8e9ea128c17569cc42fda912e4f7272614c2186c3bafa4965ac05addda98aa7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:32.210216Z","signature_b64":"fglyxURKY39sv/MUx4xlcplA1knbzhZ35Jt9pBWyOQfpKqE2vkJiCn2L54o8KYbzDlsnfd1aNDc1ofSG1nZWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d92477b7116c9073c74775fbd857d95688985a6cec23e8d33d68b471e0912949","last_reissued_at":"2026-07-05T09:23:32.209806Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:32.209806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantifying the advantages of applying quantum approximate algorithms to portfolio optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher K. Long, Crispin H. W. Barnes, Haomu Yuan, Hugo V. Lepage","submitted_at":"2024-10-21T17:59:05Z","abstract_excerpt":"We present a quantum algorithm for portfolio optimisation. Specifically, We present an end-to-end quantum approximate optimisation algorithm (QAOA) to solve the discrete global minimum variance portfolio (DGMVP) model. This model finds a portfolio of risky assets with the lowest possible risk contingent on the number of traded assets being discrete. We provide a complete pipeline for this model and analyses its viability for noisy intermediate-scale quantum computers. We design initial states, a cost operator, and ans\\\"atze with hard mixing operators within a binary encoding. Further, we perfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16265","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/2410.16265/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":"2410.16265","created_at":"2026-07-05T09:23:32.209862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.16265v1","created_at":"2026-07-05T09:23:32.209862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16265","created_at":"2026-07-05T09:23:32.209862+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ESHPNYRNSIH","created_at":"2026-07-05T09:23:32.209862+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ESHPNYRNSIHHR2H","created_at":"2026-07-05T09:23:32.209862+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ESHPNYR","created_at":"2026-07-05T09:23:32.209862+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.01694","citing_title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3ESHPNYRNSIHHR2HOX55QV6ZK2","json":"https://pith.science/pith/3ESHPNYRNSIHHR2HOX55QV6ZK2.json","graph_json":"https://pith.science/api/pith-number/3ESHPNYRNSIHHR2HOX55QV6ZK2/graph.json","events_json":"https://pith.science/api/pith-number/3ESHPNYRNSIHHR2HOX55QV6ZK2/events.json","paper":"https://pith.science/paper/3ESHPNYR"},"agent_actions":{"view_html":"https://pith.science/pith/3ESHPNYRNSIHHR2HOX55QV6ZK2","download_json":"https://pith.science/pith/3ESHPNYRNSIHHR2HOX55QV6ZK2.json","view_paper":"https://pith.science/paper/3ESHPNYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.16265&json=true","fetch_graph":"https://pith.science/api/pith-number/3ESHPNYRNSIHHR2HOX55QV6ZK2/graph.json","fetch_events":"https://pith.science/api/pith-number/3ESHPNYRNSIHHR2HOX55QV6ZK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ESHPNYRNSIHHR2HOX55QV6ZK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ESHPNYRNSIHHR2HOX55QV6ZK2/action/storage_attestation","attest_author":"https://pith.science/pith/3ESHPNYRNSIHHR2HOX55QV6ZK2/action/author_attestation","sign_citation":"https://pith.science/pith/3ESHPNYRNSIHHR2HOX55QV6ZK2/action/citation_signature","submit_replication":"https://pith.science/pith/3ESHPNYRNSIHHR2HOX55QV6ZK2/action/replication_record"}},"created_at":"2026-07-05T09:23:32.209862+00:00","updated_at":"2026-07-05T09:23:32.209862+00:00"}