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

Submitted 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

18 Documents citing this article

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, https://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, arXiv (Cornell University), Sketching the Best Approximate Quantum Compiling Problem, pp. 492-502, 2022, Broomfield, CO, USA, 10.1109/qce53715.2022.00071, https://arxiv.org/abs/2205.04025.

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, arXiv (Cornell University), 343, pp. 14-36, 10.4204/eptcs.343.2.

Long Ma;Jaron Sanders, Springer eBooks, Markov Chains and Hitting Times for Error Accumulation in Quantum Circuits, pp. 36-55, 2021, 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, 10.1103/physrevlett.126.200603, https://arxiv.org/abs/2102.13117.

Alexander Cowtan;Silas Dilkes;Ross Duncan;Will Simmons;Seyon Sivarajah, 2020, Phase Gadget Synthesis for Shallow Circuits, arXiv (Cornell University), 318, pp. 213-228, 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;et al., 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, arXiv (Cornell University), 287, pp. 85-105, 10.4204/eptcs.287.5.

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

Titouan Carette;Emmanuel Jeandel;Simon Perdrix;Renaud Vilmart, Completeness of Graphical Languages for Mixed States Quantum Mechanics, 2019, 10.4230/lipics.icalp.2019.108, https://hal.science/hal-02025720.

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 2219 times.

This article's PDF has been downloaded 778 times.