摘要
Because of quantum superposition,quantum computation can solve many problems,such as factoring large integers[1]and searching unsorted databases[2,3],much faster than classical computation.To realize practical quantum computation and then gain the desired advantages,a universal set of quantum gates with sufficiently high fidelities are needed.However,various inevitable errors reduce the gate fidelities and finally collapse the computation results,which makes the realizations of quantum computation very challenging.To
Because of quantum superposition, quantum computation can solve many problems, such as factoring large integers [ 1 ] and searching unsorted databases [2,3], much faster than clas- sical computation. To realize practical quantum computation and then gain the desired advantages, a universal set of quantum gates with sufficiently high fidelities are needed. However, various inevitable errors reduce the gate fidelities and finally collapse the computation results, which makes the realizations of quantum computation very challenging.
