Quantum-classical complexity-security tradeoff in secure multiparty computations

I construct a secure multiparty scheme to compute a classical function by a succinct use of a specially designed fault-tolerant random polynomial quantum error correction code. This scheme is secure provided that (asymptotically) strictly more than five-sixths of the players are honest. Moreover, the security of this scheme follows directly from the theory of quantum error correcting code, and hence is valid without any computational assumption. I also discuss the quantum-classical complexity-security tradeoff in secure multiparty computation schemes and argue why a full-blown quantum code is necessary in my scheme.