{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BMOMJJYQMHLPDBN3XBNDUGLUUN","short_pith_number":"pith:BMOMJJYQ","schema_version":"1.0","canonical_sha256":"0b1cc4a71061d6f185bbb85a3a1974a341d48ab4aa1a9247971f642f0e4e62d6","source":{"kind":"arxiv","id":"2110.03137","version":3},"attestation_state":"computed","paper":{"title":"Application-Oriented Performance Benchmarks for Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Charles H. Baldwin, Jason Necaise, Jeremiah Coleman, Karl Mayer, Luning Zhao, Paul Varosy, Sonika Johri, Thomas Lubinski, Timothy Proctor","submitted_at":"2021-10-07T01:45:06Z","abstract_excerpt":"In this work we introduce an open source suite of quantum application-oriented performance benchmarks that is designed to measure the effectiveness of quantum computing hardware at executing quantum applications. These benchmarks probe a quantum computer's performance on various algorithms and small applications as the problem size is varied, by mapping out the fidelity of the results as a function of circuit width and depth using the framework of volumetric benchmarking. In addition to estimating the fidelity of results generated by quantum execution, the suite is designed to benchmark certai"},"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":"2110.03137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-07T01:45:06Z","cross_cats_sorted":[],"title_canon_sha256":"41e71efddd8246442aa30baf7a7963b8d2ca396071a1562f9797a5c6e6648da5","abstract_canon_sha256":"c0b18a0077b3af48fe1f9019032be895f126e77446677611b17089bc6d12de56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:56.375051Z","signature_b64":"BtREojulddTz3+gxtwEWeKtJweJLxuvyukBUJDbMxQ6g1FOhWkyFg3qbbuJpyl+Ej75b28hHCH1LXXauR8g1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b1cc4a71061d6f185bbb85a3a1974a341d48ab4aa1a9247971f642f0e4e62d6","last_reissued_at":"2026-07-05T10:48:56.374455Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:56.374455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Application-Oriented Performance Benchmarks for Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Charles H. Baldwin, Jason Necaise, Jeremiah Coleman, Karl Mayer, Luning Zhao, Paul Varosy, Sonika Johri, Thomas Lubinski, Timothy Proctor","submitted_at":"2021-10-07T01:45:06Z","abstract_excerpt":"In this work we introduce an open source suite of quantum application-oriented performance benchmarks that is designed to measure the effectiveness of quantum computing hardware at executing quantum applications. These benchmarks probe a quantum computer's performance on various algorithms and small applications as the problem size is varied, by mapping out the fidelity of the results as a function of circuit width and depth using the framework of volumetric benchmarking. In addition to estimating the fidelity of results generated by quantum execution, the suite is designed to benchmark certai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03137","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/2110.03137/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":"2110.03137","created_at":"2026-07-05T10:48:56.374528+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.03137v3","created_at":"2026-07-05T10:48:56.374528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03137","created_at":"2026-07-05T10:48:56.374528+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMOMJJYQMHLP","created_at":"2026-07-05T10:48:56.374528+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMOMJJYQMHLPDBN3","created_at":"2026-07-05T10:48:56.374528+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMOMJJYQ","created_at":"2026-07-05T10:48:56.374528+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20805","citing_title":"Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers","ref_index":116,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BMOMJJYQMHLPDBN3XBNDUGLUUN","json":"https://pith.science/pith/BMOMJJYQMHLPDBN3XBNDUGLUUN.json","graph_json":"https://pith.science/api/pith-number/BMOMJJYQMHLPDBN3XBNDUGLUUN/graph.json","events_json":"https://pith.science/api/pith-number/BMOMJJYQMHLPDBN3XBNDUGLUUN/events.json","paper":"https://pith.science/paper/BMOMJJYQ"},"agent_actions":{"view_html":"https://pith.science/pith/BMOMJJYQMHLPDBN3XBNDUGLUUN","download_json":"https://pith.science/pith/BMOMJJYQMHLPDBN3XBNDUGLUUN.json","view_paper":"https://pith.science/paper/BMOMJJYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.03137&json=true","fetch_graph":"https://pith.science/api/pith-number/BMOMJJYQMHLPDBN3XBNDUGLUUN/graph.json","fetch_events":"https://pith.science/api/pith-number/BMOMJJYQMHLPDBN3XBNDUGLUUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMOMJJYQMHLPDBN3XBNDUGLUUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMOMJJYQMHLPDBN3XBNDUGLUUN/action/storage_attestation","attest_author":"https://pith.science/pith/BMOMJJYQMHLPDBN3XBNDUGLUUN/action/author_attestation","sign_citation":"https://pith.science/pith/BMOMJJYQMHLPDBN3XBNDUGLUUN/action/citation_signature","submit_replication":"https://pith.science/pith/BMOMJJYQMHLPDBN3XBNDUGLUUN/action/replication_record"}},"created_at":"2026-07-05T10:48:56.374528+00:00","updated_at":"2026-07-05T10:48:56.374528+00:00"}