.png){kind=icon}
返回
Quantum optimisation for continuous multivariable functions by a structured search
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/ace6cc.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Solving optimisation problems is a promising near-term application of quantum computers. Quantum variational algorithms (QVAs) leverage quantum superposition and entanglement to optimise over exponentially large solution spaces using an alternating sequence of classically tunable unitaries. However, prior work has primarily addressed discrete optimisation problems. In addition, these algorithms have been designed generally under the assumption of an unstructured solution space, which constrains their speedup to the theoretical limits for the unstructured Grover's quantum search algorithm. In this paper, we show that QVAs can efficiently optimise continuous multivariable functions by exploiting general structural properties of a discretised continuous solution space with a convergence that exceeds the limits of an unstructured quantum search. We present the quantum multivariable optimisation algorithm and demonstrate its advantage over pre-existing methods, particularly when optimising high-dimensional and oscillatory functions.
Keyword:
quantum variational algorithms
QAOA
optimisation
multivariable
continuous functions
期刊
IF:
5
论文数:
1.4K
被引数:
5.1K
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏Incidence of Hepatitis C Infection among Prisoners by Routine Laboratory Values during a 20-Year PeriodPLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏分享收藏
查看更多内容