Finding Barriers for Lower Bounds on Tensor Rank
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore the challenges of proving lower bounds on tensor rank in this 46-minute conference talk by Visu Makam at the Centre de recherches mathématiques (CRM). Delve into the recent findings by Efremenko, Garg, Oliveira, and Wigderson, which reveal significant barriers to a wide range of "rank methods" used for proving lower bounds. Examine the core ideas presented in their work and discover preliminary concepts for further improving these techniques, focusing on the identification of varieties with specific properties. Gain insights into the complexities of tensor rank analysis and its implications for quantum information, complexity theory, and quantum combinatorics.