Weobtaintheoptimalorderofhigh-dimensionalintegrationcomplexityinthequantumcomputationmodelinanisotropicSobolevclassesW∞^r([0,1]^d)andHǒlderNikolskiiclassesH∞^r([0,1]^d).Itisprovedthatfortheseclassesoffunctionsthereisaspeed-upofquantumalgorithmsoverdeterministicclassicalalgorithmsduetofactorn^-1andoverrandomizedclassicalmethodsduetofactorn^-1/2.Moreover,wegiveanestimationforoptimalquerycomplexityintheclassH∞^∧(D)whosesmoothnessindexistheboundaryofsomecompletesetinZ+^d.