{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/how-to-efficiently-select-an-arbitrary","title":"How to efficiently select an arbitrary Clifford group element","arxiv_id":"1406.2170","date":"2014-06-09","proceeding":null,"authors":["Robert Koenig","John A. Smolin"],"abstract":"We give an algorithm which produces a unique element of the Clifford group $\\mathcal{C}_n$ on $n$ qubits from an integer $0\\le i < |\\mathcal{C}_n|$ (the number of elements in the group). The algorithm involves $O(n^3)$ operations. It is a variant of the subgroup algorithm by Diaconis and Shahshahani which is commonly applied to compact Lie groups. We provide an adaption for the symplectic group $Sp(2n,\\mathbb{F}_2)$ which provides, in addition to a canonical mapping from the integers to group elements $g$, a factorization of $g$ into a sequence of at most $4n$ symplectic transvections. The algorithm can be used to efficiently select random elements of $\\mathcal{C}_n$ which is often useful in quantum information theory and quantum computation. We also give an algorithm for the inverse map, indexing a group element in time $O(n^3)$.","url_abs":"https://arxiv.org/abs/1406.2170v1","url_pdf":"https://arxiv.org/pdf/1406.2170v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"how-to-efficiently-select-an-arbitrary","repo_url":"https://github.com/rharper2/Juqst","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}