Blindness and Verification of Quantum Computation with One Pure Qubit

摘要: While building a universal quantum computer remains challenging, devices of restricted power such as the so-called one pure qubit model have attracted considerable attention. An important step in construction these limited computational is understanding whether verification computation within models could be also performed scheme. Encoding via blindness (a cryptographic protocol for delegated computing) has proven successful with verifier. In this paper, we present adaptation approach to model, and first feasible scheme computing.