{"id":"https://openalex.org/W4391354367","doi":"https://doi.org/10.52783/cana.v30.279","title":"Quantum Computing Algorithms for Nonlinear Optimization Problems","display_name":"Quantum Computing Algorithms for Nonlinear Optimization Problems","publication_year":2023,"publication_date":"2023-12-27","ids":{"openalex":"https://openalex.org/W4391354367","doi":"https://doi.org/10.52783/cana.v30.279"},"language":"en","primary_location":{"id":"doi:10.52783/cana.v30.279","doi":"https://doi.org/10.52783/cana.v30.279","is_oa":true,"landing_page_url":"http://dx.doi.org/10.52783/cana.v30.279","pdf_url":"https://internationalpubls.com/index.php/cana/article/download/279/349","source":{"id":"https://openalex.org/S5406945286","display_name":"Communications on Applied Nonlinear Analysis","issn_l":"1074-133X","issn":["1074-133X"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["anvur-scientific","jufo-1","norway-1","poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications on Applied Nonlinear Analysis","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://internationalpubls.com/index.php/cana/article/download/279/349","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Vinod Kumar Vishwakarma","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I2800614057","display_name":"Kalinga University","ror":"https://ror.org/03afg5j45","country_code":"IN","type":"education","lineage":["https://openalex.org/I2800614057"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Vinod Kumar Vishwakarma","raw_affiliation_strings":["Assistant Professor, Department of Mathematics , Faculty of Science , Kalinga University , Naya Raipur , Chhattisgarh , India","Department of Mathematics, Faculty of Science, Kalinga University, Naya Raipur, Chhattisgarh, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Assistant Professor, Department of Mathematics , Faculty of Science , Kalinga University , Naya Raipur , Chhattisgarh , India","institution_ids":["https://openalex.org/I2800614057"]},{"raw_affiliation_string":"Department of Mathematics, Faculty of Science, Kalinga University, Naya Raipur, Chhattisgarh, India","institution_ids":["https://openalex.org/I2800614057"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2800614057"],"apc_list":null,"apc_paid":null,"fwci":0.2104,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.45152371,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"30","issue":"4","first_page":"01","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-computing","display_name":"quantum computing","score":0.7839999794960022},{"id":"https://openalex.org/keywords/quantum-algorithms","display_name":"quantum algorithms","score":0.7699999809265137},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.949999988079071},{"id":"https://openalex.org/keywords/hybrid-quantum-classical-algorithms","display_name":"hybrid quantum-classical algorithms","score":0.9210000038146973},{"id":"https://openalex.org/keywords/variational-quantum-circuits","display_name":"variational quantum circuits","score":0.9900000095367432},{"id":"https://openalex.org/keywords/quantum-parallelism","display_name":"quantum parallelism","score":0.7540000081062317},{"id":"https://openalex.org/keywords/portfolio-optimization","display_name":"portfolio optimization","score":0.9269999861717224},{"id":"https://openalex.org/keywords/logistics-route-optimization","display_name":"logistics route optimization","score":0.7799999713897705},{"id":"https://openalex.org/keywords/quantum-coherence","display_name":"quantum coherence","score":0.6269999742507935},{"id":"https://openalex.org/keywords/error-correction","display_name":"error correction","score":0.671999990940094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6125890016555786},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.6094403862953186},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4583965241909027},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.44478049874305725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3668021559715271},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.36439579725265503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3502640128135681},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20019418001174927},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09049633145332336},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.52783/cana.v30.279","doi":"https://doi.org/10.52783/cana.v30.279","is_oa":true,"landing_page_url":"http://dx.doi.org/10.52783/cana.v30.279","pdf_url":"https://internationalpubls.com/index.php/cana/article/download/279/349","source":{"id":"https://openalex.org/S5406945286","display_name":"Communications on Applied Nonlinear Analysis","issn_l":"1074-133X","issn":["1074-133X"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["anvur-scientific","jufo-1","norway-1","poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications on Applied Nonlinear Analysis","raw_type":"journal-article"},{"id":"pmh:oai:ojs2.internationalpubls.com:article/279","doi":null,"is_oa":true,"landing_page_url":"https://internationalpubls.com/index.php/cana/article/view/279","pdf_url":null,"source":{"id":"https://openalex.org/S5406945286","display_name":"Communications on Applied Nonlinear Analysis","issn_l":"1074-133X","issn":["1074-133X"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["anvur-scientific","jufo-1","norway-1","poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"1074-133X","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.52783/cana.v30.279","doi":"https://doi.org/10.52783/cana.v30.279","is_oa":true,"landing_page_url":"http://dx.doi.org/10.52783/cana.v30.279","pdf_url":"https://internationalpubls.com/index.php/cana/article/download/279/349","source":{"id":"https://openalex.org/S5406945286","display_name":"Communications on Applied Nonlinear Analysis","issn_l":"1074-133X","issn":["1074-133X"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["anvur-scientific","jufo-1","norway-1","poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications on Applied Nonlinear Analysis","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4391354367.pdf","grobid_xml":"https://content.openalex.org/works/W4391354367.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W2805358412","https://openalex.org/W2910982790","https://openalex.org/W2940151889","https://openalex.org/W2942962312","https://openalex.org/W2963198496","https://openalex.org/W2982469373","https://openalex.org/W2984279929","https://openalex.org/W2987160512","https://openalex.org/W3014953017","https://openalex.org/W3031725910","https://openalex.org/W3037022125","https://openalex.org/W3090652612","https://openalex.org/W3104097946","https://openalex.org/W3131872709","https://openalex.org/W3134863278","https://openalex.org/W3135054987","https://openalex.org/W3137774199","https://openalex.org/W3179874644","https://openalex.org/W3193662797","https://openalex.org/W4226248199","https://openalex.org/W4281851886","https://openalex.org/W4288763019","https://openalex.org/W4296832494","https://openalex.org/W4384697318","https://openalex.org/W4388455174","https://openalex.org/W4388469158"],"related_works":["https://openalex.org/W7211881055","https://openalex.org/W7204774257","https://openalex.org/W7207748363","https://openalex.org/W7208715464","https://openalex.org/W7208773804","https://openalex.org/W7208759113","https://openalex.org/W7207552091","https://openalex.org/W7204791514","https://openalex.org/W7204966501","https://openalex.org/W4401753514"],"abstract_inverted_index":{"The":[0,46,70,204,237],"increasing":[1],"complexity":[2],"of":[3,10,32,72,107,126,152,157,165,173,194,206,244],"real-world":[4,77],"optimization":[5,34,54,145,164,198,250],"problems":[6,35,40,199],"highlights":[7,190],"the":[8,104,116,147,174,191,201],"importance":[9],"this":[11,113,187],"research":[12,114,239],"since":[13],"classical":[14,58,235],"algorithms":[15,74],"are":[16,36,41,87,169,184,224],"unable":[17],"to":[18,51,63,130,143,196],"provide":[19],"efficient":[20],"answers":[21],"in":[22,43,146,154,160,167,186,200],"these":[23,39],"cases.":[24],"Innovative":[25],"methods":[26],"for":[27,48,180,247],"fast":[28],"and":[29,56,67,97,163,222,232],"scalable":[30],"resolution":[31],"nonlinear":[33,249],"required":[37],"because":[38],"prevalent":[42],"many":[44,175],"fields.":[45],"potential":[47,193,246],"quantum":[49,73,93,111,128,140,148],"computing":[50],"speed":[52],"up":[53],"processes":[55],"overcome":[57],"limitations":[59],"is":[60,208,227],"great,":[61],"owing":[62],"its":[64],"superposition":[65],"principles":[66],"intrinsic":[68],"parallelism.":[69],"integration":[71],"(I-QA)":[75],"into":[76],"applications,":[78],"however,":[79],"will":[80],"not":[81],"always":[82],"be":[83],"smooth":[84],"sailing.":[85],"There":[86],"significant":[88],"challenges":[89],"associated":[90],"with":[91,234],"preserving":[92],"coherence,":[94],"correcting":[95],"errors,":[96],"working":[98],"within":[99],"hardware":[100],"limits.":[101],"To":[102],"enable":[103],"simultaneous":[105],"exploration":[106],"solution":[108,220],"spaces":[109],"through":[110,138,210],"parallelism,":[112],"proposes":[115],"Hybrid":[117],"Quantum":[118],"Gradient":[119],"-Classical":[120],"Approach":[121],"(HQG-CA),":[122],"which":[123,189,226],"makes":[124],"use":[125,179],"parameterized":[127],"circuits":[129],"represent":[131],"probable":[132],"solutions.":[133],"Additionally,":[134],"improves":[135],"convergence":[136],"rates":[137],"applying":[139],"gradient":[141],"information":[142],"direct":[144],"state":[149],"space.":[150],"Optimization":[151],"portfolios":[153],"finance,":[155],"adjustment":[156],"model":[158],"parameters":[159],"machine":[161],"learning,":[162],"routes":[166],"logistics":[168],"a":[170,211,241],"few":[171],"examples":[172],"industries":[176],"that":[177],"find":[178],"HQG-CA.":[181],"These":[182],"applications":[183],"explored":[185],"abstract,":[188],"revolutionary":[192],"HQG-CA":[195,207],"solve":[197],"real":[202],"world.":[203],"effectiveness":[205],"assessed":[209],"thorough":[212],"simulation":[213],"experiment.":[214],"Performance":[215],"measures":[216],"such":[217],"algorithmic":[218],"speedup,":[219],"accuracy,":[221],"scalability":[223],"discussed,":[225],"based":[228],"on":[229],"extensive":[230],"testing":[231],"comparison":[233],"alternatives.":[236],"present":[238],"provides":[240],"comprehensive":[242],"evaluation":[243],"HQG-CA's":[245],"tackling":[248],"problems.":[251]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2024-01-31T00:00:00"}