Gravitational topological quantum computation
dc.contributor.author | Velez, Mario | |
dc.contributor.author | Ospina, Juan | |
dc.contributor.department | Universidad EAFIT. Departamento de Ciencias | spa |
dc.contributor.researchgroup | Lógica y Computación | spa |
dc.creator | Velez, Mario | |
dc.creator | Ospina, Juan | |
dc.date.accessioned | 2021-03-26T21:35:19Z | |
dc.date.available | 2021-03-26T21:35:19Z | |
dc.date.issued | 2007-01-01 | |
dc.description.abstract | A new model in topological quantum computing, named Gravitational Topological Quantum Computing (GTQC), is introduced as an alternative respect to the Anyonic Topological Quantum Computing and DNA Computing. In the new model the quantum computer is the quantum space-time itself and the corresponding quantum algorithms refer to the computation of topological invariants for knots, links and tangles. Some applications of GTQC in quantum complexity theory and computability theory are discussed, particularly it is conjectured that the Khovanov polynomial for knots and links is more hard than #P-hard; and that the homeomorphism problem, which is noncomputable, maybe can be computed after all via a hyper-computer based on GTQC. © Springer-Verlag Berlin Heidelberg 2007. | eng |
dc.identifier | https://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=1619 | |
dc.identifier.doi | 10.1007/978-3-540-73554-0_19 | |
dc.identifier.issn | 03029743 | |
dc.identifier.issn | 16113349 | |
dc.identifier.other | WOS;000249815100018 | |
dc.identifier.other | SCOPUS;2-s2.0-38049080059 | |
dc.identifier.uri | http://hdl.handle.net/10784/27401 | |
dc.language.iso | eng | eng |
dc.publisher | SPRINGER | |
dc.relation.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-38049080059&partnerID=40&md5=7428320db3c9ba501a9ae1c5b59f3adc | |
dc.rights | https://v2.sherpa.ac.uk/id/publication/issn/0302-9743 | |
dc.source | Lecture Notes In Computer Science | |
dc.subject.keyword | Algorithms | eng |
dc.subject.keyword | Computability and decidability | eng |
dc.subject.keyword | Computational complexity | eng |
dc.subject.keyword | DNA | eng |
dc.subject.keyword | Natural sciences computing | eng |
dc.subject.keyword | Polynomials | eng |
dc.subject.keyword | DNA Computing | eng |
dc.subject.keyword | Entanglement | eng |
dc.subject.keyword | Gravitational computer | eng |
dc.subject.keyword | Homeomorphism problem | eng |
dc.subject.keyword | Link invariants | eng |
dc.subject.keyword | Quantum computers | eng |
dc.title | Gravitational topological quantum computation | eng |
dc.type | info:eu-repo/semantics/conferencePaper | eng |
dc.type | conferencePaper | eng |
dc.type | info:eu-repo/semantics/publishedVersion | eng |
dc.type | publishedVersion | eng |
dc.type.local | Documento de conferencia | spa |