procrastination

\(
\newcommand\cc{\textsf}
\newcommand\UP{\cc{UP}}
\newcommand\coUP{\cc{coUP}}
\newcommand\NP{\cc{NP}}
\newcommand\coNP{\cc{coNP}}
\newcommand\IP{\cc{IP}}
\newcommand\QIP{\cc{QIP}}
\newcommand\PP{\cc{PP}}
\newcommand\PSPACE{\cc{PSPACE}}
\newcommand\QSZK{\cc{QSZK}}
\newcommand\SZK{\cc{SZK}}
\newcommand\CZK{\cc{CZK}}
\newcommand\PZK{\cc{PZK}}
\newcommand\BPP{\cc{BPP}}
\newcommand\BQP{\cc{BQP}}
\newcommand\QMA{\cc{QMA}}
\newcommand\PH{\cc{PH}}
\newcommand\AM{\cc{AM}}
\newcommand\BQNC{\cc{BQNC}}
\newcommand\P{\cc{P}}
\)

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 \)? […]

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 […]