{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DT2RVTFFIXG3RCBEQREF4KLS5T","short_pith_number":"pith:DT2RVTFF","schema_version":"1.0","canonical_sha256":"1cf51acca545cdb8882484485e2972ecf0117896affbb2439d06cf26077dd0b6","source":{"kind":"arxiv","id":"2011.00007","version":2},"attestation_state":"computed","paper":{"title":"Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eleanor Rieffel, Jahan Claes, Zhihui Wang","submitted_at":"2020-10-30T18:00:01Z","abstract_excerpt":"Randomized benchmarking (RB) is a powerful method for determining the error rate of experimental quantum gates. Traditional RB, however, is restricted to gatesets, such as the Clifford group, that form a unitary 2-design. The recently introduced character RB can benchmark more general gates using techniques from representation theory; up to now, however, this method has only been applied to \"multiplicity-free\" groups, a mathematical restriction on these groups. In this paper, we extend the original character RB derivation to explicitly treat non-multiplicity-free groups, and derive several app"},"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":"2011.00007","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-10-30T18:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"a7d886ca9430ad22540321e2e526e7b3b7c7666c0d8e5c2e6356ced8394fc967","abstract_canon_sha256":"7d24eacd0ad31b2dd9f943a1e74f2544481647d10a94b22de9c9eb0c3a856e88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:27:29.600328Z","signature_b64":"TE5/GH9GV8OmyZWJ/WHh9zG5mUnNOQdgyq8azYYUoJOYMElu1xx3+/7QpowQefmw41wALiuy1D5dvE+82rBhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf51acca545cdb8882484485e2972ecf0117896affbb2439d06cf26077dd0b6","last_reissued_at":"2026-07-05T02:27:29.599868Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:27:29.599868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eleanor Rieffel, Jahan Claes, Zhihui Wang","submitted_at":"2020-10-30T18:00:01Z","abstract_excerpt":"Randomized benchmarking (RB) is a powerful method for determining the error rate of experimental quantum gates. Traditional RB, however, is restricted to gatesets, such as the Clifford group, that form a unitary 2-design. The recently introduced character RB can benchmark more general gates using techniques from representation theory; up to now, however, this method has only been applied to \"multiplicity-free\" groups, a mathematical restriction on these groups. In this paper, we extend the original character RB derivation to explicitly treat non-multiplicity-free groups, and derive several app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.00007","kind":"arxiv","version":2},"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/2011.00007/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":"2011.00007","created_at":"2026-07-05T02:27:29.599924+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.00007v2","created_at":"2026-07-05T02:27:29.599924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00007","created_at":"2026-07-05T02:27:29.599924+00:00"},{"alias_kind":"pith_short_12","alias_value":"DT2RVTFFIXG3","created_at":"2026-07-05T02:27:29.599924+00:00"},{"alias_kind":"pith_short_16","alias_value":"DT2RVTFFIXG3RCBE","created_at":"2026-07-05T02:27:29.599924+00:00"},{"alias_kind":"pith_short_8","alias_value":"DT2RVTFF","created_at":"2026-07-05T02:27:29.599924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03886","citing_title":"Population rate coding in recurrent neuronal networks with undetermined-type neurons","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DT2RVTFFIXG3RCBEQREF4KLS5T","json":"https://pith.science/pith/DT2RVTFFIXG3RCBEQREF4KLS5T.json","graph_json":"https://pith.science/api/pith-number/DT2RVTFFIXG3RCBEQREF4KLS5T/graph.json","events_json":"https://pith.science/api/pith-number/DT2RVTFFIXG3RCBEQREF4KLS5T/events.json","paper":"https://pith.science/paper/DT2RVTFF"},"agent_actions":{"view_html":"https://pith.science/pith/DT2RVTFFIXG3RCBEQREF4KLS5T","download_json":"https://pith.science/pith/DT2RVTFFIXG3RCBEQREF4KLS5T.json","view_paper":"https://pith.science/paper/DT2RVTFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.00007&json=true","fetch_graph":"https://pith.science/api/pith-number/DT2RVTFFIXG3RCBEQREF4KLS5T/graph.json","fetch_events":"https://pith.science/api/pith-number/DT2RVTFFIXG3RCBEQREF4KLS5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DT2RVTFFIXG3RCBEQREF4KLS5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DT2RVTFFIXG3RCBEQREF4KLS5T/action/storage_attestation","attest_author":"https://pith.science/pith/DT2RVTFFIXG3RCBEQREF4KLS5T/action/author_attestation","sign_citation":"https://pith.science/pith/DT2RVTFFIXG3RCBEQREF4KLS5T/action/citation_signature","submit_replication":"https://pith.science/pith/DT2RVTFFIXG3RCBEQREF4KLS5T/action/replication_record"}},"created_at":"2026-07-05T02:27:29.599924+00:00","updated_at":"2026-07-05T02:27:29.599924+00:00"}