{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2JCTIHC6Q6X45JCIBOEU7BFYYI","short_pith_number":"pith:2JCTIHC6","schema_version":"1.0","canonical_sha256":"d245341c5e87afcea4480b894f84b8c215c3a86aa5f3b229a0004e32a683da54","source":{"kind":"arxiv","id":"1902.08543","version":1},"attestation_state":"computed","paper":{"title":"Characterizing large-scale quantum computers via cycle benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Erhard, Esteban Adrian Martinez, Joel James Wallman, Joseph Emerson, Lukas Postler, Michael Meth, Philipp Schindler, Rainer Blatt, Roman Stricker, Thomas Monz","submitted_at":"2019-02-22T16:08:07Z","abstract_excerpt":"Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the various errors that accumulate during an algorithm running on large-scale processors. Current characterization techniques are unable to adequately account for the exponentially large set of potential errors, including cross-talk and other correlated noise sources. Here we develop cycle benchmarking, a rigorous and practically scalable protocol for characterizing local and global errors across mult"},"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":"1902.08543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-22T16:08:07Z","cross_cats_sorted":[],"title_canon_sha256":"96b8c34c91be1d6d6fcd68f04085131e6ede28aa47c02f6ed646eab491e7c8b7","abstract_canon_sha256":"436c2ac8494f7172f7d195d64df2f2ac5e817a18f0829a9761821ddda8ceb70f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:30:58.084463Z","signature_b64":"a5mQPooSW9lBTlHcaVctGK5RKJftBwPp2qFzYm6WvjQwb2lTSxgb4BdXQnH+krJ7reunFo6ZLBK/czLu71oACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d245341c5e87afcea4480b894f84b8c215c3a86aa5f3b229a0004e32a683da54","last_reissued_at":"2026-07-05T00:30:58.083980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:30:58.083980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing large-scale quantum computers via cycle benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Erhard, Esteban Adrian Martinez, Joel James Wallman, Joseph Emerson, Lukas Postler, Michael Meth, Philipp Schindler, Rainer Blatt, Roman Stricker, Thomas Monz","submitted_at":"2019-02-22T16:08:07Z","abstract_excerpt":"Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the various errors that accumulate during an algorithm running on large-scale processors. Current characterization techniques are unable to adequately account for the exponentially large set of potential errors, including cross-talk and other correlated noise sources. Here we develop cycle benchmarking, a rigorous and practically scalable protocol for characterizing local and global errors across mult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08543","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/1902.08543/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":"1902.08543","created_at":"2026-07-05T00:30:58.084037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08543v1","created_at":"2026-07-05T00:30:58.084037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08543","created_at":"2026-07-05T00:30:58.084037+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JCTIHC6Q6X4","created_at":"2026-07-05T00:30:58.084037+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JCTIHC6Q6X45JCI","created_at":"2026-07-05T00:30:58.084037+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JCTIHC6","created_at":"2026-07-05T00:30:58.084037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.10997","citing_title":"Reliable high-accuracy error mitigation for utility-scale quantum circuits","ref_index":124,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2JCTIHC6Q6X45JCIBOEU7BFYYI","json":"https://pith.science/pith/2JCTIHC6Q6X45JCIBOEU7BFYYI.json","graph_json":"https://pith.science/api/pith-number/2JCTIHC6Q6X45JCIBOEU7BFYYI/graph.json","events_json":"https://pith.science/api/pith-number/2JCTIHC6Q6X45JCIBOEU7BFYYI/events.json","paper":"https://pith.science/paper/2JCTIHC6"},"agent_actions":{"view_html":"https://pith.science/pith/2JCTIHC6Q6X45JCIBOEU7BFYYI","download_json":"https://pith.science/pith/2JCTIHC6Q6X45JCIBOEU7BFYYI.json","view_paper":"https://pith.science/paper/2JCTIHC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08543&json=true","fetch_graph":"https://pith.science/api/pith-number/2JCTIHC6Q6X45JCIBOEU7BFYYI/graph.json","fetch_events":"https://pith.science/api/pith-number/2JCTIHC6Q6X45JCIBOEU7BFYYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JCTIHC6Q6X45JCIBOEU7BFYYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JCTIHC6Q6X45JCIBOEU7BFYYI/action/storage_attestation","attest_author":"https://pith.science/pith/2JCTIHC6Q6X45JCIBOEU7BFYYI/action/author_attestation","sign_citation":"https://pith.science/pith/2JCTIHC6Q6X45JCIBOEU7BFYYI/action/citation_signature","submit_replication":"https://pith.science/pith/2JCTIHC6Q6X45JCIBOEU7BFYYI/action/replication_record"}},"created_at":"2026-07-05T00:30:58.084037+00:00","updated_at":"2026-07-05T00:30:58.084037+00:00"}