Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication

  title={Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication},
  author={Harry Buhrman and Matthias Christandl and Jeroen Zuiddam},
We study nondeterministic multiparty quantum communication with a quantum generalization of broadcasts. We show that, with number-in-hand classical inputs, the communication complexity of a Boolean function in this communication model equals the logarithm of the support rank of the corresponding tensor, whereas the approximation complexity in this model equals the logarithm of the border support rank. This characterisation allows us to prove a log-rank conjecture posed by Villagra et al. for… 
Asymptotic tensor rank of graph tensors: beyond matrix multiplication
An upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on k vertices is presented, showing that the exponent per edge is at most 0.77, outperforming the best known upper bound for matrix multiplication.
Algebraic complexity, asymptotic spectra and entanglement polytopes
The first explicit construction of an infinite family of elements in the asymptotic spectrum of complex k-tensors, based on information theory and entanglement polytopes is given, and it is proved that any polynomial can be efficiently approximated by a width-2 abp.
Matrix product states and the quantum max-flow/min-cut conjectures
In this note we discuss the geometry of matrix product states with periodic boundary conditions and provide three infinite sequences of examples where the quantum max-flow is strictly less than the
Multi-partite entanglement
We give an introduction to the theory of multi-partite entanglement. We begin by describing the "coordinate system" of the field: Are we dealing with pure or mixed states, with single or multiple
Tensor surgery and tensor rank
It is shown that tensor surgery is capable of preserving the low rank structure of an initial tensor decomposition and thus allows to prove nontrivial upper bounds on tensor rank, border rank and asymptotic rank of the final tensors.
The border support rank of two-by-two matrix multiplication is seven
It is shown that the border support rank of the tensor corresponding to two-by-two matrix multiplication is seven over the complex numbers, and two proofs are given that the decomposition of this tensor is unique up to sandwiching.
Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity
This work proves that if only point-to-point communication is allowed in the intermediate "star" model, then significant savings are impossible in the public-coin randomized setting and shows gaps between the complexity of solving f on l instances in the two models in question do not exist.
Entanglement Distillation from Greenberger–Horne–Zeilinger Shares
If SLOCC transformations are allowed, then the best asymptotic rate is the minimum of bipartite log-ranks of the initial state, which in turn equals the minimum cut of the hypergraph.
Computing images of polynomial maps
A new algorithm, based on algebro-geometric techniques, is provided, addressing the problem of computing the constructible set itself and applying these methods to answer a question of W. Hackbusch on the non-closedness of site-independent cyclic matrix product states for infinitely many parameters.
On the partially symmetric rank of tensor products of $W$-states and other symmetric tensors
It is proved that the partially symmetric rank of the so-called "W-states", namely monomials of the form $x^{d-1}y$, and on products of such, is at most $2-1(d_1+ ... +d_k)$.


Nondeterministic Quantum Query and Communication Complexities
The nondeterministic quantum algorithms for Boolean functions f have positive acceptance probability on input x iff f(x)=1, which implies that the quantum communication complexities of the equality and disjointness functions are n+1 if the authors do not allow any error probability.
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
This work relates strong quantum nondeterministic multiparty communication complexity to the rank of the communication tensor in the Number-On-Forehead and Number-In-Hand models by extending the definition proposed by de Wolf to nrank.
Tripartite entanglement transformations and tensor rank.
This work shows that for tripartite systems, there is no easy general criterion to determine the feasibility of quantum entangled states, and in fact, the problem is NP hard.
Fast matrix multiplication using coherent configurations
It is shown that bounds on ω can be established by embedding large matrix multiplication instances into small commutative coherent configurations, and a closure property involving symmetric powers of adjacency algebras is proved, which enables us to prove nontrivial bounds onπ� using commutATIVE coherent configurations and suggests that commutatives coherent configurations may be sufficient to prove ω = 2.
Multiparty quantum coin flipping
It is discovered that quantum broadcast is essentially a combination of pairwise quantum channels and a classical broadcast channel, which helps to provide tight upper and lower bounds on the optimal bias of a coin which can be flipped by k parties.
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Computing Algebraic Formulas Using a Constant Number of Registers
It is shown that, over an arbitrary ring, the functions computed by polynomial-size algebraic formulas are also computed by algebraic straight-line programs that use only three registers, which is an improvement over previous methods that require the number of registers to be logarithmic in the size of the formulas.
Algebraic Complexity Theory
  • V. Strassen
  • Computer Science
    Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
  • 1990
New Lower Bounds for the Border Rank of Matrix Multiplication
The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the
Fast Matrix Multiplication
An overview of the history of fast algorithms for matrix multiplication is given and some other fundamental problems in algebraic complexity like polynomial evaluation are looked at.