Zobrazeno 1 - 10
of 137
pro vyhledávání: '"Zhou, Xianyi"'
Autor:
Feng, Yuqin, Qin, Si, Yang, Yemei, Li, Huarun, Zheng, Yushi, Shi, Siman, Xu, Jieru, Wen, Shiyu, Zhou, Xianyi
Publikováno v:
In Colloids and Surfaces B: Biointerfaces September 2024 241
Publikováno v:
In Reproductive Biology June 2024 24(2)
Autor:
Zheng, Wenqiang, Yu, Yafei, Pan, Jian, Zhang, Jingfu, Li, Jun, Li, Zhaokai, Suter, Dieter, Zhou, Xianyi, Peng, Xinhua, Du, Jiangfeng
A set of stabilizer operations augmented by some special initial states known as 'magic states', gives the possibility of universal fault-tolerant quantum computation. However, magic state preparation inevitably involves nonideal operations that intr
Externí odkaz:
http://arxiv.org/abs/1412.3557
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Phys. Rev. A 87, 032112 (2013)
We experimentally demonstrate a new dynamic fashion of quantum Zeno effect in nuclear magnetic resonance systems. The frequent measurements are implemented through quantum entanglement between the target qubit(s) and the measuring qubit, which dynami
Externí odkaz:
http://arxiv.org/abs/1303.2428
Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring algorithm and
Externí odkaz:
http://arxiv.org/abs/1111.3726
Publikováno v:
Phys. Rev. Lett. 106, 180404 (2011)
The method of quantum cloning is divided into two main categories: approximate and probabilistic quantum cloning. The former method is used to approximate an unknown quantum state deterministically, and the latter can be used to faithfully copy the s
Externí odkaz:
http://arxiv.org/abs/1104.3643
Grover's algorithm has achieved great success. But quantum search algorithms still are not complete algorithms because of Grover's Oracle. We concerned on this problem and present a new quantum search algorithm in adiabatic model without Oracle. We a
Externí odkaz:
http://arxiv.org/abs/0809.0664
Autor:
Peng, Xinhua, Liao, Zeyang, Xu, Nanyang, Qin, Gan, Zhou, Xianyi, Suter, Dieter, Du, Jiangfeng
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical simulations i
Externí odkaz:
http://arxiv.org/abs/0808.1935
One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report the first experimental realization of the complete process of deterministic one-way quantum Deut
Externí odkaz:
http://arxiv.org/abs/0806.0907