Pages that link to "Item:Q1961375"

The following pages link to Complexity limitations on quantum computation (Q1961375):

Displaying 17 items.

• Quantum weakly nondeterministic communication complexity (Q387026) (← links)
• A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
• An oracle builder's toolkit (Q1398366) (← links)
• Uniformity of quantum circuit families for error-free algorithms (Q1770403) (← links)
• Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
• One complexity theorist's view of quantum computing (Q1870556) (← links)
• The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
• Classical vs quantum random oracles (Q2056754) (← links)
• Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\) (Q2087770) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
• LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
• Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
• (Q5005160) (← links)
• Quantum computing, postselection, and probabilistic polynomial-time (Q5428317) (← links)
• Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
• Application of quantum approximate optimization algorithm to job shop scheduling problem (Q6113354) (← links)