Grover's Quantum Search Algorithm and Free Fermionic Heterotic Models
| dc.creator | Robinson, Matthew B. | |
| dc.creator | Cleaver, Gerald B. | |
| dc.date | 2008-10-07 | |
| dc.date.accessioned | 2026-07-07T10:08:26Z | |
| dc.date.available | 2026-07-07T10:08:26Z | |
| dc.description | Given an efficient and systematic method for generating input sets for free fermionic heterotic model building we consider what the realistic bounds are for a statistical analysis of the free fermionic Landscape with a classical computer. We then consider what kind of improvement could be expected on a quantum computer. We do outline the basic structure of the relevant quantum algorithms, but we do not detail the construction of the oracle which would be involved in the calculations. | |
| dc.description | Standard latex document, 12 pages | |
| dc.identifier | https://arxiv.org/abs/0810.1296 | |
| dc.identifier | http://arxiv.org/abs/0810.1296 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/170992 | |
| dc.subject | High Energy Physics - Phenomenology | |
| dc.title | Grover's Quantum Search Algorithm and Free Fermionic Heterotic Models | |
| dc.type | text |