Measurement-based quantum computing is one of the most promising quantum
computing models. Although various universal resource states have been proposed
so far, it was open whether only two Pauli bases are enough for both of
universal measurement-based quantum computing and its verification. In this
paper, we construct a universal hypergraph state that only requires X and
Z-basis measurements for universal measurement-based quantum computing. We
also show that universal measurement-based quantum computing on our hypergraph
state can be verified in polynomial time using only X and Z-basis
measurements. Furthermore, in order to demonstrate an advantage of our
hypergraph state, we construct a verifiable blind quantum computing protocol
that requires only X and Z-basis measurements for the client.Comment: 12 pages, 8 figures, 1 table, close to published versio