• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Science
      • Department of Physics
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Science
      • Department of Physics
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Characterizing finite-dimensional quantum behavior

      Thumbnail
      View / Download
      245.0 Kb
      Author(s)
      Navascués, M.
      Feix, A.
      Araújo, M.
      Vértesi, T.
      Date
      2015
      Source Title
      Physical Review A - Atomic, Molecular, and Optical Physics
      Print ISSN
      10502947
      Publisher
      American Physical Society
      Volume
      92
      Issue
      4
      Language
      English
      Type
      Article
      Item Usage Stats
      156
      views
      165
      downloads
      Abstract
      We study and extend the semidefinite programming (SDP) hierarchies introduced in Navascués and Vértesi [Phys. Rev. Lett. 115, 020501 (2015)PRLTAO0031-900710.1103/PhysRevLett.115.020501] for the characterization of the statistical correlations arising from finite-dimensional quantum systems. First, we introduce the dimension-constrained noncommutative polynomial optimization (NPO) paradigm, where a number of polynomial inequalities are defined and optimization is conducted over all feasible operator representations of bounded dimensionality. Important problems in device-independent and semi-device-independent quantum information science can be formulated (or almost formulated) in this framework. We present effective SDP hierarchies to attack the general dimension-constrained NPO problem (and related ones) and prove their asymptotic convergence. To illustrate the power of these relaxations, we use them to derive a number of dimension witnesses for temporal and Bell-type correlation scenarios, and also to bound the probability of success of quantum random access codes. © 2015 American Physical Society.
      Keywords
      Quantum optics
      Asymptotic convergence
      Finite-dimensional quantum systems
      Noncommutative polynomials
      Polynomial inequalities
      Probability of success
      Quantum information science
      Semi-definite programming
      Statistical correlation
      Constrained optimization
      Permalink
      http://hdl.handle.net/11693/26696
      Published Version (Please cite this version)
      http://dx.doi.org/10.1103/PhysRevA.92.042117
      Collections
      • Department of Physics 837
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy