QMA is the complexity class of computational problems that are efficiently verifiable by a quantum algorithm with the help of a witness in contrast to the smaller class BQP of problems efficiently solvable by a quantum ...