{"id":313802,"date":"2018-11-06T17:09:46","date_gmt":"2018-11-07T01:09:46","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-research-item&p=313802"},"modified":"2018-11-06T17:09:46","modified_gmt":"2018-11-07T01:09:46","slug":"mutually-unbiased-bases-spherical-designs-frames","status":"publish","type":"msr-research-item","link":"https:\/\/www.microsoft.com\/en-us\/research\/publication\/mutually-unbiased-bases-spherical-designs-frames\/","title":{"rendered":"Mutually Unbiased Bases, Spherical Designs, and Frames"},"content":{"rendered":"

The principle of complementarity lies at the heart of quantum mechanics. In finite dimensional quantum systems this principle is captured by pairs of observables which are given by mutually unbiased bases (MUBs). Two orthonormal bases B and C of C^d are mutually unbiased if |langle b | c rangle|^2 = 1\/d holds for all vectors b in B and c in C. This implies that whenever we are given a vector from one of these bases and perform a measurement with respect to any other of the bases, then there is no information gained from this measurement. A basic question about MUBs is how many of them can be found in a given dimension d. While constructions of maximal sets of d+1 such bases are known for system of prime power dimension d, it is unknown whether this bound can be achieved for any non-prime power dimension. We review the known constructions of MUBs and demonstrate that maximal sets of MUBs come with a rich combinatorial structure by showing that they actually are the same objects as the complex projective 2-designs with angle set {0,1\/d}. Furthermore, we address the problem of constructing positive operator-valued measures (POVMs) in finite dimension d consisting of d^2 operators of rank one which have an inner product equal to uniform or very close to uniform. This is motivated by the related question of constructing symmetric informationally complete POVMs (SIC-POVMs) for which the inner products are perfectly uniform. We also give a simple proof of the fact that symmetric informationally complete POVMs are complex projective 2-designs with angle set {1\/(d+1)}. Moreover, we show that MUBs and SIC-POVMs form uniform tight frames in C^d. <\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

The principle of complementarity lies at the heart of quantum mechanics. In finite dimensional quantum systems this principle is captured by pairs of observables which are given by mutually unbiased bases (MUBs). Two orthonormal bases B and C of C^d are mutually unbiased if |langle b | c rangle|^2 = 1\/d holds for all vectors […]<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"footnotes":""},"msr-content-type":[3],"msr-research-highlight":[],"research-area":[243138],"msr-publication-type":[193716],"msr-product-type":[],"msr-focus-area":[],"msr-platform":[],"msr-download-source":[],"msr-locale":[268875],"msr-field-of-study":[],"msr-conference":[],"msr-journal":[],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-313802","msr-research-item","type-msr-research-item","status-publish","hentry","msr-research-area-quantum","msr-locale-en_us"],"msr_publishername":"","msr_edition":"Proceedings of SPIE International Symposium on Optics and Photonics, Wavelets XI","msr_affiliation":"","msr_published_date":"2005-09-17","msr_host":"","msr_duration":"","msr_version":"","msr_speaker":"","msr_other_contributors":"","msr_booktitle":"","msr_pages_string":"59140P (13 Pages)","msr_chapter":"","msr_isbn":"","msr_journal":"","msr_volume":"5914","msr_number":"","msr_editors":"","msr_series":"","msr_issue":"","msr_organization":"","msr_how_published":"","msr_notes":"","msr_highlight_text":"","msr_release_tracker_id":"","msr_original_fields_of_study":"","msr_download_urls":"","msr_external_url":"","msr_secondary_video_url":"","msr_longbiography":"","msr_microsoftintellectualproperty":1,"msr_main_download":"","msr_publicationurl":"http:\/\/spie.org\/Publications\/Proceedings\/Paper\/10.1117\/12.615759","msr_doi":"10.1117\/12.615759","msr_publication_uploader":[{"type":"url","title":"http:\/\/spie.org\/Publications\/Proceedings\/Paper\/10.1117\/12.615759","viewUrl":false,"id":false,"label_id":0},{"type":"doi","title":"10.1117\/12.615759","viewUrl":false,"id":false,"label_id":0}],"msr_related_uploader":"","msr_attachments":[{"id":0,"url":"http:\/\/spie.org\/Publications\/Proceedings\/Paper\/10.1117\/12.615759"}],"msr-author-ordering":[{"type":"text","value":"Andreas Klappenecker","user_id":0,"rest_url":false},{"type":"user_nicename","value":"martinro","user_id":32823,"rest_url":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/microsoft-research\/v1\/researchers?person=martinro"}],"msr_impact_theme":[],"msr_research_lab":[],"msr_event":[],"msr_group":[],"msr_project":[],"publication":[],"video":[],"download":[],"msr_publication_type":"inproceedings","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/313802"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-research-item"}],"version-history":[{"count":2,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/313802\/revisions"}],"predecessor-version":[{"id":548379,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/313802\/revisions\/548379"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=313802"}],"wp:term":[{"taxonomy":"msr-content-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-content-type?post=313802"},{"taxonomy":"msr-research-highlight","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-highlight?post=313802"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=313802"},{"taxonomy":"msr-publication-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-publication-type?post=313802"},{"taxonomy":"msr-product-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-product-type?post=313802"},{"taxonomy":"msr-focus-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-focus-area?post=313802"},{"taxonomy":"msr-platform","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-platform?post=313802"},{"taxonomy":"msr-download-source","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-download-source?post=313802"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=313802"},{"taxonomy":"msr-field-of-study","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-field-of-study?post=313802"},{"taxonomy":"msr-conference","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-conference?post=313802"},{"taxonomy":"msr-journal","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-journal?post=313802"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=313802"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=313802"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}