{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VQ2GZFPWZKFQ4R63WR3GOV4WKV","short_pith_number":"pith:VQ2GZFPW","schema_version":"1.0","canonical_sha256":"ac346c95f6ca8b0e47dbb476675796556d5a518e82b26624e796b2bd1b81f3ff","source":{"kind":"arxiv","id":"2212.06181","version":3},"attestation_state":"computed","paper":{"title":"Randomized benchmarking with random quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ingo Roth, Markus Heinrich, Martin Kliesch","submitted_at":"2022-12-12T19:00:19Z","abstract_excerpt":"In its many variants, randomized benchmarking (RB) is a broadly used technique for assessing the quality of gate implementations on quantum computers. A detailed theoretical understanding and general guarantees exist for the functioning and interpretation of RB protocols if the gates under scrutiny are drawn uniformly at random from a compact group. In contrast, many practically attractive and scalable RB protocols implement random quantum circuits with local gates randomly drawn from some gate-set. Despite their abundance in practice, for those non-uniform RB protocols, general guarantees for"},"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":"2212.06181","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-12T19:00:19Z","cross_cats_sorted":[],"title_canon_sha256":"533247b594fb57506c552a0309ca704550757b8c071674103ae02e1232d8d132","abstract_canon_sha256":"fdd270813708e3352860daf0e0872dad1960b5da2b22a2924dc20a45d3060852"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:47.423004Z","signature_b64":"8Tr8LNJ9Dd3FWt0jo3otDRETMb6s8OUMpRigWTyiLxaYGGjo3zjgfoShlobc2kYOfgKH24AWYr/8UkV1OMaxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac346c95f6ca8b0e47dbb476675796556d5a518e82b26624e796b2bd1b81f3ff","last_reissued_at":"2026-07-05T06:24:47.422615Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:47.422615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized benchmarking with random quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ingo Roth, Markus Heinrich, Martin Kliesch","submitted_at":"2022-12-12T19:00:19Z","abstract_excerpt":"In its many variants, randomized benchmarking (RB) is a broadly used technique for assessing the quality of gate implementations on quantum computers. A detailed theoretical understanding and general guarantees exist for the functioning and interpretation of RB protocols if the gates under scrutiny are drawn uniformly at random from a compact group. In contrast, many practically attractive and scalable RB protocols implement random quantum circuits with local gates randomly drawn from some gate-set. Despite their abundance in practice, for those non-uniform RB protocols, general guarantees for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06181","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/2212.06181/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":"2212.06181","created_at":"2026-07-05T06:24:47.422670+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.06181v3","created_at":"2026-07-05T06:24:47.422670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06181","created_at":"2026-07-05T06:24:47.422670+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQ2GZFPWZKFQ","created_at":"2026-07-05T06:24:47.422670+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQ2GZFPWZKFQ4R63","created_at":"2026-07-05T06:24:47.422670+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQ2GZFPW","created_at":"2026-07-05T06:24:47.422670+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23800","citing_title":"Unitary Designs from Doped Matchgate Circuits","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22909","citing_title":"Sample-efficient benchmarking of shallow all-to-all random quantum circuits","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2412.18578","citing_title":"Randomized Benchmarking with Synthetic Quantum Circuits","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQ2GZFPWZKFQ4R63WR3GOV4WKV","json":"https://pith.science/pith/VQ2GZFPWZKFQ4R63WR3GOV4WKV.json","graph_json":"https://pith.science/api/pith-number/VQ2GZFPWZKFQ4R63WR3GOV4WKV/graph.json","events_json":"https://pith.science/api/pith-number/VQ2GZFPWZKFQ4R63WR3GOV4WKV/events.json","paper":"https://pith.science/paper/VQ2GZFPW"},"agent_actions":{"view_html":"https://pith.science/pith/VQ2GZFPWZKFQ4R63WR3GOV4WKV","download_json":"https://pith.science/pith/VQ2GZFPWZKFQ4R63WR3GOV4WKV.json","view_paper":"https://pith.science/paper/VQ2GZFPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.06181&json=true","fetch_graph":"https://pith.science/api/pith-number/VQ2GZFPWZKFQ4R63WR3GOV4WKV/graph.json","fetch_events":"https://pith.science/api/pith-number/VQ2GZFPWZKFQ4R63WR3GOV4WKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQ2GZFPWZKFQ4R63WR3GOV4WKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQ2GZFPWZKFQ4R63WR3GOV4WKV/action/storage_attestation","attest_author":"https://pith.science/pith/VQ2GZFPWZKFQ4R63WR3GOV4WKV/action/author_attestation","sign_citation":"https://pith.science/pith/VQ2GZFPWZKFQ4R63WR3GOV4WKV/action/citation_signature","submit_replication":"https://pith.science/pith/VQ2GZFPWZKFQ4R63WR3GOV4WKV/action/replication_record"}},"created_at":"2026-07-05T06:24:47.422670+00:00","updated_at":"2026-07-05T06:24:47.422670+00:00"}