{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PEC7QND5WCGCXLEGNCFFF7YRSE","short_pith_number":"pith:PEC7QND5","schema_version":"1.0","canonical_sha256":"7905f8347db08c2bac86688a52ff1191208f9da245d43ecb3a95076eb61dda6a","source":{"kind":"arxiv","id":"2009.05532","version":1},"attestation_state":"computed","paper":{"title":"Limitations of optimization algorithms on noisy quantum devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Stilck Franca, Raul Garcia-Patron","submitted_at":"2020-09-11T17:07:26Z","abstract_excerpt":"Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is whether their noise can be overcome or it fundamentally restricts any potential quantum advantage. We present a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices for a large family of problems that include optimization problems and approximations to the ground state energy of Hamiltonians. Our approach is b"},"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":"2009.05532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-09-11T17:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"a9efcac3c727193932f1323e4bf1ef64b651ceb0d24f81a00d183675aab2e184","abstract_canon_sha256":"ecbc88acb161f269455d63cacd00f826c0c4d5e934f9c3cb2d85f2ed9299e87f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:34:20.201816Z","signature_b64":"AZ3ucqlyIDBlj/hZmSqnBCZ4jsfTuXr1AY6fGs/q1xu0HMkUSnLn92fSYQuHDdyLIrWxD5HupBrwvfhptHHHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7905f8347db08c2bac86688a52ff1191208f9da245d43ecb3a95076eb61dda6a","last_reissued_at":"2026-07-05T03:34:20.201359Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:34:20.201359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limitations of optimization algorithms on noisy quantum devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Stilck Franca, Raul Garcia-Patron","submitted_at":"2020-09-11T17:07:26Z","abstract_excerpt":"Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is whether their noise can be overcome or it fundamentally restricts any potential quantum advantage. We present a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices for a large family of problems that include optimization problems and approximations to the ground state energy of Hamiltonians. Our approach is b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05532","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/2009.05532/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":"2009.05532","created_at":"2026-07-05T03:34:20.201418+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.05532v1","created_at":"2026-07-05T03:34:20.201418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05532","created_at":"2026-07-05T03:34:20.201418+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEC7QND5WCGC","created_at":"2026-07-05T03:34:20.201418+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEC7QND5WCGCXLEG","created_at":"2026-07-05T03:34:20.201418+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEC7QND5","created_at":"2026-07-05T03:34:20.201418+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01821","citing_title":"QUBO-based training for VQAs on Quantum Annealers","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PEC7QND5WCGCXLEGNCFFF7YRSE","json":"https://pith.science/pith/PEC7QND5WCGCXLEGNCFFF7YRSE.json","graph_json":"https://pith.science/api/pith-number/PEC7QND5WCGCXLEGNCFFF7YRSE/graph.json","events_json":"https://pith.science/api/pith-number/PEC7QND5WCGCXLEGNCFFF7YRSE/events.json","paper":"https://pith.science/paper/PEC7QND5"},"agent_actions":{"view_html":"https://pith.science/pith/PEC7QND5WCGCXLEGNCFFF7YRSE","download_json":"https://pith.science/pith/PEC7QND5WCGCXLEGNCFFF7YRSE.json","view_paper":"https://pith.science/paper/PEC7QND5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.05532&json=true","fetch_graph":"https://pith.science/api/pith-number/PEC7QND5WCGCXLEGNCFFF7YRSE/graph.json","fetch_events":"https://pith.science/api/pith-number/PEC7QND5WCGCXLEGNCFFF7YRSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEC7QND5WCGCXLEGNCFFF7YRSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEC7QND5WCGCXLEGNCFFF7YRSE/action/storage_attestation","attest_author":"https://pith.science/pith/PEC7QND5WCGCXLEGNCFFF7YRSE/action/author_attestation","sign_citation":"https://pith.science/pith/PEC7QND5WCGCXLEGNCFFF7YRSE/action/citation_signature","submit_replication":"https://pith.science/pith/PEC7QND5WCGCXLEGNCFFF7YRSE/action/replication_record"}},"created_at":"2026-07-05T03:34:20.201418+00:00","updated_at":"2026-07-05T03:34:20.201418+00:00"}