pith. sign in

arxiv: quant-ph/9906111 · v1 · pith:CW2RFKDUnew · submitted 1999-06-28 · 🪐 quant-ph

An Introduction to Quantum Complexity Theory

classification 🪐 quant-ph
keywords complexityquantumscenariosalgorithmsbasicclearcommunicationcomputational
0
0 comments X
read the original abstract

We give a basic overview of computational complexity, query complexity, and communication complexity, with quantum information incorporated into each of these scenarios. The aim is to provide simple but clear definitions, and to highlight the interplay between the three scenarios and currently-known quantum algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.