Efficient Quantum Tensor Product Expanders and k-Designs

DOI10.1007/978-3-642-03685-9_41zbMath1255.81107arXiv0811.2597OpenAlexW2171625116MaRDI QIDQ3638902

Aram W. Harrow, Richard A. Low

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Graph designs and isomorphic decomposition (05C51)

Related Items

Explicit construction of exact unitary designs ⋮ The curious nonexistence of Gaussian 2-designs ⋮ Generating a statet-design by diagonal quantum circuits ⋮ Erratum to: Onset of random matrix behavior in scrambling systems ⋮ Local random quantum circuits are approximate polynomial-designs ⋮ Unitary 2-designs from random X- and Z-diagonal unitaries ⋮ Unitary designs and codes