scientific article; zbMATH DE number 2086398

MaRDI QIDQ4736853zbMATH OpenFDO

Authors Mart de Graaf, Ronald de Wolf

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850347.htm

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Quantum lower bounds by polynomials
• Quantum certificate complexity
• Unbounded-error quantum query complexity
• Unbounded-Error Quantum Query Complexity
• Average-case quantum query complexity

Cited in

(4)

• Quantum communication and complexity.
• Kolmogorov complexity and combinatorial methods in communication complexity
• Quantum data structure for range minimum query
• A direct product theorem for quantum communication complexity with applications to device-independent cryptography

This page was built for publication:

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