Approximate unitary 3-designs from transvection Markov chains
DOI10.1007/s10623-021-01000-4zbMath1504.81064arXiv2011.00128OpenAlexW3097907863WikidataQ114849805 ScholiaQ114849805MaRDI QIDQ2168080
Xinyu Tan, Narayanan Rengaswamy, Robert Calderbank
Publication date: 31 August 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.00128
Computational methods in Markov chains (60J22) Applications of graph theory (05C90) Quantum computation (81P68) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Clifford algebras, spinors (15A66) Set functions and measures on topological groups or semigroups, Haar measures, invariant measures (28C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal symplectic Householder transformations for \(SR\) decomposition
- Unitary designs and codes
- Random quantum circuits are approximate 2-designs
- How to efficiently select an arbitrary Clifford group element
- Quantum Computation and Quantum Information
- A Decoupling Approach to the Quantum Capacity
- Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Quantum data hiding
- Quantum error correction via codes over GF(4)
- Kerdock Codes Determine Unitary 2-Designs
- Decoupling with unitary approximate two-designs
- Unitary 2-designs from random X- and Z-diagonal unitaries
- Quantum Information Theory
This page was built for publication: Approximate unitary 3-designs from transvection Markov chains
