Sign Up to like & get
recommendations!
0
Published in 2024 at "npj Quantum Information"
DOI: 10.1038/s41534-025-01082-1
Abstract: The quantum approximate optimization algorithm (QAOA) is a promising algorithm for solving combinatorial optimization problems (COPs), with performance governed by variational parameters {γi,βi}i=0p−1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\{{\gamma }_{i},{\beta }_{i}\}}_{i =…
read more here.
Keywords:
solving combinatorial;
linear ramp;
combinatorial optimization;
usepackage ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2024 at "IEEE Transactions on Circuits and Systems II: Express Briefs"
DOI: 10.1109/tcsii.2024.3380609
Abstract: This brief explores the architectural design and implementation of an Ising-model-based chip for solving combinatorial optimization problems. The proposed chip, which is fabricated through TSMC’s 90-nm complementary metal–oxide–semiconductor process, operates at 100 MHz, has a…
read more here.
Keywords:
solving combinatorial;
design implementation;
optimization problems;
combinatorial optimization ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2017 at "International Journal of Advanced Robotic Systems"
DOI: 10.1177/1729881417705969
Abstract: This article presents a critical evaluation of swarm intelligence techniques for solving combinatorial optimization problems. Since, unarguably, the traveling salesman’s problem is the most developed, studied, and popular combinatorial problem, this study uses it as…
read more here.
Keywords:
intelligence techniques;
solving combinatorial;
swarm intelligence;
evaluation swarm ... See more keywords