Published online by Cambridge University Press: 10 February 2020
While random matrices give us the exact value of the constant C(n), it is natural to search for alternate deterministic constructions that show that C(n)<n. This chapter explores this direction. The central notion here is that of spectral gap. To prove the key estimate that C(n)<n, it suffices to produce sequences of n-tuples of unitary matrices exhibiting a certain kind of spectral gap. The notion of quantum expanders naturally enter the discussion here. Their existence can be derived from that of groups with property (T) admitting sufficiently many finite dimensional unitary representations. The notion of quantum spherical code that we introduce hereis a natural way to describe what is needed in the present context.
To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.