Possible quantum algorithms for the Bollobás-Riordan-Tutte polynomial of a ribbon graph

Vista sencilla de ítem
dc.contributor.authorVelez, M.
dc.contributor.authorOspina, J.
dc.contributor.departmentUniversidad EAFIT. Departamento de Cienciasspa
dc.contributor.researchgroupLógica y Computaciónspa
dc.creatorVelez, M.
dc.creatorOspina, J.
dc.date.accessioned2021-03-26T21:35:21Z
dc.date.available2021-03-26T21:35:21Z
dc.date.issued2008-01-01
dc.description.abstractThree possible quantum algorithms, for the computation of the Bollobás-Riordan-Tutte polynomial of a given ribbon graph, are presented and discussed. The first possible algorithm is based on the spanning quasi-trees expansion for generalized Tutte polynomials of generalized graphs and on a quantum version of the Binary Decision Diagram (BDD) for quasi-trees . The second possible algorithm is based on the relation between the Kauffman bracket and the Tutte polynomial; and with an application of the recently introduced Aharonov-Arad-Eban-Landau quantum algorithm. The third possible algorithm is based on the relation between the HOMFLY polynomial and the Tutte polynomial; and with an application of the Wocjan-Yard quantum algorithm. It is claimed that these possible algorithms may be more efficient that the best known classical algorithms. These three algorithms may have interesting applications in computer science at general or in computational biology and bio-informatics in particular. A line for future research based on the categorification project is mentioned.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=2447
dc.identifier.doi10.1117/12.777401
dc.identifier.issn0277786X
dc.identifier.issn1996756X
dc.identifier.otherWOS;000258327300013
dc.identifier.otherSCOPUS;2-s2.0-43649088083
dc.identifier.urihttp://hdl.handle.net/10784/27422
dc.language.isoengeng
dc.publisherSPIE-INT SOC OPTICAL ENGINEERING
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-43649088083&doi=10.1117%2f12.777401&partnerID=40&md5=20229415d9226664723b4bd2ce677441
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/0277-786X
dc.sourceProceedings of SPIE
dc.subject.keywordPotts problemeng
dc.subject.keywordSigned grapheng
dc.subject.keywordTutte polynomialeng
dc.subject.keywordAlgorithmseng
dc.subject.keywordComputer scienceeng
dc.subject.keywordPolynomial approximationeng
dc.subject.keywordQuantum theoryeng
dc.subject.keywordGraph theoryeng
dc.titlePossible quantum algorithms for the Bollobás-Riordan-Tutte polynomial of a ribbon grapheng
dc.typeinfo:eu-repo/semantics/conferencePapereng
dc.typeconferencePapereng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localDocumento de conferenciaspa

Archivos

Colecciones

Documentos de conferencia