Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Lower Bounds on Matrix Rigidity via a Quantum Argument   The rigidity of a matrix measures how many of its entries need to be changed
in order to reduce its rank to some value. Good lower bounds on the rigidity of
an explicit matrix would imply good lower bounds for arithmetic circuits as
well as for communication complexity. Here we reprove the best known bounds on
the rigidity of Hadamard matrices, due to Kashin and Razborov, using tools from
quantum computing. Our proofs are somewhat simpler than earlier ones (at least
for those familiar with quantum) and give slightly better constants. More
importantly, they give a new approach to attack this longstanding open problem.

14
The categories of this paper are: math-ph
28
The categories of this paper are: alg-geom
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
36
The categories of this paper are: cmp-lg
7
The categories of this paper are: hep-th
2
The categories of this paper are: math
9
The categories of this paper are: nlin
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
21
The categories of this paper are: adap-org
0
The categories of this paper are: hep-ph
23
The categories of this paper are: solv-int
11
The categories of this paper are: hep-lat