{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:77ZRUG4V4QAHXZMDCPGQI4HHZB","short_pith_number":"pith:77ZRUG4V","schema_version":"1.0","canonical_sha256":"fff31a1b95e4007be58313cd0470e7c851fc59073a9828db6f570b601fe1b6ea","source":{"kind":"arxiv","id":"2002.09524","version":3},"attestation_state":"computed","paper":{"title":"Efficient unitary designs with a system-size independent number of non-Clifford gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"David Gross, Felipe Montealegre-Mora, Ingo Roth, Jens Eisert, Jonas Haferkamp, Markus Heinrich","submitted_at":"2020-02-21T19:41:07Z","abstract_excerpt":"Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one often resorts to $t$-designs. Unitary $t$-designs mimic the Haar-measure up to $t$-th moments. It is known that Clifford operations can implement at most $3$-designs. In this work, we quantify the non-Clifford resources required to break this barrier. We find that it suffices to inject $O(t^{4}\\log^{2}(t)\\log(1/\\varepsilon))$ many non-Clifford gates into a polynomial-depth random Clifford circuit to o"},"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":"2002.09524","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-02-21T19:41:07Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"b8aa2470c87fd0a4141fb2687ab665a6db55689e6146520345201a080269426b","abstract_canon_sha256":"5305d182dc76dc5dc87e758e01785ef5e3a65ff168f6d2758c56948aea54f6c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:32.527299Z","signature_b64":"tzEINQ2ng90A+8ZlpyfNYpLAZg1gpiLFV8Cm7lXMMN35LIu8u+kUGk9dp5LjGnVCdzrkTX7ZM5exk1RsqEx+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fff31a1b95e4007be58313cd0470e7c851fc59073a9828db6f570b601fe1b6ea","last_reissued_at":"2026-07-05T06:19:32.526947Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:32.526947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient unitary designs with a system-size independent number of non-Clifford gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"David Gross, Felipe Montealegre-Mora, Ingo Roth, Jens Eisert, Jonas Haferkamp, Markus Heinrich","submitted_at":"2020-02-21T19:41:07Z","abstract_excerpt":"Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one often resorts to $t$-designs. Unitary $t$-designs mimic the Haar-measure up to $t$-th moments. It is known that Clifford operations can implement at most $3$-designs. In this work, we quantify the non-Clifford resources required to break this barrier. We find that it suffices to inject $O(t^{4}\\log^{2}(t)\\log(1/\\varepsilon))$ many non-Clifford gates into a polynomial-depth random Clifford circuit to o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.09524","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/2002.09524/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":"2002.09524","created_at":"2026-07-05T06:19:32.527008+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.09524v3","created_at":"2026-07-05T06:19:32.527008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.09524","created_at":"2026-07-05T06:19:32.527008+00:00"},{"alias_kind":"pith_short_12","alias_value":"77ZRUG4V4QAH","created_at":"2026-07-05T06:19:32.527008+00:00"},{"alias_kind":"pith_short_16","alias_value":"77ZRUG4V4QAHXZMD","created_at":"2026-07-05T06:19:32.527008+00:00"},{"alias_kind":"pith_short_8","alias_value":"77ZRUG4V","created_at":"2026-07-05T06:19:32.527008+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/77ZRUG4V4QAHXZMDCPGQI4HHZB","json":"https://pith.science/pith/77ZRUG4V4QAHXZMDCPGQI4HHZB.json","graph_json":"https://pith.science/api/pith-number/77ZRUG4V4QAHXZMDCPGQI4HHZB/graph.json","events_json":"https://pith.science/api/pith-number/77ZRUG4V4QAHXZMDCPGQI4HHZB/events.json","paper":"https://pith.science/paper/77ZRUG4V"},"agent_actions":{"view_html":"https://pith.science/pith/77ZRUG4V4QAHXZMDCPGQI4HHZB","download_json":"https://pith.science/pith/77ZRUG4V4QAHXZMDCPGQI4HHZB.json","view_paper":"https://pith.science/paper/77ZRUG4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.09524&json=true","fetch_graph":"https://pith.science/api/pith-number/77ZRUG4V4QAHXZMDCPGQI4HHZB/graph.json","fetch_events":"https://pith.science/api/pith-number/77ZRUG4V4QAHXZMDCPGQI4HHZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77ZRUG4V4QAHXZMDCPGQI4HHZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77ZRUG4V4QAHXZMDCPGQI4HHZB/action/storage_attestation","attest_author":"https://pith.science/pith/77ZRUG4V4QAHXZMDCPGQI4HHZB/action/author_attestation","sign_citation":"https://pith.science/pith/77ZRUG4V4QAHXZMDCPGQI4HHZB/action/citation_signature","submit_replication":"https://pith.science/pith/77ZRUG4V4QAHXZMDCPGQI4HHZB/action/replication_record"}},"created_at":"2026-07-05T06:19:32.527008+00:00","updated_at":"2026-07-05T06:19:32.527008+00:00"}