A BQP-complete problem related to the Ising model partition function via a new connection between quantum circuits and graphs

Simple item page
dc.creatorGeraci, Joseph
dc.date2008-01-31
dc.date2008-04-02
dc.date.accessioned2026-07-07T12:47:23Z
dc.date.available2026-07-07T12:47:23Z
dc.descriptionWe present a simple construction that maps quantum circuits to graphs and vice-versa. Inspired by the results of D.A. Lidar linking the Ising partition function with quadratically signed weight enumerators (QWGTs), we also present a BQP-complete problem for the additive approximation of a function over hypergraphs related to the generating function of Eulerian subgraphs for ordinary graphs. We discuss connections with the Ising partition function.
dc.description12 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0801.4833
dc.identifierhttp://arxiv.org/abs/0801.4833
dc.identifierdoi:10.1007/s11128-008-0084-7
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221705
dc.subjectQuantum Physics
dc.titleA BQP-complete problem related to the Ising model partition function via a new connection between quantum circuits and graphs
dc.typetext

Files

Collections

arXiv