arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/9706053quant-ph

Effective Pure States for Bulk Quantum Computation

Emanuel Knill, Isaac Chuang, Raymond Laflamme

英文摘要:

In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) and Cory et al. (spatial averaging) for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla qubits and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high temperature and low temperature bulk quantum computing and analyze the signal to noise behavior of each.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑