{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4KCD3QHNYJOGDP3FQ7SDGAKT5H","short_pith_number":"pith:4KCD3QHN","schema_version":"1.0","canonical_sha256":"e2843dc0edc25c61bf6587e4330153e9de676572c33f55501d458f4823e41f64","source":{"kind":"arxiv","id":"2012.03819","version":3},"attestation_state":"computed","paper":{"title":"A Threshold for Quantum Advantage in Derivative Pricing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","q-fin.CP"],"primary_cat":"quant-ph","authors_text":"Guglielmo Mazzola, Nikitas Stamatopoulos, Rajiv Krishnakumar, Shouvanik Chakrabarti, Stefan Woerner, William J. Zeng","submitted_at":"2020-12-07T16:07:00Z","abstract_excerpt":"We give an upper bound on the resources required for valuable quantum advantage in pricing derivatives. To do so, we give the first complete resource estimates for useful quantum derivative pricing, using autocallable and Target Accrual Redemption Forward (TARF) derivatives as benchmark use cases. We uncover blocking challenges in known approaches and introduce a new method for quantum derivative pricing - the re-parameterization method - that avoids them. This method combines pre-trained variational circuits with fault-tolerant quantum computing to dramatically reduce resource requirements. W"},"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":"2012.03819","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-07T16:07:00Z","cross_cats_sorted":["cs.ET","q-fin.CP"],"title_canon_sha256":"7ad4c680fbe212ba64dd4424c53372cbb925eb4c918de3eb875c77c686d0ae54","abstract_canon_sha256":"a1f1685ad98534cd21fbc08a25e6369a3543a0e4c8d3574df62333d1466d9165"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:06:15.687562Z","signature_b64":"TE71rn8xnmFhijtM9ndOUrkS+oZSXLoaWqlV15jTUk++RPYruUCVjsyFBtXhAN0bw8sw68dSSqwY3tt2NMo6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2843dc0edc25c61bf6587e4330153e9de676572c33f55501d458f4823e41f64","last_reissued_at":"2026-07-05T03:06:15.687068Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:06:15.687068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Threshold for Quantum Advantage in Derivative Pricing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","q-fin.CP"],"primary_cat":"quant-ph","authors_text":"Guglielmo Mazzola, Nikitas Stamatopoulos, Rajiv Krishnakumar, Shouvanik Chakrabarti, Stefan Woerner, William J. Zeng","submitted_at":"2020-12-07T16:07:00Z","abstract_excerpt":"We give an upper bound on the resources required for valuable quantum advantage in pricing derivatives. To do so, we give the first complete resource estimates for useful quantum derivative pricing, using autocallable and Target Accrual Redemption Forward (TARF) derivatives as benchmark use cases. We uncover blocking challenges in known approaches and introduce a new method for quantum derivative pricing - the re-parameterization method - that avoids them. This method combines pre-trained variational circuits with fault-tolerant quantum computing to dramatically reduce resource requirements. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.03819","kind":"arxiv","version":3},"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/2012.03819/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":"2012.03819","created_at":"2026-07-05T03:06:15.687125+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.03819v3","created_at":"2026-07-05T03:06:15.687125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.03819","created_at":"2026-07-05T03:06:15.687125+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KCD3QHNYJOG","created_at":"2026-07-05T03:06:15.687125+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KCD3QHNYJOGDP3F","created_at":"2026-07-05T03:06:15.687125+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KCD3QHN","created_at":"2026-07-05T03:06:15.687125+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.01880","citing_title":"Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes","ref_index":76,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KCD3QHNYJOGDP3FQ7SDGAKT5H","json":"https://pith.science/pith/4KCD3QHNYJOGDP3FQ7SDGAKT5H.json","graph_json":"https://pith.science/api/pith-number/4KCD3QHNYJOGDP3FQ7SDGAKT5H/graph.json","events_json":"https://pith.science/api/pith-number/4KCD3QHNYJOGDP3FQ7SDGAKT5H/events.json","paper":"https://pith.science/paper/4KCD3QHN"},"agent_actions":{"view_html":"https://pith.science/pith/4KCD3QHNYJOGDP3FQ7SDGAKT5H","download_json":"https://pith.science/pith/4KCD3QHNYJOGDP3FQ7SDGAKT5H.json","view_paper":"https://pith.science/paper/4KCD3QHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.03819&json=true","fetch_graph":"https://pith.science/api/pith-number/4KCD3QHNYJOGDP3FQ7SDGAKT5H/graph.json","fetch_events":"https://pith.science/api/pith-number/4KCD3QHNYJOGDP3FQ7SDGAKT5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KCD3QHNYJOGDP3FQ7SDGAKT5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KCD3QHNYJOGDP3FQ7SDGAKT5H/action/storage_attestation","attest_author":"https://pith.science/pith/4KCD3QHNYJOGDP3FQ7SDGAKT5H/action/author_attestation","sign_citation":"https://pith.science/pith/4KCD3QHNYJOGDP3FQ7SDGAKT5H/action/citation_signature","submit_replication":"https://pith.science/pith/4KCD3QHNYJOGDP3FQ7SDGAKT5H/action/replication_record"}},"created_at":"2026-07-05T03:06:15.687125+00:00","updated_at":"2026-07-05T03:06:15.687125+00:00"}