Quantum computing for genomics: conceptual challenges and practical perspectives
arXiv:2507.04111 · doi:10.1103/h49j-bsc6
Abstract
We assess the potential of quantum computing to accelerate computation of central tasks in genomics, focusing on often-neglected theoretical limitations. We discuss state-of-the-art challenges of quantum search, optimization, and machine learning algorithms. Examining database search with Grover's algorithm, we show that the expected speedup vanishes under realistic assumptions. For combinatorial optimization prevalent in genomics, we discuss the limitations of theoretical complexity in practice and suggest carefully identifying problems genuinely suited for quantum acceleration. Given the competition from excellent classical approximate solvers, quantum computing could offer a speedup in the near future only for a specific subset of hard enough tasks in assembly, gene selection, and inference. These tasks need to be characterized by core optimization problems that are particularly challenging for classical methods while requiring relatively limited variables. We emphasize rigorous empirical validation through runtime scaling analysis to avoid misleading claims of quantum advantage. Finally, we discuss the problem of trainability and data-loading in quantum machine learning. This work advocates for a balanced perspective on quantum computing in genomics, guiding future research toward targeted applications and robust validation.
14 pages, 5 figures
References in corpus (84)
- Quantum Computing in the NISQ era and beyond
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Quantum algorithm for solving linear systems of equations
- Variational Quantum Algorithms
- Surface codes: Towards practical large-scale quantum computation
- Ising formulations of many NP problems
- Supervised learning with quantum enhanced feature spaces
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- A Quantum Engineer's Guide to Superconducting Qubits
- Adiabatic Quantum Computing
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Chemistry in the Age of Quantum Computing
- An introduction to quantum machine learning
- Suppressing quantum errors by scaling a surface code logical qubit
- Quantum algorithms: an overview
- Quantum random access memory
- Quantum annealing with more than one hundred qubits
- Theory of Quantum Annealing of an Ising Spin Glass
- Challenges and Opportunities in Quantum Machine Learning
- Quantum error correction below the surface code threshold
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum Annealing and Analog Quantum Computation
- Quantum computing for finance: overview and prospects
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Defining and detecting quantum speedup
- Quantum Error Mitigation
- A rigorous and robust quantum speed-up in supervised machine learning
- High-threshold and low-overhead fault-tolerant quantum memory
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
- Magic state distillation with low overhead
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Preconditioned quantum linear system algorithm
- What is the Computational Value of Finite Range Tunneling?
- Coherent quantum annealing in a programmable 2000-qubit Ising chain
- Barren Plateaus in Variational Quantum Computing
- Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
- The prospects of quantum computing in computational molecular biology
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Challenges and Opportunities in Quantum Optimization
- Quantum annealing versus classical machine learning applied to a simplified computational biology problem
- Circuit-Based Quantum Random Access Memory for Classical Data
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Quantum Computing at the Frontiers of Biological Sciences
- Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Quantum computers as universal quantum simulators: state-of-art and perspectives
- Quantum Algorithm Implementations for Beginners
- On the robustness of bucket brigade quantum RAM
- Beyond-classical computation in quantum simulation
- Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
- Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
- Scalable measures of magic resource for quantum computers
- MAXCUT QAOA performance guarantees for p >1
- The state of quantum computing applications in health and medicine
- Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
- Biology and medicine in the landscape of quantum advantages
- Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
- Quantum-enhanced Markov chain Monte Carlo
- Does provable absence of barren plateaus imply classical simulability?
- Genome assembly using quantum and quantum-inspired annealing
- QuASeR -- Quantum Accelerated De Novo DNA Sequence Reconstruction
- Classical surrogates for quantum learning models
- Quantum algorithms: A survey of applications and end-to-end complexities
- Polymer Physics by Quantum Computing
- Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industries
- Challenges of variational quantum optimization with measurement shot noise
- Scaling overhead of embedding optimization problems in quantum annealing
- Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
- Quantum computing for chemistry and physics applications from a Monte Carlo perspective
- Absence of barren plateaus in finite local-depth circuits with long-range entanglement
- Grover search revisited; application to image pattern matching
- Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
- How quantum computing can enhance biomarker discovery
- Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers
- Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
- Optimization by Decoded Quantum Interferometry
- Graph kernels encoding features of all subgraphs by quantum superposition
- Multiple Network Alignment on Quantum Computers
- From quantum-enhanced to quantum-inspired Monte Carlo
- A QUBO formulation for the Tree Containment problem