{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PQD5VUESCDFRQMXXBPRKACOY2Z","short_pith_number":"pith:PQD5VUES","schema_version":"1.0","canonical_sha256":"7c07dad09210cb1832f70be2a009d8d6678ebadb5335062041bb1566aad00e56","source":{"kind":"arxiv","id":"1702.01852","version":1},"attestation_state":"computed","paper":{"title":"Experimental Comparison of Two Quantum Computing Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"C. Figgatt, C. Monroe, D. Maslov, K. A. Landsman, K. Wright, M. Roetteler, N. M. Linke, S. Debnath","submitted_at":"2017-02-07T02:42:47Z","abstract_excerpt":"We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programmed in a way that is blind to the underlying hardware, thus allowing the first comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that employ more connectivity "},"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":"1702.01852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-02-07T02:42:47Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"bc14dfb81a1a12e27bfeb60ebd73f662f5ea059a38212f70ca8ab078aed0fdc9","abstract_canon_sha256":"2f971cf5df2f1f671651edd54f986aa99a785427b32c27c0c80bcbc09c688ad9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:33.331132Z","signature_b64":"KiU69WoNGb4sLxsFyBet39q85OzA06+5LGQX6Uhy9xnYVA/Wre9bdgQMzbkx6fI6WqMn/3vPLA1nrInfCw2tAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c07dad09210cb1832f70be2a009d8d6678ebadb5335062041bb1566aad00e56","last_reissued_at":"2026-05-18T00:47:33.330564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:33.330564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Experimental Comparison of Two Quantum Computing Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"C. Figgatt, C. Monroe, D. Maslov, K. A. Landsman, K. Wright, M. Roetteler, N. M. Linke, S. Debnath","submitted_at":"2017-02-07T02:42:47Z","abstract_excerpt":"We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programmed in a way that is blind to the underlying hardware, thus allowing the first comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that employ more connectivity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01852","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":""},"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":"1702.01852","created_at":"2026-05-18T00:47:33.330643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01852v1","created_at":"2026-05-18T00:47:33.330643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01852","created_at":"2026-05-18T00:47:33.330643+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQD5VUESCDFR","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQD5VUESCDFRQMXX","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQD5VUES","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11822","citing_title":"Fault-tolerant quantum computation with a neutral atom processor","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PQD5VUESCDFRQMXXBPRKACOY2Z","json":"https://pith.science/pith/PQD5VUESCDFRQMXXBPRKACOY2Z.json","graph_json":"https://pith.science/api/pith-number/PQD5VUESCDFRQMXXBPRKACOY2Z/graph.json","events_json":"https://pith.science/api/pith-number/PQD5VUESCDFRQMXXBPRKACOY2Z/events.json","paper":"https://pith.science/paper/PQD5VUES"},"agent_actions":{"view_html":"https://pith.science/pith/PQD5VUESCDFRQMXXBPRKACOY2Z","download_json":"https://pith.science/pith/PQD5VUESCDFRQMXXBPRKACOY2Z.json","view_paper":"https://pith.science/paper/PQD5VUES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01852&json=true","fetch_graph":"https://pith.science/api/pith-number/PQD5VUESCDFRQMXXBPRKACOY2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/PQD5VUESCDFRQMXXBPRKACOY2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQD5VUESCDFRQMXXBPRKACOY2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQD5VUESCDFRQMXXBPRKACOY2Z/action/storage_attestation","attest_author":"https://pith.science/pith/PQD5VUESCDFRQMXXBPRKACOY2Z/action/author_attestation","sign_citation":"https://pith.science/pith/PQD5VUESCDFRQMXXBPRKACOY2Z/action/citation_signature","submit_replication":"https://pith.science/pith/PQD5VUESCDFRQMXXBPRKACOY2Z/action/replication_record"}},"created_at":"2026-05-18T00:47:33.330643+00:00","updated_at":"2026-05-18T00:47:33.330643+00:00"}