{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BNQTAMCWP7EWXMCZ47TGOQ4SVY","short_pith_number":"pith:BNQTAMCW","schema_version":"1.0","canonical_sha256":"0b613030567fc96bb059e7e6674392ae243ae2d59eb935e9efa464ea0d0da5bc","source":{"kind":"arxiv","id":"2003.01009","version":3},"attestation_state":"computed","paper":{"title":"Demonstrating NISQ Era Challenges in Algorithm Design on IBM's 20 Qubit Quantum Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Brett Martin, Daniel Koch, Laura Wessing, Paul M. Alsing, Saahil Patel","submitted_at":"2020-03-02T16:36:33Z","abstract_excerpt":"As superconducting qubits continue to advance technologically, the realization of quantum algorithms from theoretical abstraction to physical implementation requires knowledge of both quantum circuit construction as well as hardware limitations. In this study we present results from experiments run on IBM's 20-qubit `Poughkeepsie' architecture, with the goal of demonstrating various qubit qualities and challenges that arise in designing quantum algorithms. These include experimentally measuring $T_1$ and $T_2$ coherence times, gate fidelities, sequential CNOT gates, techniques for handling anc"},"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":"2003.01009","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-02T16:36:33Z","cross_cats_sorted":[],"title_canon_sha256":"ab1d6555be6906e669ae251c3db10e4cd3009d1c99e4b20d3a952f5cbce54878","abstract_canon_sha256":"c0a208d4c101d2c20eea770a00461120c72d4625b24a8fa412591a1873ef5e3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:39.951444Z","signature_b64":"aqHOow6P1LPVwEpcMH9V3nz4RefCPpuzPmn0/PzdrXGQ1XTfg+9nae7UXAEbBKZpFkdqbdwAb+QUJ8gRd6WlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b613030567fc96bb059e7e6674392ae243ae2d59eb935e9efa464ea0d0da5bc","last_reissued_at":"2026-07-05T02:08:39.950858Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:39.950858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Demonstrating NISQ Era Challenges in Algorithm Design on IBM's 20 Qubit Quantum Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Brett Martin, Daniel Koch, Laura Wessing, Paul M. Alsing, Saahil Patel","submitted_at":"2020-03-02T16:36:33Z","abstract_excerpt":"As superconducting qubits continue to advance technologically, the realization of quantum algorithms from theoretical abstraction to physical implementation requires knowledge of both quantum circuit construction as well as hardware limitations. In this study we present results from experiments run on IBM's 20-qubit `Poughkeepsie' architecture, with the goal of demonstrating various qubit qualities and challenges that arise in designing quantum algorithms. These include experimentally measuring $T_1$ and $T_2$ coherence times, gate fidelities, sequential CNOT gates, techniques for handling anc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.01009","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/2003.01009/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":"2003.01009","created_at":"2026-07-05T02:08:39.951078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.01009v3","created_at":"2026-07-05T02:08:39.951078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.01009","created_at":"2026-07-05T02:08:39.951078+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNQTAMCWP7EW","created_at":"2026-07-05T02:08:39.951078+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNQTAMCWP7EWXMCZ","created_at":"2026-07-05T02:08:39.951078+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNQTAMCW","created_at":"2026-07-05T02:08:39.951078+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04229","citing_title":"Simulating Quantum Algorithms Using Fidelity and Coherence Time as Principle Models for Error","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BNQTAMCWP7EWXMCZ47TGOQ4SVY","json":"https://pith.science/pith/BNQTAMCWP7EWXMCZ47TGOQ4SVY.json","graph_json":"https://pith.science/api/pith-number/BNQTAMCWP7EWXMCZ47TGOQ4SVY/graph.json","events_json":"https://pith.science/api/pith-number/BNQTAMCWP7EWXMCZ47TGOQ4SVY/events.json","paper":"https://pith.science/paper/BNQTAMCW"},"agent_actions":{"view_html":"https://pith.science/pith/BNQTAMCWP7EWXMCZ47TGOQ4SVY","download_json":"https://pith.science/pith/BNQTAMCWP7EWXMCZ47TGOQ4SVY.json","view_paper":"https://pith.science/paper/BNQTAMCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.01009&json=true","fetch_graph":"https://pith.science/api/pith-number/BNQTAMCWP7EWXMCZ47TGOQ4SVY/graph.json","fetch_events":"https://pith.science/api/pith-number/BNQTAMCWP7EWXMCZ47TGOQ4SVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNQTAMCWP7EWXMCZ47TGOQ4SVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNQTAMCWP7EWXMCZ47TGOQ4SVY/action/storage_attestation","attest_author":"https://pith.science/pith/BNQTAMCWP7EWXMCZ47TGOQ4SVY/action/author_attestation","sign_citation":"https://pith.science/pith/BNQTAMCWP7EWXMCZ47TGOQ4SVY/action/citation_signature","submit_replication":"https://pith.science/pith/BNQTAMCWP7EWXMCZ47TGOQ4SVY/action/replication_record"}},"created_at":"2026-07-05T02:08:39.951078+00:00","updated_at":"2026-07-05T02:08:39.951078+00:00"}