FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2284746893> ?p ?o ?g. }

• W2284746893 abstract "In recent years, semidefinite programming has played a vital role in shaping complexity theory and quantum computing. There have been numerous applications ranging from estimating quantum values, over approximating combinatorial quantities, to proving various bounds. This work extends the use of semidefinite programs (SDPs) to proving product rules and to characterizing quantum query complexity.In the first application, we provide a general framework to establishing product rules for quantities that can be expressed (or approximated) using SDPs. We use duality theory to give product rules, which bound the value of the “product” of two problems in terms of their value. Some previous results have implicitly used the properties of SDPs to give such product rules. Here we give sufficient and necessary conditions under which these approaches work, thereby enabling us to capture these previous results under our unified framework. We also include a discussion about alternate definitions of what a “product” means and how they fit into our approach.The second application provides an SDP characterization of quantum query complexity, which is one of the ways in which complexity of a function can be measured. It is known that quantum query complexity can be lower bounded by the so-called “adversary method” which is expressible as a semidefinite program. Recently, Ben Reichardt showed that the adversary method leads to a tight lower bound for boolean functions by converting the solution of this SDP (of adversary method) into an algorithm. We show that a related SDP, called “witness size” in this thesis, provides a tight bound on the quantum query complexity of non boolean functions (total as well as partial). This witness size SDP is also used to give composition results for quantum query complexity. We also show that the witness size is bounded by a constant multiple of the adversary bound.Finally, we briefly explore whether other convex programming paradigms can be useful in complexity theory. One of them is copositive programming. We show that one of the recent result about parallel repetition of unique games, by Barak et.al., can be interpreted as an application of copositive programming." @default.
• W2284746893 created "2016-06-24" @default.
• W2284746893 creator A5020342792 @default.
• W2284746893 creator A5068244186 @default.
• W2284746893 date "2011-01-01" @default.
• W2284746893 modified "2023-09-23" @default.
• W2284746893 title "Application of sdp to product rules and quantum query complexity" @default.
• W2284746893 cites W1511716344 @default.
• W2284746893 cites W1532923685 @default.
• W2284746893 cites W1548134571 @default.
• W2284746893 cites W1601135701 @default.
• W2284746893 cites W1630920573 @default.
• W2284746893 cites W1704619525 @default.
• W2284746893 cites W1963146112 @default.
• W2284746893 cites W1963753244 @default.
• W2284746893 cites W1966082679 @default.
• W2284746893 cites W1970259241 @default.
• W2284746893 cites W1973948469 @default.
• W2284746893 cites W1976865215 @default.
• W2284746893 cites W1985123706 @default.
• W2284746893 cites W1987152249 @default.
• W2284746893 cites W1989051052 @default.
• W2284746893 cites W2001383654 @default.
• W2284746893 cites W2006290558 @default.
• W2284746893 cites W2006822886 @default.
• W2284746893 cites W2010730726 @default.
• W2284746893 cites W2058286540 @default.
• W2284746893 cites W2066072386 @default.
• W2284746893 cites W2069816168 @default.
• W2284746893 cites W2078289947 @default.
• W2284746893 cites W2088844265 @default.
• W2284746893 cites W2097206148 @default.
• W2284746893 cites W2099382096 @default.
• W2284746893 cites W2102687371 @default.
• W2284746893 cites W2109924867 @default.
• W2284746893 cites W2110871651 @default.
• W2284746893 cites W2113077106 @default.
• W2284746893 cites W2114990623 @default.
• W2284746893 cites W2115611948 @default.
• W2284746893 cites W2116397277 @default.
• W2284746893 cites W2118143978 @default.
• W2284746893 cites W2120560473 @default.
• W2284746893 cites W2123056342 @default.
• W2284746893 cites W2126323053 @default.
• W2284746893 cites W2127819793 @default.
• W2284746893 cites W2131176276 @default.
• W2284746893 cites W2136299681 @default.
• W2284746893 cites W2137955570 @default.
• W2284746893 cites W2144385516 @default.
• W2284746893 cites W2148194725 @default.
• W2284746893 cites W2150340379 @default.
• W2284746893 cites W2163322487 @default.
• W2284746893 cites W2165732281 @default.
• W2284746893 cites W2195836695 @default.
• W2284746893 cites W2296319761 @default.
• W2284746893 cites W2340787257 @default.
• W2284746893 cites W2570634700 @default.
• W2284746893 cites W2610857016 @default.
• W2284746893 cites W2611147814 @default.
• W2284746893 cites W2887468738 @default.
• W2284746893 cites W2949889145 @default.
• W2284746893 cites W2952496423 @default.
• W2284746893 cites W2963218519 @default.
• W2284746893 cites W2990019366 @default.
• W2284746893 cites W3041308142 @default.
• W2284746893 cites W3101653183 @default.
• W2284746893 cites W3124716999 @default.
• W2284746893 cites W3157388067 @default.
• W2284746893 cites W585133165 @default.
• W2284746893 cites W66339572 @default.
• W2284746893 doi "https://doi.org/10.7282/t3b27tmj" @default.
• W2284746893 hasPublicationYear "2011" @default.
• W2284746893 type Work @default.
• W2284746893 sameAs 2284746893 @default.
• W2284746893 citedByCount "0" @default.
• W2284746893 crossrefType "journal-article" @default.
• W2284746893 hasAuthorship W2284746893A5020342792 @default.
• W2284746893 hasAuthorship W2284746893A5068244186 @default.
• W2284746893 hasConcept C101901036 @default.
• W2284746893 hasConcept C11413529 @default.
• W2284746893 hasConcept C121332964 @default.
• W2284746893 hasConcept C126255220 @default.
• W2284746893 hasConcept C134306372 @default.
• W2284746893 hasConcept C179799912 @default.
• W2284746893 hasConcept C2524010 @default.
• W2284746893 hasConcept C33923547 @default.
• W2284746893 hasConcept C34388435 @default.
• W2284746893 hasConcept C41008148 @default.
• W2284746893 hasConcept C62520636 @default.
• W2284746893 hasConcept C77553402 @default.
• W2284746893 hasConcept C80444323 @default.
• W2284746893 hasConcept C84114770 @default.
• W2284746893 hasConcept C90673727 @default.
• W2284746893 hasConceptScore W2284746893C101901036 @default.
• W2284746893 hasConceptScore W2284746893C11413529 @default.
• W2284746893 hasConceptScore W2284746893C121332964 @default.
• W2284746893 hasConceptScore W2284746893C126255220 @default.
• W2284746893 hasConceptScore W2284746893C134306372 @default.
• W2284746893 hasConceptScore W2284746893C179799912 @default.
• W2284746893 hasConceptScore W2284746893C2524010 @default.

• next