BROWSE
Detail
Journal Article
T-depth-optimized quantum search with quantum data-access machine
Cited 2 time in 
Share 
Share
- Authors
- Jung Jun Park, Kyunghyun Baek, M S Kim, Hyunchul Nha, Jaewan Kim, Jeongho Bang2
- Issue Date
- 2024-01
- Citation
- QUANTUM SCIENCE AND TECHNOLOGY, v.9, no.1, pp.1-12
- ISSN
- 2058-9565
- Publisher
- IOP PUBLISHING LTD
- Language
- English
- Type
- Journal Article
- Abstract
- Quantum search algorithms offer a remarkable advantage of quadratic reduction in query complexity using quantum superposition principle. However, how an actual architecture may access and handle the database in a quantum superposed state has been largely unexplored so far; the quantum state of data was simply assumed to be prepared and accessed by a black-box operation—so-called oracle, even though this process, if not appropriately designed, may adversely diminish the quantum query advantage. Here, we introduce an efficient quantum data-access process, dubbed as quantum data-access machine (QDAM), and present a general architecture for quantum search algorithm. We analyze the runtime of our algorithm in view of the fault-tolerant quantum computation (FTQC) consisting of logical qubits within an effective quantum error correction code.
- KSP Keywords
- Black box, Error Correction Code(ECC), Fault-tolerant quantum computation, Quantum Error Correction, Quantum search algorithm, Quantum states, Query complexity, Search Algorithm(GSA), Superposition principle, T-depth, quantum superposition