论文

2008Theory of Computing引用 287顶会

Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum-Dot Cellular Automata

网络安全 Quantum Computing Algorithms and Architecture Quantum Information and Cryptography Quantum-Dot Cellular Automata

作者

摘要

We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time proportional to N. We also show a lower bound of ( N) for the NAND tree problem in the Hamiltonian oracle model.

作者查看全部 (3)

Sam Gutmann

Jeffrey Goldstone

Edward Farhi

论文

摘要

作者查看全部 (3)

相关技术查看全部 (1)

相关事件

相关文章