.png){kind=icon}
返回
Efficient parallelization of quantum basis state shift
.png){kind=icon}
PRE
AI
DOI：10.1088/2058-9565/acfab7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Basis state shift is central to many quantum algorithms, most notably the quantum walk. Efficient implementations are of major importance for achieving a quantum speedup for computational applications. We optimize the state shift algorithm by incorporating the shift in different directions in parallel. This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods, giving a linear scaling in the number of gates versus working qubits in contrast to the quadratic scaling of the state-of-the-art method based on the quantum Fourier transform. For a one-dimensional array of size 2( n) for n > 4, we derive the total number of 15n+74 two-qubit CX gates in the parallel circuit, using a total of 2(n)-2 qubits including an ancilla register for the decomposition of multi-controlled gates. We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.
Keyword:
quantum basis state shift
quantum walk
state propagation
期刊
IF:
5
论文数:
1.4K
被引数:
5.1K
机构
暂无机构信息
.png){kind=icon}
没有更多内容