Two Slightly-Entangled NP-Complete Problems

Simple item page
dc.creatorOrus, Roman
dc.date2005-02-02
dc.date.accessioned2026-07-07T06:12:05Z
dc.date.available2026-07-07T06:12:05Z
dc.descriptionWe perform a mathematical analysis of the classical computational complexity of two genuine quantum-mechanical problems, which are inspired in the calculation of the expected magnetizations and the entanglement between subsystems for a quantum spin system. These problems, which we respectively call SES and SESSP, are specified in terms of pure slightly-entangled quantum states of n qubits, and rigorous mathematical proofs that they belong to the NP-Complete complexity class are presented. Both SES and SESSP are, therefore, computationally equivalent to the relevant 3-SAT problem, for which an efficient algorithm is yet to be discovered.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0502022
dc.identifierhttp://arxiv.org/abs/quant-ph/0502022
dc.identifierQuantum Information and Computation, Vol. 5, No. 6 (2005), pp. 449-455
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92683
dc.subjectQuantum Physics
dc.titleTwo Slightly-Entangled NP-Complete Problems
dc.typetext

Files

Collections

arXiv