quantum computing; probability; quantum communication; protocols; computational complexity; matrix multiplication; Boolean algebra; classical strong direct product theorems; optimal time-space tradeoff; quantum strong direct product theorems; quantum query complexity; OR function; slightly weaker direct product; total function; quantum communication protocols; disjointness function; quantum computer; polylog factors; Boolean matrix-vector multiplication; quantum theorem; communication-space tradeoff;
机译:量子和经典强直接乘积定理和最佳时空折衷
机译:一种新的量子下界方法,应用于直接乘积定理和时空权衡
机译:一种新的量子下界方法,应用于直接乘积定理和时空权衡
机译:量子和经典强大的直接产品定理和最优时间空间权衡
机译:统计,编码理论和量子计算中的时空权衡和查询复杂性。
机译:经典和Quantum H-定理重新审视:变分熵和放松过程
机译:量子和经典强直接乘积定理与最佳时空权衡