Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity

Simple item page
dc.creatorWocjan, P.
dc.creatorJanzing, D.
dc.creatorBeth, Th.
dc.date2001-06-13
dc.date.accessioned2026-07-07T06:02:15Z
dc.date.available2026-07-07T06:02:15Z
dc.descriptionWe use an n-spin system with permutation symmetric zz-interaction for simulating arbitrary pair-interaction Hamiltonians. The calculation of the required time overhead is mathematically equivalent to a separability problem of n-qubit density matrices. We derive lower and upper bounds in terms of chromatic index and the spectrum of the interaction graph. The complexity measure defined by such a computational model is related to gate complexity and a continuous complexity measure introduced in a former paper. We use majorization of graph spectra for classifying Hamiltonians with respect to their computational power.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0106077
dc.identifierhttp://arxiv.org/abs/quant-ph/0106077
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89542
dc.subjectQuantum Physics
dc.titleSimulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity
dc.typetext

Files

Collections

arXiv