Efficient quantum tensor product expanders and unitary t-designs via the zigzag product.

A classical t-tensor product expander is a natural way of formalising correlated walks of t particles on a regular expander graph. A quantum t-tensor product expander is a completely positive trace preserving map that is a straightforward analogue of a classical t-tensor product expander. Interest in these maps arises from the fact that iterating a quantum t-tensor product expander gives us a unitary t-design, which has many applications to quantum computation and information. We show that the zigzag product of a high dimensional quantum expander (i.e. t = 1) of moderate degree with a moderate dimensional quantum t-tensor product expander of low degree gives us a high dimensional quantum t-tensor product expander of low degree. Previously such a result was known only for quantum expanders i.e. t = 1. Using the zigzag product we give efficient constructions of quantum t-tensor product expanders in dimension D where t = polylog(D). We then show how replacing the zigzag product by the generalised zigzag product leads to almost-Ramanujan quantum tensor product expanders i.e. having near-optimal almost quadratic tradeoff between the degree and the second largest singular value. Both the products give better tradeoffs between the degree and second largest singular value than what was previously known for efficient constructions.

[1]  Christoph Dankert,et al.  Exact and approximate unitary 2-designs and their application to fidelity estimation , 2009 .

[2]  R. Arratia,et al.  Completely Effective Error Bounds for Stirling Numbers of the First and Second Kinds via Poisson Approximation , 2014, 1404.3007.

[3]  Amnon Ta-Shma,et al.  Quantum Expanders: Motivation and Construction , 2010, Theory Comput..

[4]  Fr'ed'eric Dupuis,et al.  Decoupling with unitary approximate two-designs , 2013 .

[5]  Andris Ambainis,et al.  Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption , 2004, APPROX-RANDOM.

[6]  Andris Ambainis,et al.  Quantum t-designs: t-wise Independence in the Quantum World , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[7]  Matthew B. Hastings,et al.  Classical and quantum tensor product expanders , 2008, Quantum Inf. Comput..

[8]  Mihir Bellare,et al.  Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9]  F. Brandão,et al.  Local random quantum circuits are approximate polynomial-designs: numerical results , 2012, 1208.0692.

[10]  Aram Wettroth Harrow,et al.  Efficient Quantum Tensor Product Expanders and k-Designs , 2008, APPROX-RANDOM.

[11]  R. A. Low Large deviation bounds for k-designs , 2009, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[12]  Amnon Ta-Shma,et al.  A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product , 2011, SIAM J. Comput..

[13]  R. Goodman,et al.  Representations and Invariants of the Classical Groups , 1998 .

[14]  Pranab Sen A quantum Johnson-Lindenstrauss lemma via unitary t-designs , 2018, 1807.08779.

[15]  Martin Kassabov Symmetric Groups and Expanders , 2005 .

[16]  A. Winter,et al.  The mother of all protocols: restructuring quantum information’s family tree , 2006, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[17]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[18]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .