Mostrar el registro sencillo del ítem

New coding scheme to compile circuits for quantum approximate optimization algorithm by genetic evolution

dc.contributor.authorArufe Rivas, Lis 
dc.contributor.authorRasconi, R.
dc.contributor.authorOddi, A.
dc.contributor.authorVarela Arias, José Ramiro 
dc.contributor.authorGonzález Fernández, Miguel Ángel 
dc.date.accessioned2023-11-07T09:59:41Z
dc.date.available2023-11-07T09:59:41Z
dc.date.issued2023
dc.identifier.citationApplied soft Computing, 144 (2023); doi:10.1016/j.asoc.2023.110456
dc.identifier.issn1568-4946
dc.identifier.urihttps://hdl.handle.net/10651/70274
dc.description.sponsorshipThis research has been supported by the Spanish Government, AEI under research project PID2019-106263RB-I00 . A. Oddi and R. Rasconi were supported by the PNRR MUR project PE0000013-FAIR and ESA, France Contract No. 4000112300/14/D/MRP “Mars Express Data Planning Tool MEXAR2 Maintenance”.
dc.language.isoeng
dc.relation.ispartofApplied soft Computing
dc.rights© 2023 The Author(s)
dc.rightsCC Reconocimiento – No Comercial – Sin Obra Derivada 4.0 Internacional
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.sourceScopus
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85161994901&doi=10.1016%2fj.asoc.2023.110456&partnerID=40&md5=8f04403238d42dc3a676dfb6ee7a49f7
dc.titleNew coding scheme to compile circuits for quantum approximate optimization algorithm by genetic evolution
dc.typejournal article
dc.identifier.doi10.1016/j.asoc.2023.110456
dc.local.notesOA ATUO23
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-106263RB-I00/ES/SCHEDULING, OPTIMIZACION, NUEVOS RETOS, NUEVOS METODOS/
dc.relation.publisherversionhttp://dx.doi.org/10.1016/j.asoc.2023.110456
dc.rights.accessRightsopen access
dc.type.hasVersionVoR


Ficheros en el ítem

untranslated

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

© 2023 The Author(s)
Este ítem está sujeto a una licencia Creative Commons