Citation

BibTex format

@article{Jun:2024:2058-9565/ad04e5,
author = {Jun, Park J and Baek, K and Kim, MS and Nha, H and Kim, J and Bang, J},
doi = {2058-9565/ad04e5},
journal = {Quantum Science and Technology},
title = {T-depth-optimized quantum search with quantum data-access machine},
url = {http://dx.doi.org/10.1088/2058-9565/ad04e5},
volume = {9},
year = {2024}
}

RIS format (EndNote, RefMan)

TY  - JOUR
AB - Quantum search algorithms offer a remarkable advantage of quadraticreduction in query complexity using quantum superposition principle. However, howan actual architecture may access and handle the database in a quantum superposedstate has been largely unexplored so far; the quantum state of data was simply assumedto be prepared and accessed by a black-box operation—so-called oracle, even thoughthis process, if not appropriately designed, may adversely diminish the quantum queryadvantage. Here, we introduce an efficient quantum data-access process, dubbedas quantum data-access machine (QDAM), and present a general architecture forquantum search algorithm. We analyze the runtime of our algorithm in view of thefault-tolerant quantum computation (FTQC) consisting of logical qubits within aneffective quantum error correction code. Specifically, we introduce a measure involvingtwo computational complexities, i.e. quantum query and T-depth complexities, whichcan be critical to assess performance since the logical non-Clifford gates, such as theT (i.e., π/8 rotation) gate, are known to be costliest to implement in FTQC. Ouranalysis shows that for N searching data, a QDAM model exhibiting a logarithmic,i.e., O(log N), growth of the T-depth complexity can be constructed. Further analysisreveals that our QDAM-embedded quantum search requires O(√N × log N) runtimecost. Our study thus demonstrates that the quantum data search algorithm can trulyspeed up over classical approaches with the logarithmic T-depth QDAM as a keycomponent.
AU - Jun,Park J
AU - Baek,K
AU - Kim,MS
AU - Nha,H
AU - Kim,J
AU - Bang,J
DO - 2058-9565/ad04e5
PY - 2024///
SN - 2058-9565
TI - T-depth-optimized quantum search with quantum data-access machine
T2 - Quantum Science and Technology
UR - http://dx.doi.org/10.1088/2058-9565/ad04e5
UR - https://iopscience.iop.org/article/10.1088/2058-9565/ad04e5
VL - 9
ER -