Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2211.03941 · Quantum Science and Technology

T-depth-optimized quantum search with quantum data-access machine

Jung Jun Park, Kyunghyun Baek, M S Kim, Hyunchul Nha, Jaewan Kim, Jeongho Bang

Published Oct 19, 2023• 3 citations
arXivHTMLPDF

Abstract

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. Specifically, we introduce a measure involving two computational complexities, i.e. quantum query and T-depth complexities, which can be critical to assess performance since the logical non-Clifford gates, such as the T (i.e. π / 8 rotation) gate, are known to be costliest to implement in FTQC. Our analysis 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 analysis reveals that our QDAM-embedded quantum search requires O ( N × log N ) runtime cost. Our study thus demonstrates that the quantum data search algorithm can truly speed up over classical approaches with the logarithmic T-depth QDAM as a key component.

DOI
10.1088/2058-9565/ad04e5

Related papers

Hardware Efficient Quantum Search Algorithm

Ji Liu, Huiyang Zhou

Quantum computing has noteworthy speedup over classical computing by taking advantage of quantum parallelism, i.e., the superposition of states. In particular, quantum search is widely used in various computationally hard problems. Grover's search algorithm finds the target element in an unsorted database with quadratic speedup than classical search and has been proved to be optimal in terms of the number of queries to the database. The challenge, however, is that Grover's search algorithm leads to high numbers of quantum gates, which make it infeasible for the Noise-Intermediate-Scale-Quantum (NISQ) computers. In this paper, we propose a novel hardware efficient quantum search algorithm to overcome this challenge. Our key idea is to replace the global diffusion operation with low-cost local diffusions. Our analysis shows that our algorithm has similar oracle complexity to the original Grover's search algorithm while significantly reduces the circuit depth and gate count. The circuit cost reduction leads to a remarkable improvement in the system success rates, paving the way for quantum search on NISQ machines.

arXiv:2103.14196•Mar 26, 2021•15 citations

Quantum Search using Grover’s Algorithm: Principles, Performance, and Applications

Anggit Gusti Nugraheni, Heri Mahyuzar, Sri Hastuti

Quantum search is one of the most important algorithmic developments in quantum computing because it demonstrates how quantum principles can improve the efficiency of solving unstructured search problems. Grover’s algorithm provides a quadratic speed-up over classical linear search by reducing query complexity from O(N) to O(√N), where N represents the size of the search space. This review examines the principles, performance, and applications of Grover’s algorithm, with emphasis on its theoretical foundation and practical relevance. The discussion covers the roles of superposition, quantum interference, oracle operations, diffusion operators, and amplitude amplification in increasing the probability of measuring a desired solution. The manuscript also reviews the computational performance of quantum search in comparison with classical search methods and considers its relevance to database searching, combinatorial optimisation, cryptography, machine learning, bioinformatics, quantum chemistry, and materials science. The review highlights that Grover’s algorithm is not limited to database retrieval, as many computationally intensive problems can be reformulated as search or optimisation tasks. However, practical implementation remains constrained by current quantum hardware limitations, including decoherence, quantum noise, limited qubit availability, circuit depth, and the difficulty of designing efficient oracles. Despite these challenges, continuing progress in quantum hardware, error correction, cloud-based quantum platforms, and hybrid quantum-classical architectures suggests that quantum search will remain an important area of research. Overall, Grover’s algorithm represents a foundational quantum algorithm with significant theoretical value and potential long-term application in computational domains involving large and unstructured search spaces.

Asian journal of mathematics and computer research•Jun 23, 2026•0 citations

Quantum algorithms

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter highlights quantum algorithms as a gate-based computational framework that exploits superposition, entanglement, and phase-coherent interference to realize demonstrable complexity reductions on selected problems. It begins by formally distinguishing quantum algorithms from classical deterministic and randomized computation through reversible unitary evolution, oracle-based problem access, and the measurement constraint that collapses quantum state information, thereby motivating amplitude-engineering strategies that amplify correct outcomes while suppressing incorrect ones. This chapter then surveys quantum speedup as a nuanced concept, clarifying that advantage is problem-dependent, often derived under idealized fault-tolerant assumptions, and practically bounded in noisy intermediate-scale quantum devices by decoherence, gate infidelity, circuit-depth overhead, and benchmarking/verification limitations. Two canonical algorithmic families are developed in depth: Shor’s algorithm, framed as reduction of integer factorization to order/period finding via coherent modular exponentiation and the quantum Fourier transform with explicit resource and cryptographic implications; and Grover’s algorithm, formulated as optimal unstructured search through oracle phase marking, diffusion (inversion about the mean), and its generalization to amplitude amplification as a reusable primitive. Building on these exemplars, this chapter distills design principles for constructing effective quantum algorithms, including superposition management, oracle synthesis and state manipulation, and systematic minimization of gate count, depth, and expensive non-Clifford resources under hardware constraints. It concludes by mapping these foundations to active research directions—quantum approximation methods such as quantum approximate optimization algorithm, hybrid quantum–classical variational workflows, and quantum machine learning—highlighting how practical progress depends on hardware-aware compilation, resource optimization, and interference-driven algorithm design.

CRC Press eBooks•Nov 6, 2026•0 citations

Demonstration of quantum advantage in machine learning

Diego Ristè, Marcus Palmer Da Silva, Colm A. Ryan +6 more

Abstract The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle, whose structure encodes the solution. One measure of the algorithmic performance is the query complexity, i.e., the scaling of the number of oracle calls needed to find the solution with a given probability. Few-qubit demonstrations of quantum algorithms, such as Deutsch–Jozsa and Grover, have been implemented across diverse physical systems such as nuclear magnetic resonance, trapped ions, optical systems, and superconducting circuits. However, at the small scale, these problems can already be solved classically with a few oracle queries, limiting the obtained advantage. Here we solve an oracle-based problem, known as learning parity with noise, on a five-qubit superconducting processor. Executing classical and quantum algorithms using the same oracle, we observe a large gap in query count in favor of quantum processing. We find that this gap grows by orders of magnitude as a function of the error rates and the problem size. This result demonstrates that, while complex fault-tolerant architectures will be required for universal quantum computing, a significant quantum advantage already emerges in existing noisy systems.

arXiv:1512.06069•npj Quantum Information•Apr 7, 2017•219 citations

Comparative Analysis of Query Complexity in Oracle-Based Quantum Algorithms

Ch. Vijay Anil Dai, T. Niranjan Kumar, M. Sateesh +1 more

Oracle-based quantum computation reframes efficiency from classical time/space costs to query complexity, i.e., the number of accesses to a black-box unitary oracle Uf needed to reveal a hidden property or target state. This study comparatively analyzes query complexity across four canonical oracle-driven algorithms—Deutsch’s, Bernstein–Vazirani, Grover’s search, and Amplitude Amplification—to clarify how superposition, entanglement, interference, and phase kickback translate into provable speedups independent of hardware details. The objective is to systematically connect oracle structure to achievable quantum advantage by contrasting exact, single-query interference algorithms with iterative, probabilistic rotation-based algorithms, and by benchmarking classical deterministic/probabilistic query requirements against quantum bounds. Methodologically, we (i) mathematically model Deutsch and Bernstein–Vazirani via stepwise state-vector evolution to expose phase kickback and phase-encoded answer extraction in one oracle call, (ii) geometrically track Grover and Amplitude Amplification as two-dimensional state-space rotations, quantifying how repeated oracle-driven reflections amplify success amplitude, and (iii) compute classical query baselines and compare them directly with quantum query scaling. Results show that Deutsch reduces classical 2 queries to exactly 1 quantum query for constant-versus-balanced testing, while Bernstein–Vazirani deterministically recovers an n-bit hidden string s with (O(1)) quantum queries versus (O(n)) classical queries. For unstructured search over (N=2n) items, Grover achieves a bounded-error quadratic improvement from (O(N)) to (O(√{N}) queries, and Amplitude Amplification generalizes this to boost success probability from (p) to near certainty in O (1/√p) oracle applications. The central implication is a structural divide: rigid algebraic structure permits maximal, single-query speedups, whereas unstructured “chaos” necessitates iterative geometric amplification, which is more broadly applicable but demands highly stable, error-corrected hardware; consequently, quantum systems are best viewed as specialized co-processors activated when oracle structure warrants a quantum shortcut.

JOURNAL OF ADVANCE AND FUTURE RESEARCH•Jun 1, 2026•0 citations

Quantum Algorithms for Trading: A Survey of Speedups, Thresholds, and Dequantization

Luigi Laura, Marco Parrillo, Alessio Pascucci +2 more

Quantum algorithms for trading span computational tasks with different input models and standards of evidence. This structured critical review describes its search scope, selection criteria and limitations, and distinguishes reported findings from author assessments. Amplitude estimation estimates bounded expectations to additive error ϵ with O(ϵ−1) oracle queries rather than the O(ϵ−2) samples of plain classical Monte Carlo at fixed confidence. This query advantage does not establish an end-to-end runtime advantage: state preparation, arithmetic, error correction and classical competitors must also be costed. Published resource estimates for benchmark exotics require thousands of logical qubits and demanding logical operation rates. An illustrative sensitivity analysis shows how the crossover depends on classical throughput, oracle depth and the comparison window; its numbers are scenarios, not calibrated hardware forecasts. Portfolio and trading-trajectory formulations have device demonstrations, but a 250-instance benchmark of discretized minimum-variance allocation finds classical mixed-integer programming and a tailored heuristic superior on the tested formulation. Specific low-rank quantum machine learning algorithms have been dequantized under analogous sampling-access assumptions. Separately, a controlled study of quantum kernels for Chinese equity returns finds no significant advantage and demonstrates sensitivity to evaluation design; this does not settle other learning tasks. Entanglement-assisted coordination offers advantages in specified nonlocal games without computational-complexity assumptions, while its financial implementation and economics remain open. We distinguish computational performance from economic value and identify input/output costs, structured algorithms, reproducible benchmarking and explicit financial evaluation as priorities.

Information•Sep 17, 2026•0 citations
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. Specifically, we introduce a measure involving two computational complexities, i.e. quantum query and T-depth complexities, which can be critical to assess performance since the logical non-Clifford gates, such as the T (i.e. π / 8 rotation) gate, are known to be costliest to implement in FTQC. Our analysis 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 analysis reveals that our QDAM-embedded quantum search requires O ( N × log N ) runtime cost. Our study thus demonstrates that the quantum data search algorithm can truly speed up over classical approaches with the logarithmic T-depth QDAM as a key component.
Quantum computing has noteworthy speedup over classical computing by taking advantage of quantum parallelism, i.e., the superposition of states. In particular, quantum search is widely used in various computationally hard problems. Grover's search algorithm finds the target element in an unsorted database with quadratic speedup than classical search and has been proved to be optimal in terms of the number of queries to the database. The challenge, however, is that Grover's search algorithm leads to high numbers of quantum gates, which make it infeasible for the Noise-Intermediate-Scale-Quantum (NISQ) computers. In this paper, we propose a novel hardware efficient quantum search algorithm to overcome this challenge. Our key idea is to replace the global diffusion operation with low-cost local diffusions. Our analysis shows that our algorithm has similar oracle complexity to the original Grover's search algorithm while significantly reduces the circuit depth and gate count. The circuit cost reduction leads to a remarkable improvement in the system success rates, paving the way for quantum search on NISQ machines.
Quantum search is one of the most important algorithmic developments in quantum computing because it demonstrates how quantum principles can improve the efficiency of solving unstructured search problems. Grover’s algorithm provides a quadratic speed-up over classical linear search by reducing query complexity from O(N) to O(√N), where N represents the size of the search space. This review examines the principles, performance, and applications of Grover’s algorithm, with emphasis on its theoretical foundation and practical relevance. The discussion covers the roles of superposition, quantum interference, oracle operations, diffusion operators, and amplitude amplification in increasing the probability of measuring a desired solution. The manuscript also reviews the computational performance of quantum search in comparison with classical search methods and considers its relevance to database searching, combinatorial optimisation, cryptography, machine learning, bioinformatics, quantum chemistry, and materials science. The review highlights that Grover’s algorithm is not limited to database retrieval, as many computationally intensive problems can be reformulated as search or optimisation tasks. However, practical implementation remains constrained by current quantum hardware limitations, including decoherence, quantum noise, limited qubit availability, circuit depth, and the difficulty of designing efficient oracles. Despite these challenges, continuing progress in quantum hardware, error correction, cloud-based quantum platforms, and hybrid quantum-classical architectures suggests that quantum search will remain an important area of research. Overall, Grover’s algorithm represents a foundational quantum algorithm with significant theoretical value and potential long-term application in computational domains involving large and unstructured search spaces.
This chapter highlights quantum algorithms as a gate-based computational framework that exploits superposition, entanglement, and phase-coherent interference to realize demonstrable complexity reductions on selected problems. It begins by formally distinguishing quantum algorithms from classical deterministic and randomized computation through reversible unitary evolution, oracle-based problem access, and the measurement constraint that collapses quantum state information, thereby motivating amplitude-engineering strategies that amplify correct outcomes while suppressing incorrect ones. This chapter then surveys quantum speedup as a nuanced concept, clarifying that advantage is problem-dependent, often derived under idealized fault-tolerant assumptions, and practically bounded in noisy intermediate-scale quantum devices by decoherence, gate infidelity, circuit-depth overhead, and benchmarking/verification limitations. Two canonical algorithmic families are developed in depth: Shor’s algorithm, framed as reduction of integer factorization to order/period finding via coherent modular exponentiation and the quantum Fourier transform with explicit resource and cryptographic implications; and Grover’s algorithm, formulated as optimal unstructured search through oracle phase marking, diffusion (inversion about the mean), and its generalization to amplitude amplification as a reusable primitive. Building on these exemplars, this chapter distills design principles for constructing effective quantum algorithms, including superposition management, oracle synthesis and state manipulation, and systematic minimization of gate count, depth, and expensive non-Clifford resources under hardware constraints. It concludes by mapping these foundations to active research directions—quantum approximation methods such as quantum approximate optimization algorithm, hybrid quantum–classical variational workflows, and quantum machine learning—highlighting how practical progress depends on hardware-aware compilation, resource optimization, and interference-driven algorithm design.
Abstract The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle, whose structure encodes the solution. One measure of the algorithmic performance is the query complexity, i.e., the scaling of the number of oracle calls needed to find the solution with a given probability. Few-qubit demonstrations of quantum algorithms, such as Deutsch–Jozsa and Grover, have been implemented across diverse physical systems such as nuclear magnetic resonance, trapped ions, optical systems, and superconducting circuits. However, at the small scale, these problems can already be solved classically with a few oracle queries, limiting the obtained advantage. Here we solve an oracle-based problem, known as learning parity with noise, on a five-qubit superconducting processor. Executing classical and quantum algorithms using the same oracle, we observe a large gap in query count in favor of quantum processing. We find that this gap grows by orders of magnitude as a function of the error rates and the problem size. This result demonstrates that, while complex fault-tolerant architectures will be required for universal quantum computing, a significant quantum advantage already emerges in existing noisy systems.
Oracle-based quantum computation reframes efficiency from classical time/space costs to query complexity, i.e., the number of accesses to a black-box unitary oracle Uf needed to reveal a hidden property or target state. This study comparatively analyzes query complexity across four canonical oracle-driven algorithms—Deutsch’s, Bernstein–Vazirani, Grover’s search, and Amplitude Amplification—to clarify how superposition, entanglement, interference, and phase kickback translate into provable speedups independent of hardware details. The objective is to systematically connect oracle structure to achievable quantum advantage by contrasting exact, single-query interference algorithms with iterative, probabilistic rotation-based algorithms, and by benchmarking classical deterministic/probabilistic query requirements against quantum bounds. Methodologically, we (i) mathematically model Deutsch and Bernstein–Vazirani via stepwise state-vector evolution to expose phase kickback and phase-encoded answer extraction in one oracle call, (ii) geometrically track Grover and Amplitude Amplification as two-dimensional state-space rotations, quantifying how repeated oracle-driven reflections amplify success amplitude, and (iii) compute classical query baselines and compare them directly with quantum query scaling. Results show that Deutsch reduces classical 2 queries to exactly 1 quantum query for constant-versus-balanced testing, while Bernstein–Vazirani deterministically recovers an n-bit hidden string s with (O(1)) quantum queries versus (O(n)) classical queries. For unstructured search over (N=2n) items, Grover achieves a bounded-error quadratic improvement from (O(N)) to (O(√{N}) queries, and Amplitude Amplification generalizes this to boost success probability from (p) to near certainty in O (1/√p) oracle applications. The central implication is a structural divide: rigid algebraic structure permits maximal, single-query speedups, whereas unstructured “chaos” necessitates iterative geometric amplification, which is more broadly applicable but demands highly stable, error-corrected hardware; consequently, quantum systems are best viewed as specialized co-processors activated when oracle structure warrants a quantum shortcut.
Quantum algorithms for trading span computational tasks with different input models and standards of evidence. This structured critical review describes its search scope, selection criteria and limitations, and distinguishes reported findings from author assessments. Amplitude estimation estimates bounded expectations to additive error ϵ with O(ϵ−1) oracle queries rather than the O(ϵ−2) samples of plain classical Monte Carlo at fixed confidence. This query advantage does not establish an end-to-end runtime advantage: state preparation, arithmetic, error correction and classical competitors must also be costed. Published resource estimates for benchmark exotics require thousands of logical qubits and demanding logical operation rates. An illustrative sensitivity analysis shows how the crossover depends on classical throughput, oracle depth and the comparison window; its numbers are scenarios, not calibrated hardware forecasts. Portfolio and trading-trajectory formulations have device demonstrations, but a 250-instance benchmark of discretized minimum-variance allocation finds classical mixed-integer programming and a tailored heuristic superior on the tested formulation. Specific low-rank quantum machine learning algorithms have been dequantized under analogous sampling-access assumptions. Separately, a controlled study of quantum kernels for Chinese equity returns finds no significant advantage and demonstrates sensitivity to evaluation design; this does not settle other learning tasks. Entanglement-assisted coordination offers advantages in specified nonlocal games without computational-complexity assumptions, while its financial implementation and economics remain open. We distinguish computational performance from economic value and identify input/output costs, structured algorithms, reproducible benchmarking and explicit financial evaluation as priorities.