How to efficiently select an arbitrary Clifford group element

DOI10.1063/1.4903507zbMath1308.81060arXiv1406.2170OpenAlexW3100110742MaRDI QIDQ2939214

John A. Smolin, Robert Koenig

Publication date: 19 January 2015

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.2170

zbMATH Keywords

Clifford groupsymplectic Gram-Schmidt

Mathematics Subject Classification ID

Quantum computation (81P68) Applications of Lie groups to the sciences; explicit representations (22E70) Clifford algebras, spinors (15A66)

Related Items (6)

Mixing and localization in random time-periodic quantum circuits of Clifford unitaries ⋮ Approximate unitary 3-designs from transvection Markov chains ⋮ Efficient unitary designs with a system-size independent number of non-Clifford gates ⋮ Graph states and the variety of principal minors ⋮ Unnamed Item ⋮ Approximate randomized benchmarking for finite groups

Cites Work

• Unnamed Item
• How to generate random matrices from the classical compact groups
• Optimal symplectic Householder transformations for \(SR\) decomposition
• Symplectic geometry and quantum mechanics
• The Subgroup Algorithm for Generating Uniform Random Variables
• Quantum data hiding
• Quantum error correction via codes over GF(4)
• Mixed-state entanglement and quantum error correction

This page was built for publication: How to efficiently select an arbitrary Clifford group element