{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:NUGNWXKX32BMBPV3J3LCKCGHSP","short_pith_number":"pith:NUGNWXKX","schema_version":"1.0","canonical_sha256":"6d0cdb5d57de82c0bebb4ed62508c793e7ddcd4ad9c99bf93f60f10b374bec4a","source":{"kind":"arxiv","id":"0707.0963","version":1},"attestation_state":"computed","paper":{"title":"Randomized Benchmarking of Quantum Gates","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. Langer, D. J. Wineland, D. Leibfried, E. Knill, J. Britton, J. D. Jost, R. B. Blakestad, R. Ozeri, R. Reichle, S. Seidelin","submitted_at":"2007-07-06T18:44:33Z","abstract_excerpt":"A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography. However, standard process tomography is limited by errors in state preparation, measurement and one-qubit gates. It suffers from inefficient scaling with number of qubits and does not detect adverse error-compounding when gates are composed in long sequences. An additional problem is due to the fact that desirable error probabilities for scalable quantum computin"},"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":"0707.0963","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-07-06T18:44:33Z","cross_cats_sorted":[],"title_canon_sha256":"562f02cd0d3c5df0657c10deeb0e3783e0435cfbf90a7e94c0e30003da9a587d","abstract_canon_sha256":"54d74fa45c9047a22c478e5961a8877d83d28c86e0c4685f6f728f6d3929f4be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:04:35.249927Z","signature_b64":"84gH7o8iU5yK3nLdU8LVc+Xhnx/QoEAyndqE6zynDRVrTlqwLgw3Ck7ouxfSEZjOOq/t382RqolZ5vhzlxylBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0cdb5d57de82c0bebb4ed62508c793e7ddcd4ad9c99bf93f60f10b374bec4a","last_reissued_at":"2026-07-04T17:04:35.249568Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:04:35.249568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Benchmarking of Quantum Gates","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. Langer, D. J. Wineland, D. Leibfried, E. Knill, J. Britton, J. D. Jost, R. B. Blakestad, R. Ozeri, R. Reichle, S. Seidelin","submitted_at":"2007-07-06T18:44:33Z","abstract_excerpt":"A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography. However, standard process tomography is limited by errors in state preparation, measurement and one-qubit gates. It suffers from inefficient scaling with number of qubits and does not detect adverse error-compounding when gates are composed in long sequences. An additional problem is due to the fact that desirable error probabilities for scalable quantum computin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.0963","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/0707.0963/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":"0707.0963","created_at":"2026-07-04T17:04:35.249629+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.0963v1","created_at":"2026-07-04T17:04:35.249629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.0963","created_at":"2026-07-04T17:04:35.249629+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUGNWXKX32BM","created_at":"2026-07-04T17:04:35.249629+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUGNWXKX32BMBPV3","created_at":"2026-07-04T17:04:35.249629+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUGNWXKX","created_at":"2026-07-04T17:04:35.249629+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21276","citing_title":"Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor","ref_index":77,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NUGNWXKX32BMBPV3J3LCKCGHSP","json":"https://pith.science/pith/NUGNWXKX32BMBPV3J3LCKCGHSP.json","graph_json":"https://pith.science/api/pith-number/NUGNWXKX32BMBPV3J3LCKCGHSP/graph.json","events_json":"https://pith.science/api/pith-number/NUGNWXKX32BMBPV3J3LCKCGHSP/events.json","paper":"https://pith.science/paper/NUGNWXKX"},"agent_actions":{"view_html":"https://pith.science/pith/NUGNWXKX32BMBPV3J3LCKCGHSP","download_json":"https://pith.science/pith/NUGNWXKX32BMBPV3J3LCKCGHSP.json","view_paper":"https://pith.science/paper/NUGNWXKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.0963&json=true","fetch_graph":"https://pith.science/api/pith-number/NUGNWXKX32BMBPV3J3LCKCGHSP/graph.json","fetch_events":"https://pith.science/api/pith-number/NUGNWXKX32BMBPV3J3LCKCGHSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUGNWXKX32BMBPV3J3LCKCGHSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUGNWXKX32BMBPV3J3LCKCGHSP/action/storage_attestation","attest_author":"https://pith.science/pith/NUGNWXKX32BMBPV3J3LCKCGHSP/action/author_attestation","sign_citation":"https://pith.science/pith/NUGNWXKX32BMBPV3J3LCKCGHSP/action/citation_signature","submit_replication":"https://pith.science/pith/NUGNWXKX32BMBPV3J3LCKCGHSP/action/replication_record"}},"created_at":"2026-07-04T17:04:35.249629+00:00","updated_at":"2026-07-04T17:04:35.249629+00:00"}