.png){kind=icon}
Return
Efficient parallelization of quantum basis state shift
.png){kind=icon}
PRE
AI
DOI：10.1088/2058-9565/acfab7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
quantum basis state shift
quantum walk
state propagation
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveImpact of tsunami on texture and mineralogy of a major placer deposit in southwest coast of India
PREAI
ShareSave
no more
no more