# What is the complexity class of exponential parallelism?

Consider the class of problems that can be computed when you have access to exponentially many processors working in parallel.

How does one capture that in a proper formalism? Is there some literature on it already? Would it be true that such a class would be a superset of BQP?

• "exponentially many processors working in parallel" And with unbounded time and space requirements on each processor? – dkaeae Jul 25 at 15:28
• @dkaeae polynomial time and space requirements on each processor – Jsevillamol Jul 25 at 16:12
• Well Nick's Class $NC^i$ concerns polynomially many processors in parallel with shared memory, it stratifies $P$ (conjectured to reach $P$). I would think the natural thing to generalize is non-deterministic NC. See Caussinus-MacKinzie and references form there. – Algeboy Jul 25 at 19:45