{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:73IGQPPUSIXLMAT5SVN2RFOT2C","short_pith_number":"pith:73IGQPPU","schema_version":"1.0","canonical_sha256":"fed0683df4922eb6027d955ba895d3d09630d425ab0e00b3112e7984b910839d","source":{"kind":"arxiv","id":"0903.5236","version":1},"attestation_state":"computed","paper":{"title":"Large Deviation Bounds for k-designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Richard A. Low","submitted_at":"2009-03-30T15:07:25Z","abstract_excerpt":"We present a technique for derandomising large deviation bounds of functions on the unitary group. We replace the Haar distribution with a pseudo-random distribution, a k-design. k-designs have the first k moments equal to those of the Haar distribution. The advantage of this is that (approximate) k-designs can be implemented efficiently, whereas Haar random unitaries cannot. We find large deviation bounds for unitaries chosen from a k-design and then illustrate this general technique with three applications. We first show that the von Neumann entropy of a pseudo-random state is almost maximal"},"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":"0903.5236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-30T15:07:25Z","cross_cats_sorted":[],"title_canon_sha256":"fccf43530004b15ecbd5261d6fe322f26ec3a5f2ac577b7d2c3f2e4081efc42f","abstract_canon_sha256":"8410c8b681935b66f193ccd2a6c20222aa53af3df6641c28ff31c0791fd470bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:18.512216Z","signature_b64":"zvU4wtqeXzV+m+SEgnZneQ4njkZtBXgxOfsV0foF69Je55U3GlJ/cm6KsmWPF71BbRLkHT31HaeuiwACrEjwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fed0683df4922eb6027d955ba895d3d09630d425ab0e00b3112e7984b910839d","last_reissued_at":"2026-05-18T02:14:18.508693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:18.508693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Deviation Bounds for k-designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Richard A. Low","submitted_at":"2009-03-30T15:07:25Z","abstract_excerpt":"We present a technique for derandomising large deviation bounds of functions on the unitary group. We replace the Haar distribution with a pseudo-random distribution, a k-design. k-designs have the first k moments equal to those of the Haar distribution. The advantage of this is that (approximate) k-designs can be implemented efficiently, whereas Haar random unitaries cannot. We find large deviation bounds for unitaries chosen from a k-design and then illustrate this general technique with three applications. We first show that the von Neumann entropy of a pseudo-random state is almost maximal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.5236","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":""},"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":"0903.5236","created_at":"2026-05-18T02:14:18.511436+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.5236v1","created_at":"2026-05-18T02:14:18.511436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.5236","created_at":"2026-05-18T02:14:18.511436+00:00"},{"alias_kind":"pith_short_12","alias_value":"73IGQPPUSIXL","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"73IGQPPUSIXLMAT5","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"73IGQPPU","created_at":"2026-05-18T12:25:58.837520+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/73IGQPPUSIXLMAT5SVN2RFOT2C","json":"https://pith.science/pith/73IGQPPUSIXLMAT5SVN2RFOT2C.json","graph_json":"https://pith.science/api/pith-number/73IGQPPUSIXLMAT5SVN2RFOT2C/graph.json","events_json":"https://pith.science/api/pith-number/73IGQPPUSIXLMAT5SVN2RFOT2C/events.json","paper":"https://pith.science/paper/73IGQPPU"},"agent_actions":{"view_html":"https://pith.science/pith/73IGQPPUSIXLMAT5SVN2RFOT2C","download_json":"https://pith.science/pith/73IGQPPUSIXLMAT5SVN2RFOT2C.json","view_paper":"https://pith.science/paper/73IGQPPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.5236&json=true","fetch_graph":"https://pith.science/api/pith-number/73IGQPPUSIXLMAT5SVN2RFOT2C/graph.json","fetch_events":"https://pith.science/api/pith-number/73IGQPPUSIXLMAT5SVN2RFOT2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73IGQPPUSIXLMAT5SVN2RFOT2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73IGQPPUSIXLMAT5SVN2RFOT2C/action/storage_attestation","attest_author":"https://pith.science/pith/73IGQPPUSIXLMAT5SVN2RFOT2C/action/author_attestation","sign_citation":"https://pith.science/pith/73IGQPPUSIXLMAT5SVN2RFOT2C/action/citation_signature","submit_replication":"https://pith.science/pith/73IGQPPUSIXLMAT5SVN2RFOT2C/action/replication_record"}},"created_at":"2026-05-18T02:14:18.511436+00:00","updated_at":"2026-05-18T02:14:18.511436+00:00"}