Generators and relations for n-qubit Clifford operators

Peter Selinger

doi:10.2168/LMCS-11(2:10)2015

Peter Selinger - Generators and relations for n-qubit Clifford operators

lmcs:1570 - Logical Methods in Computer Science, June 19, 2015, Volume 11, Issue 2 - https://doi.org/10.2168/LMCS-11(2:10)2015

Generators and relations for n-qubit Clifford operatorsArticle

Authors: Peter Selinger

We define a normal form for Clifford circuits, and we prove that every Clifford operator has a unique normal form. Moreover, we present a rewrite system by which any Clifford circuit can be reduced to normal form. This yields a presentation of Clifford operators in terms of generators and relations.

https://doi.org/10.2168/LMCS-11(2:10)2015

Source: arXiv.org:1310.6813

Volume: Volume 11, Issue 2

Published on: June 19, 2015

Imported on: November 9, 2013

Keywords: Quantum Physics, Computer Science - Emerging Technologies, Computer Science - Logic in Computer Science

Licence: arXiv.org - Non-exclusive license to distribute

Funding:

Source : OpenAIRE Graph

Funder: Natural Sciences and Engineering Research Council of Canada

Classifications

Mathematics Subject Classification 2020¹

Sources:

[1] zbMATH Open.

Bibliographic References

26 Documents citing this article

Allen Zang;Xinan Chen;Eric Chitambar;Martin Suchara;Tian Zhong, 2025, No-Go Theorems for Universal Entanglement Purification, OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information), 134, 19, pp. 190803, 10.1103/physrevlett.134.190803, https://www.osti.gov/biblio/2565980.

Chin-Yen Lee;Wei-Hsuan Yu;Yung-Ning Peng;Ching-Jui Lai, 2025, On character table of Clifford groups, Journal of Mathematical Physics, 66, 2, 10.1063/5.0204167.

Cynthia Keeler;William Munizzi;Jason Pollack, 2025, Bounding entanglement entropy with Clifford double cosets, Physical review. A/Physical review, A, 112, 2, 10.1103/hfhg-2z68.

Alexandre Clément;Noé Delorme;Simon Perdrix, 2024, Minimal Equational Theories for Quantum Circuits, SPIRE - Sciences Po Institutional REpository, pp. 1-14, 10.1145/3661814.3662088.

Jacques Carette;Chris Heunen;Robin Kaarsgaard;Amr Sabry, 2024, With a Few Square Roots, Quantum Computing Is as Easy as Pi, Proceedings of the ACM on Programming Languages, 8, POPL, pp. 546-574, 10.1145/3632861, https://doi.org/10.1145/3632861.

Lingxuan Feng;Shunlong Luo, 2024, Clifford orbits and stabilizer states, Journal of Physics A Mathematical and Theoretical, 57, 39, pp. 395304, 10.1088/1751-8121/ad7710.

Matthew Amy;Neil J. Ross;Scott Wesley, 2024, A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits, Electronic Proceedings in Theoretical Computer Science, 406, pp. 1-43, 10.4204/eptcs.406.1, http://dx.doi.org/10.4204/eptcs.406.1.

Éloi Descamps;Borivoje Dakić, 2024, On the stabilizer formalism and its generalization, Journal of Physics A Mathematical and Theoretical, 57, 45, pp. 455301, 10.1088/1751-8121/ad8607.

Sridevi Kuriyattil;Tomohiro Hashizume;Gregory Bentsen;Andrew J. Daley, 2023, Onset of Scrambling as a Dynamical Transition in Tunable-Range Quantum Circuits, PRX Quantum, 4, 3, 10.1103/prxquantum.4.030325, https://doi.org/10.1103/prxquantum.4.030325.

Xiaoning Bian;Peter Selinger, 2023, Generators and Relations for 3-Qubit Clifford+CS Operators, Electronic Proceedings in Theoretical Computer Science, 384, pp. 114-126, 10.4204/eptcs.384.7, http://dx.doi.org/10.4204/eptcs.384.7.

Daniel Grier;Luke Schaeffer, 2022, The Classification of Clifford Gates over Qubits, Quantum, 6, pp. 734, 10.22331/q-2022-06-13-734, https://doi.org/10.22331/q-2022-06-13-734.

Liam Madden;Albert Akhriev;Andrea Simonetto, 2022, Sketching the Best Approximate Quantum Compiling Problem, 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 492-502, 10.1109/qce53715.2022.00071.

Liam Madden;Andrea Simonetto, 2022, Best Approximate Quantum Compiling Problems, ACM Transactions on Quantum Computing, 3, 2, pp. 1-29, 10.1145/3505181, https://doi.org/10.1145/3505181.

Tomohiro Hashizume;Gregory Bentsen;Andrew J. Daley, 2022, Measurement-induced phase transitions in sparse nonlocal scramblers, Physical Review Research, 4, 1, 10.1103/physrevresearch.4.013174, https://doi.org/10.1103/physrevresearch.4.013174.

Tomohiro Hashizume;Sridevi Kuriyattil;Andrew J. Daley;Gregory Bentsen, 2022, Tunable Geometries in Sparse Clifford Circuits, Symmetry, 14, 4, pp. 666, 10.3390/sym14040666, https://doi.org/10.3390/sym14040666.

Justin Makary;Neil J. Ross;Peter Selinger, 2021, Generators and Relations for Real Stabilizer Operators, Electronic Proceedings in Theoretical Computer Science, 343, pp. 14-36, 10.4204/eptcs.343.2, https://doi.org/10.4204/eptcs.343.2.

Long Ma;Jaron Sanders, 2021, Markov Chains and Hitting Times for Error Accumulation in Quantum Circuits, Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, pp. 36-55, 10.1007/978-3-030-92511-6_3.

Tomohiro Hashizume;Gregory S. Bentsen;Sebastian Weber;Andrew J. Daley, 2021, Deterministic Fast Scrambling with Neutral Atom Arrays, arXiv (Cornell University), 126, 20, pp. 200603, 10.1103/physrevlett.126.200603, http://arxiv.org/abs/2102.13117.

Alexander Cowtan;Silas Dilkes;Ross Duncan;Will Simmons;Seyon Sivarajah, 2020, Phase Gadget Synthesis for Shallow Circuits, Electronic Proceedings in Theoretical Computer Science, 318, pp. 213-228, 10.4204/eptcs.318.13, https://doi.org/10.4204/eptcs.318.13.

Matthew Amy;Andrew N. Glaudell;Neil J. Ross, 2020, Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits, Quantum, 4, pp. 252, 10.22331/q-2020-04-06-252, https://doi.org/10.22331/q-2020-04-06-252.

Seyon Sivarajah;Silas Dilkes;Alexander Cowtan;Will Simmons;Alec Edgington;Ross Duncan, 2020, t|ket⟩: a retargetable compiler for NISQ devices, arXiv (Cornell University), 6, 1, pp. 014003, 10.1088/2058-9565/ab8e92, http://arxiv.org/abs/2003.10611.

Andrew Fagan;Ross Duncan, 2019, Optimising Clifford Circuits with Quantomatic, Electronic Proceedings in Theoretical Computer Science, 287, pp. 85-105, 10.4204/eptcs.287.5, https://doi.org/10.4204/eptcs.287.5.

Carette, Titouan;Jeandel, Emmanuel;Perdrix, Simon;Vilmart, Renaud, 2019, Completeness of Graphical Languages for Mixed States Quantum Mechanics (Track B: Automata, Logic, Semantics, and Theory of Programming), DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 10.4230/lipics.icalp.2019.108, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.108.

Renaud Vilmart, 2019, A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics, pp. 1-10, 10.1109/lics.2019.8785765, https://hal.science/hal-01963426.

Vladimir Ivancevic;Darryn Reid;Peyam Pourbeik;Michael Pilling, 2019, Tensor-Centric Warfare VI: A Global Warfare Model, Intelligent Control and Automation, 10, 01, pp. 46-61, 10.4236/ica.2019.101003, https://doi.org/10.4236/ica.2019.101003.

Jacob Biamonte, 2017, Charged string tensor networks, Proceedings of the National Academy of Sciences, 114, 10, pp. 2447-2449, 10.1073/pnas.1700736114, https://doi.org/10.1073/pnas.1700736114.

Sources : OpenCitations, OpenAlex & Crossref

Share and export

Consultation statistics

This page has been seen 4071 times.

This article's PDF has been downloaded 1555 times.