# procrastination

## Two Quasi-Non-Trivial Questions in Quantum Complexity


Question 1: Can you always parallelize the quantum part of a quantum computation; more precisely, is there even a relativised world where $$\BPP^{\BQNC} \neq \BQP$$? […]

## Complex Euclidean space

is an affine space over $$\mathbb{C}$$ with the Euclidean metric.

## But that is trivial

Every field has its own share of its-obviously-true-but-insanely-hard-to-prove problems. In complexity theory, it is $$\mathrm{P}$$ vs. $$\mathrm{NP}$$. In number theory, it is the Riemann hypothesis…. But […]