Frank Oertel: Upper Bounds for Grothendieck Constants, Quantum Correlation Matrices and CCP Functions
Upper Bounds for Grothendieck Constants, Quantum Correlation Matrices and CCP Functions
Buch
- Springer Nature Switzerland, 09/2024
- Einband: Kartoniert / Broschiert, Paperback
- Sprache: Englisch
- ISBN-13: 9783031572005
- Bestellnummer: 11969476
- Umfang: 248 Seiten
- Auflage: 2024
- Gewicht: 382 g
- Maße: 235 x 155 mm
- Stärke: 14 mm
- Erscheinungstermin: 13.9.2024
- Serie: Lecture Notes in Mathematics - Band 2349
Achtung: Artikel ist nicht in deutscher Sprache!
Klappentext
This book concentrates on the famous Grothendieck inequality and the continued search for the still unknown best possible value of the real and complex Grothendieck constant (an open problem since 1953). It describes in detail the state of the art in research on this fundamental inequality, including Krivine's recent contributions, and sheds light on related questions in mathematics, physics and computer science, particularly with respect to the foundations of quantum theory and quantum information theory. Unifying the real and complex cases as much as possible, the monograph introduces the reader to a rich collection of results in functional analysis and probability. In particular, it includes a detailed, self-contained analysis of the multivariate distribution of complex Gaussian random vectors. The notion of Completely Correlation Preserving (CCP) functions plays a particularly important role in the exposition.The prerequisites are a basic knowledge of standard functional analysis, complex analysis, probability, optimisation and some number theory and combinatorics. However, readers missing some background will be able to consult the generous bibliography, which contains numerous references to useful textbooks.
The book will be of interest to PhD students and researchers in functional analysis, complex analysis, probability, optimisation, number theory and combinatorics, in physics (particularly in relation to the foundations of quantum mechanics) and in computer science (quantum information and complexity theory).