Quantum ground-state computation with static gates

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We develop a computation model for solving Boolean networks that implements wires through quantum ground-state computation and implements gates through identities following from angular momentum algebra and statistics. The gates are static in the sense that they contribute Hamiltonian 0 and hold as constants of the motion; only the wires are dynamic. Just as a spin 1/2 makes an ideal 1-bit memory element, a spin 1 makes an ideal 3-bit gate. Such gates cost no computation time: relaxing the wires alone solves the network. We compare computation time with that of an easier Boolean network where all the gate constraints are simply removed. This computation model is robust with respect to decoherence and yields a generalized quantum speed-up for all NP problems.
10 pages, LaTeX, 1 PS figure

Keywords

Quantum Physics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/90492

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/quant-ph/0209084
 http://arxiv.org/abs/quant-ph/0209084

Collections

arXiv