Skip to search formSkip to main contentSkip to account menu

QIP (complexity)

Known as: Quantum Interactive Polynomial time, QIP, Quantum Interactive Polynomial 
In computational complexity theory, the class QIP, which stands for Quantum Interactive Polynomial time, is the quantum computing analogue of the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
In 2010, Jain et al. [JJUW10] provided the first proof that QIP=PSPACE. Jain et al. used a constructive argument which applied… 
2012
2012
Algorithms for learning distributions over weight-vectors, such as AROW (Crammer et al., 2009) were recently shown empirically to… 
2011
2011
We have previously presented a critique of the standard Marshallian theory of the firm, and developed an alternative formulation… 
2007
2007
This note introduces Fourier transforms over finite Abelian groups, and shows how this can be used to find the period of any… 
2006
2006
We investigate the welfare e¤ects of transport cost reductions resulting from infrastructure improvements, in a heterogeneous… 
2003
1954
1954
The class, 'P, of admissible functions is to include all p(x) satisfying A1: u(x) <p(x) <v(x), A2: F(p(x), x) and G(p(x), x…