1 resultado para Upper bound method
em Universidade Complutense de Madrid
Filtro por publicador
- Academic Archive On-line (Stockholm University; Sweden) (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (7)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- Aquatic Commons (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (5)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Aston University Research Archive (14)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (10)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (13)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (14)
- Boston University Digital Common (2)
- Brock University, Canada (2)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (4)
- CaltechTHESIS (15)
- Cambridge University Engineering Department Publications Database (20)
- CentAUR: Central Archive University of Reading - UK (35)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (18)
- Cochin University of Science & Technology (CUSAT), India (2)
- Coffee Science - Universidade Federal de Lavras (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (6)
- Deakin Research Online - Australia (61)
- Digital Commons - Michigan Tech (4)
- Digital Commons at Florida International University (2)
- Digital Repository at Iowa State University (1)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (4)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (1)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Glasgow Theses Service (1)
- Helda - Digital Repository of University of Helsinki (5)
- Indian Institute of Science - Bangalore - Índia (120)
- Instituto Politécnico do Porto, Portugal (10)
- Massachusetts Institute of Technology (7)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Publishing Network for Geoscientific & Environmental Data (396)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (27)
- Queensland University of Technology - ePrints Archive (33)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (3)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (6)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (53)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (1)
- Universidad de Alicante (2)
- Universidad Politécnica de Madrid (16)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Pará (2)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (4)
- Université Laval Mémoires et thèses électroniques (1)
- University of Michigan (4)
- University of Queensland eSpace - Australia (5)
- University of Washington (2)
Resumo:
In this work, we study a version of the general question of how well a Haar-distributed orthogonal matrix can be approximated by a random Gaussian matrix. Here, we consider a Gaussian random matrix (Formula presented.) of order n and apply to it the Gram–Schmidt orthonormalization procedure by columns to obtain a Haar-distributed orthogonal matrix (Formula presented.). If (Formula presented.) denotes the vector formed by the first m-coordinates of the ith row of (Formula presented.) and (Formula presented.), our main result shows that the Euclidean norm of (Formula presented.) converges exponentially fast to (Formula presented.), up to negligible terms. To show the extent of this result, we use it to study the convergence of the supremum norm (Formula presented.) and we find a coupling that improves by a factor (Formula presented.) the recently proved best known upper bound on (Formula presented.). Our main result also has applications in Quantum Information Theory.