arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0101142quant-ph
收藏

哈密顿路径问题的一种量子计算方案

A quantum computing scheme for the Hamiltonian path problem

G. Sampath

摘要:

提出了一种利用单光子和多缝光栅的量子计算方案,用于求解N个顶点的简单图G上的哈密顿路径问题。光子被输入到一个N狭缝光栅,然后是一个N × N矩阵的“处理单元”。一个单元由一个延迟线和一个带有k个狭缝(0 < k < N)的光栅组成,光栅的输出以由G的邻接矩阵确定的方式被引导到下一行中的k个单元。图中长度为N-1的路径与通过矩阵的物理路径之间存在一对一映射。光子的路径是所有这些物理路径的叠加。光子沿着与G中的哈密顿路径相对应的物理路径所花费的时间是一个固定值,等于N个不同延迟的总和,并且不同于沿着任何其他路径的时间。如果放置在行N中的N个单元的输出中的N个检测器中的任何一个在这个固定时间检测到光子,则该图是哈密顿的。

英文摘要:

A quantum computing scheme that uses a single photon and multiple-slit gratings is suggested for the Hamiltonian path problem on a simple graph G of N vertices. The photon is input to an N-slit grating followed by an N x N matrix of `processing units'. A unit consists of a delay line followed by a grating with k slits (0 < k < N) whose outputs are directed to k units in the next row in a manner determined by the adjacency matrix of G. There is a one-to-one mapping between paths of length N-1 in the graph and physical paths through the matrix. The photon's path is a superposition of all these physical paths. The time taken by the photon along a physical path corresponding to a Hamiltonian path in G is a fixed value equal to the sum of N distinct delays, and is different from the time along any other path. The graph is Hamiltonian if any one of N detectors placed in the output of the N units in row N detects the photon at this fixed time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑