On interpolating between quantum and classical complexity classes

MaRDI QIDQ5448347zbMATH OpenFDO

Authors J. Maurice Rojas

Publication date 20 March 2008

Full work available at URL https://arxiv.org/abs/quant-ph/0604089

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Quantum interpolation of polynomials
• \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
• Quantum algorithm for multivariate polynomial interpolation
• Quantum Computability
• Strengths and Weaknesses of Quantum Computing

Cited in

(2)

• Quantum complexity of the approximation for the classes \({\mathcal B}(W^r_p([0,1]^d))\) and \({\mathcal B}(H^r_p([0,1]^d))\)
• Unconventional Computation

This page was built for publication: On interpolating between quantum and classical complexity classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448347)