How to efficiently select an arbitrary Clifford group element
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
We give an algorithm which produces a unique element of the Clifford group on n qubits (Cn) from an integer 0≤i<Cn (the number of elements in the group). The algorithm involves O(n3) operations and 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 Cn which are 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(n3).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Self-citationImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 2×
“…(x , y ) : # f i n d s h1 , h2 such that y = Z h1 Z h2 x # Lemma 2 in the text # Note that i f only one tr ansvection i s required output [ 1 ] w i l l be # zero and applying the all − zero tr ansvection does nothing . output=zeros ((2 , s i z e (x )) , dtype=int8 ) i f array equal (x , y…”
BackgroundRandomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019 · cited 1×
“…is not universal for quantum computation [9], it is central in the field of quantum error-correction codes [8], and the use of random elements of the Clifford group has numerous applications, from establishing bounds on quantum capacities [2] to randomized benchmarking [7, 10, 11] to data hiding [6].”
BackgroundStabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Scalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502 · cited 1×
“Though the group is not universal for quantum computation [9], it is central in the field of quantum error-correction codes [8], and the use of random elements of the Clifford group has numerous applications, from establishing bounds on quantum capacities [2] to randomized benchmarking [7, 10, 11] to data hiding [6].”
BackgroundSymplectic Geometry and Quantum Mechanics
de Gosson, M. (2006) · doi:10.1007/3-7643-7575-2 · Cited by 407
Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
Dehaene, J., & De Moor, B. (2003) · Physical Review A · doi:10.1103/physreva.68.042318 · Cited by 183
Cited by
The randomized measurement toolbox
Elben, A., Flammia, S. T., Huang, H.-Y., Kueng, R., Preskill, J., Vermersch, B., & Zoller, P. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00535-2 · Cited by 355
Universal logic with encoded spin qubits in silicon
Weinstein, A. J., Reed, M. D., Jones, A. M., Andrews, R. W., Barnes, D., Blumoff, J. Z., Euliss, L. E., Eng, K., Fong, B. H., Ha, S. D., et al. (2023) · Nature · doi:10.1038/s41586-023-05777-3 · Cited by 124
Direct Randomized Benchmarking for Multiqubit Devices
Proctor, T. J., Carignan-Dugas, A., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.030503 · Cited by 118
“To do this we used the method and Python code of Koenig and Smolin [76], which uniformly samples a 2 n × 2 n symplectic matrix over [0,1] (we integrated this code into the pyGSTi Python package [64]).”
BackgroundMethodExperimental Estimation of Quantum State Properties from Classical Shadows
Struchalin, G. I., Zagorovskii, Y. A., Kovlakov, E. V., Straupe, S. S., & Kulik, S. P. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010307 · Cited by 94
Anticoncentration theorems for schemes showing a quantum speedup
Hangleiter, D., Bermejo-Vega, J., Schwarz, M., & Eisert, J. (2018) · Quantum · doi:10.22331/q-2018-05-22-65 · Cited by 58
Metadata
- Authors
- Koenig, R., & Smolin, J. A.
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 2014-12-01
- Volume
- 55
- Issue
- 12
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W2068704276
- Cited by
- 72
- References
- 7
- FWCI
- 0.33
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: How to efficiently select an arbitrary Clifford group element. https://app.cochat.ai/papers/10.1063/1.4903507
- The paper
- Koenig, R., & Smolin, J. A. (2014). How to efficiently select an arbitrary Clifford group element. Journal of Mathematical Physics. https://doi.org/10.1063/1.4903507
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.