{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7EZXICYXUR4UVASX34N4XYMBB5","short_pith_number":"pith:7EZXICYX","schema_version":"1.0","canonical_sha256":"f933740b17a4794a8257df1bcbe1810f5c02cc2587613a66d9575536be3a28c3","source":{"kind":"arxiv","id":"2402.08985","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithm Exploration using Application-Oriented Performance Benchmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aaron Barbosa, Aman Mehta, Charles H. Baldwin, Daniel Mills, Joshua J. Goings, Karl Mayer, Luning Zhao, Niranjan Bhatia, Nithin Reddy, Pranav S. Mundada, Smarak Maity, Sonika Johri, Sonny Rappaport, Thomas Lubinski","submitted_at":"2024-02-14T06:55:50Z","abstract_excerpt":"The QED-C suite of Application-Oriented Benchmarks provides the ability to gauge performance characteristics of quantum computers as applied to real-world applications. Its benchmark programs sweep over a range of problem sizes and inputs, capturing key performance metrics related to the quality of results, total time of execution, and quantum gate resources consumed. In this manuscript, we investigate challenges in broadening the relevance of this benchmarking methodology to applications of greater complexity. First, we introduce a method for improving landscape coverage by varying algorithm "},"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":"2402.08985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-14T06:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"d5448afcd2f744fab3c428a5c019faac08a012402100cdf010bea92761b2304d","abstract_canon_sha256":"e9d91fee927b710733f1ad293ee90a6618111dee8d7329dd236df4e995130ef9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:06.648155Z","signature_b64":"Us5xrb1A6ocTUGLTNt1T0KOJ9Cs4B52UWD7ZbznLhRMOXNQLyJsAji6uchariLLLihsg+LmeN9TKaPtPaEG0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f933740b17a4794a8257df1bcbe1810f5c02cc2587613a66d9575536be3a28c3","last_reissued_at":"2026-07-05T07:45:06.647649Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:06.647649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithm Exploration using Application-Oriented Performance Benchmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aaron Barbosa, Aman Mehta, Charles H. Baldwin, Daniel Mills, Joshua J. Goings, Karl Mayer, Luning Zhao, Niranjan Bhatia, Nithin Reddy, Pranav S. Mundada, Smarak Maity, Sonika Johri, Sonny Rappaport, Thomas Lubinski","submitted_at":"2024-02-14T06:55:50Z","abstract_excerpt":"The QED-C suite of Application-Oriented Benchmarks provides the ability to gauge performance characteristics of quantum computers as applied to real-world applications. Its benchmark programs sweep over a range of problem sizes and inputs, capturing key performance metrics related to the quality of results, total time of execution, and quantum gate resources consumed. In this manuscript, we investigate challenges in broadening the relevance of this benchmarking methodology to applications of greater complexity. First, we introduce a method for improving landscape coverage by varying algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08985","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/2402.08985/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":"2402.08985","created_at":"2026-07-05T07:45:06.647717+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08985v1","created_at":"2026-07-05T07:45:06.647717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08985","created_at":"2026-07-05T07:45:06.647717+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EZXICYXUR4U","created_at":"2026-07-05T07:45:06.647717+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EZXICYXUR4UVASX","created_at":"2026-07-05T07:45:06.647717+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EZXICYX","created_at":"2026-07-05T07:45:06.647717+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20017","citing_title":"All-valid-state HOBO encoding for constrained combinatorial optimization on NISQ devices","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2411.11822","citing_title":"Fault-tolerant quantum computation with a neutral atom processor","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7EZXICYXUR4UVASX34N4XYMBB5","json":"https://pith.science/pith/7EZXICYXUR4UVASX34N4XYMBB5.json","graph_json":"https://pith.science/api/pith-number/7EZXICYXUR4UVASX34N4XYMBB5/graph.json","events_json":"https://pith.science/api/pith-number/7EZXICYXUR4UVASX34N4XYMBB5/events.json","paper":"https://pith.science/paper/7EZXICYX"},"agent_actions":{"view_html":"https://pith.science/pith/7EZXICYXUR4UVASX34N4XYMBB5","download_json":"https://pith.science/pith/7EZXICYXUR4UVASX34N4XYMBB5.json","view_paper":"https://pith.science/paper/7EZXICYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08985&json=true","fetch_graph":"https://pith.science/api/pith-number/7EZXICYXUR4UVASX34N4XYMBB5/graph.json","fetch_events":"https://pith.science/api/pith-number/7EZXICYXUR4UVASX34N4XYMBB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EZXICYXUR4UVASX34N4XYMBB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EZXICYXUR4UVASX34N4XYMBB5/action/storage_attestation","attest_author":"https://pith.science/pith/7EZXICYXUR4UVASX34N4XYMBB5/action/author_attestation","sign_citation":"https://pith.science/pith/7EZXICYXUR4UVASX34N4XYMBB5/action/citation_signature","submit_replication":"https://pith.science/pith/7EZXICYXUR4UVASX34N4XYMBB5/action/replication_record"}},"created_at":"2026-07-05T07:45:06.647717+00:00","updated_at":"2026-07-05T07:45:06.647717+00:00"}