Müller Sven, Phillipson Frank
School of Business and Economics, Maastricht University, Minderbroedersberg 4, 6211 LK, Maastricht, The Netherlands.
Applied Cryptography and Quantum Algorithms, TNO, Anna van Buerenplein 1, 2595 DA, The Hague, The Netherlands.
Sci Rep. 2024 Oct 7;14(1):23340. doi: 10.1038/s41598-024-73882-y.
Quantum Computing has emerged as a promising alternative, utilising quantum mechanics for faster computations. This paper explores the nearest neighbour compliance (NNC) Problem in Gate-based Quantum Computers, where quantum gates are constrained to operate on physically adjacent qubits. The NNC problem aims to optimise the insertion of SWAP-gates to ensure compliance with these constraints while minimising their count. This work introduces Quantum Annealing to tackle the NNC problem, proposing two Quadratic Unconstrained Optimisation Problem formulations. The formulations are tested on a contemporary Quantum Annealer, and their performance is compared with previous methods. It shows that the prospect of using Quantum Annealing is promising, however, the current state of the hardware makes that finding the embedding is the limiting factor.
量子计算已成为一种很有前景的替代方案，它利用量子力学实现更快的计算。本文探讨了基于门的量子计算机中的最近邻合规性（NNC）问题，其中量子门被限制在物理上相邻的量子比特上运行。NNC问题旨在优化SWAP门的插入，以确保符合这些约束条件，同时尽量减少其数量。这项工作引入量子退火来解决NNC问题，提出了两种二次无约束优化问题的公式。这些公式在当代量子退火器上进行了测试，并将其性能与以前的方法进行了比较。结果表明，使用量子退火的前景很有希望，然而，硬件的当前状态使得找到嵌入是限制因素。
