Approximate unitary 3-designs from transvection Markov chains

DOI10.1007/S10623-021-01000-4MaRDI QIDQ2168080zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

Markov chainssymplectic transvectionsPauli groupClifford groupunitary designs

Mathematics Subject Classification ID

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) Set functions and measures on topological groups or semigroups, Haar measures, invariant measures (28C10) Clifford algebras, spinors (15A66)

Abstract: Unitary $k$-designs are probabilistic ensembles of unitary matrices whose first $k$ statistical moments match that of the full unitary group endowed with the Haar measure. In prior work, we showed that the automorphism group of classical $mathbb{Z}_4$-linear Kerdock codes maps to a unitary $2$-design, which established a new classical-quantum connection via graph states. In this paper, we construct a Markov process that mixes this Kerdock $2$-design with symplectic transvections, and show that this process produces an $epsilon$-approximate unitary $3$-design. We construct a graph whose vertices are Pauli matrices, and two vertices are connected by directed edges if and only if they commute. A unitary ensemble that is transitive on vertices, edges, and non-edges of this Pauli graph is an exact $3$-design, and the stationary distribution of our process possesses this property. With respect to the symmetries of Kerdock codes, the Pauli graph has two types of edges; the Kerdock $2$-design mixes edges of the same type, and the transvections mix the types. More precisely, on $m$ qubits, the process samples $O(log(N^5/epsilon))$ random transvections, where $N=2^m$, followed by a random Kerdock $2$-design element and a random Pauli matrix. Hence, the simplicity of the protocol might make it attractive for several applications. From a hardware perspective, $2$-qubit transvections exactly map to the M{o}lmer-S{o}rensen gates that form the native $2$-qubit operations for trapped-ion quantum computers. Thus, it might be possible to extend our work to construct an approximate $3$-design that only involves such $2$-qubit transvections.

Recommendations

• Unitary 2-designs from random \(X\)- and \(Z\)-diagonal unitaries
• Implementing unitary 2-designs using random diagonal-unitary matrices
• On the explicit constructions of certain unitaryt-designs
• Unitary designs and codes
• Evenly distributed unitaries: On the structure of unitary designs

Cites work

• scientific article; zbMATH DE number 5863326 (Why is no real title available?)
• scientific article; zbMATH DE number 4083539 (Why is no real title available?)
• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• A Decoupling Approach to the Quantum Capacity
• Decoupling with unitary approximate two-designs
• How to efficiently select an arbitrary Clifford group element
• Kerdock Codes Determine Unitary 2-Designs
• Optimal symplectic Householder transformations for \(SR\) decomposition
• Quantum computation and quantum information. 10th anniversary edition
• Quantum data hiding
• Quantum error correction via codes over GF(4)
• Quantum information theory
• Random quantum circuits are approximate 2-designs
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization
• Unitary 2-designs from random \(X\)- and \(Z\)-diagonal unitaries
• Unitary designs and codes

Cited in

(2)

• Unitary designs and codes
• On the explicit constructions of certain unitaryt-designs

This page was built for publication: Approximate unitary 3-designs from transvection Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168080)