Approximate Unitary 3-Designs from Transvection Markov Chains
- URL: http://arxiv.org/abs/2011.00128v2
- Date: Tue, 25 May 2021 20:55:48 GMT
- Title: Approximate Unitary 3-Designs from Transvection Markov Chains
- Authors: Xinyu Tan, Narayanan Rengaswamy, and Robert Calderbank
- Abstract summary: We construct a Markov process that mixes a Kerdock $2$-design with symplectic transvections, and show that this process produces an $epsilon$-approximate unitary $3$-design.
From a hardware perspective, $2$-qubit transvections exactly map to the Molmer-Sorensen gates that form the native $2$-qubit operations for trapped-ion quantum computers.
- Score: 3.0586855806896045
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Architectures and random properties of symplectic quantum circuits [0.0]
Parametrized and random unitary $n$-qubit circuits play a central role in quantum information.
We present a universal set of generators $mathcalG$ for the symplectic algebra $imathfraksp(d/2)$.
We find that the operators in $mathcalG$ cannot generate arbitrary local symplectic unitaries.
We then review the Schur-Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements can converge
arXiv Detail & Related papers (2024-05-16T17:15:39Z) - Matrix logistic map: fractal spectral distributions and transfer of
chaos [0.0]
We show that for an arbitrary initial ensemble of hermitian random matrices with a continuous level density supported on the interval $[0,1]$, the level density converges to the invariant measure of the logistic map.
This approach generalizes the known model of coupled logistic maps, and allows us to study the transition to chaos in complex networks and multidimensional systems.
arXiv Detail & Related papers (2023-03-10T19:19:56Z) - Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk.
The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra.
As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
arXiv Detail & Related papers (2022-08-12T15:05:07Z) - Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann.
We show how our results have immediate applications to the modern theory of polarization.
arXiv Detail & Related papers (2022-05-30T18:01:34Z) - Random matrices in service of ML footprint: ternary random features with
no performance loss [55.30329197651178]
We show that the eigenspectrum of $bf K$ is independent of the distribution of the i.i.d. entries of $bf w$.
We propose a novel random technique, called Ternary Random Feature (TRF)
The computation of the proposed random features requires no multiplication and a factor of $b$ less bits for storage compared to classical random features.
arXiv Detail & Related papers (2021-10-05T09:33:49Z) - Quantum double aspects of surface code models [77.34726150561087]
We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry.
We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
arXiv Detail & Related papers (2021-06-25T17:03:38Z) - Projection-free Graph-based Classifier Learning using Gershgorin Disc
Perfect Alignment [59.87663954467815]
In graph-based binary learning, a subset of known labels $hatx_i$ are used to infer unknown labels.
When restricting labels $x_i$ to binary values, the problem is NP-hard.
We propose a fast projection-free method by solving a sequence of linear programs (LP) instead.
arXiv Detail & Related papers (2021-06-03T07:22:48Z) - Dynamical Signatures of Chaos to Integrability Crossover in $2\times 2$
Generalized Random Matrix Ensembles [0.0]
We study the energy correlations by calculating the density and 2nd moment of the Nearest Neighbor Spacing (NNS)
We observe that for large $N$ the 2nd moment of NNS and the relative depth of the correlation hole exhibit a second order phase transition at $gamma=2$.
arXiv Detail & Related papers (2020-10-28T05:02:13Z) - Epsilon-nets, unitary designs and random quantum circuits [0.11719282046304676]
Epsilon-nets and approximate unitary $t$-designs are notions of unitary operations relevant for numerous applications in quantum information and quantum computing.
We prove that for a fixed $d$ of the space, unitaries constituting $delta$-approx $t$-expanders form $epsilon$-nets for $tsimeqfracd5/2epsilon$ and $delta=left(fracepsilon3/2dright)d2$.
We show that approximate tdesigns can be generated
arXiv Detail & Related papers (2020-07-21T15:16:28Z) - Curse of Dimensionality on Randomized Smoothing for Certifiable
Robustness [151.67113334248464]
We show that extending the smoothing technique to defend against other attack models can be challenging.
We present experimental results on CIFAR to validate our theory.
arXiv Detail & Related papers (2020-02-08T22:02:14Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.