{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SOHMAMKQY5WIQO2KNGXVKOAK7H","short_pith_number":"pith:SOHMAMKQ","schema_version":"1.0","canonical_sha256":"938ec03150c76c883b4a69af55380af9e462be7f0cf0d109ce0ac321146441e2","source":{"kind":"arxiv","id":"1502.07514","version":4},"attestation_state":"computed","paper":{"title":"Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Christoph Hirche, Ciara Morgan, Yoshifumi Nakata","submitted_at":"2015-02-26T11:41:56Z","abstract_excerpt":"Unitary $2$-designs are random unitaries simulating up to the second order statistical moments of the uniformly distributed random unitaries, often referred to as Haar random unitaries. They are used in a wide variety of theoretical and practical quantum information protocols, and also have been used to model the dynamics in complex quantum many-body systems. Here, we show that unitary $2$-designs can be approximately implemented by alternately repeating random unitaries diagonal in the Pauli-$Z$ basis and that in the Pauli-$X$ basis. We also provide a converse about the number of repetitions "},"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":"1502.07514","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-02-26T11:41:56Z","cross_cats_sorted":[],"title_canon_sha256":"de255c7e660317cd119537f26863c24c5cb610d86ea358eb153224934e47f0b4","abstract_canon_sha256":"e9fc6ac38c1897a2c676035ae77bbd50f89d0936675f7c72234bd415e1a11981"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:21.386501Z","signature_b64":"s1l3DGtwzrHlLUaQnm9Z8DgMmMhSpgQj5mk509pl7OGMHsZK6ckuBRKbgnfOTtAqJBCqzGw5UNZsxqbe3jGvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"938ec03150c76c883b4a69af55380af9e462be7f0cf0d109ce0ac321146441e2","last_reissued_at":"2026-05-18T00:43:21.385947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:21.385947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Christoph Hirche, Ciara Morgan, Yoshifumi Nakata","submitted_at":"2015-02-26T11:41:56Z","abstract_excerpt":"Unitary $2$-designs are random unitaries simulating up to the second order statistical moments of the uniformly distributed random unitaries, often referred to as Haar random unitaries. They are used in a wide variety of theoretical and practical quantum information protocols, and also have been used to model the dynamics in complex quantum many-body systems. Here, we show that unitary $2$-designs can be approximately implemented by alternately repeating random unitaries diagonal in the Pauli-$Z$ basis and that in the Pauli-$X$ basis. We also provide a converse about the number of repetitions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07514","kind":"arxiv","version":4},"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":"1502.07514","created_at":"2026-05-18T00:43:21.386044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07514v4","created_at":"2026-05-18T00:43:21.386044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07514","created_at":"2026-05-18T00:43:21.386044+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOHMAMKQY5WI","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOHMAMKQY5WIQO2K","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOHMAMKQ","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2404.18502","citing_title":"Towards Classical Software Verification using Quantum Computers","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SOHMAMKQY5WIQO2KNGXVKOAK7H","json":"https://pith.science/pith/SOHMAMKQY5WIQO2KNGXVKOAK7H.json","graph_json":"https://pith.science/api/pith-number/SOHMAMKQY5WIQO2KNGXVKOAK7H/graph.json","events_json":"https://pith.science/api/pith-number/SOHMAMKQY5WIQO2KNGXVKOAK7H/events.json","paper":"https://pith.science/paper/SOHMAMKQ"},"agent_actions":{"view_html":"https://pith.science/pith/SOHMAMKQY5WIQO2KNGXVKOAK7H","download_json":"https://pith.science/pith/SOHMAMKQY5WIQO2KNGXVKOAK7H.json","view_paper":"https://pith.science/paper/SOHMAMKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07514&json=true","fetch_graph":"https://pith.science/api/pith-number/SOHMAMKQY5WIQO2KNGXVKOAK7H/graph.json","fetch_events":"https://pith.science/api/pith-number/SOHMAMKQY5WIQO2KNGXVKOAK7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOHMAMKQY5WIQO2KNGXVKOAK7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOHMAMKQY5WIQO2KNGXVKOAK7H/action/storage_attestation","attest_author":"https://pith.science/pith/SOHMAMKQY5WIQO2KNGXVKOAK7H/action/author_attestation","sign_citation":"https://pith.science/pith/SOHMAMKQY5WIQO2KNGXVKOAK7H/action/citation_signature","submit_replication":"https://pith.science/pith/SOHMAMKQY5WIQO2KNGXVKOAK7H/action/replication_record"}},"created_at":"2026-05-18T00:43:21.386044+00:00","updated_at":"2026-05-18T00:43:21.386044+00:00"}