A Novel Quantum Algorithm for Efficient Attractor Search in Gene Regulatory Networks
- URL: http://arxiv.org/abs/2408.08814v1
- Date: Fri, 16 Aug 2024 15:48:45 GMT
- Title: A Novel Quantum Algorithm for Efficient Attractor Search in Gene Regulatory Networks
- Authors: Mirko Rossini, Felix M. Weidner, Joachim Ankerhold, Hans A. Kestler,
- Abstract summary: We demonstrate a novel quantum search algorithm inspired by Grover's algorithm to be implemented on quantum computing platforms.
The algorithm performs an iterative suppression of states belonging to basins of previously discovered attractors from a uniform superposition.
Tests of its resistance to noise have also shown promising performance on devices from the current Noise Intermediate Scale Quantum Computing (NISQ) era.
- Score: 0.0978224644130106
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The description of gene interactions that constantly occur in the cellular environment is an extremely challenging task due to an immense number of degrees of freedom and incomplete knowledge about microscopic details. Hence, a coarse-grained and rather powerful modeling of such dynamics is provided by Boolean Networks (BNs). BNs are dynamical systems composed of Boolean agents and a record of their possible interactions over time. Stable states in these systems are called attractors which are closely related to the cellular expression of biological phenotypes. Identifying the full set of attractors is, therefore, of substantial biological interest. However, for conventional high-performance computing, this problem is plagued by an exponential growth of the dynamic state space. Here, we demonstrate a novel quantum search algorithm inspired by Grover's algorithm to be implemented on quantum computing platforms. The algorithm performs an iterative suppression of states belonging to basins of previously discovered attractors from a uniform superposition, thus increasing the amplitudes of states in basins of yet unknown attractors. This approach guarantees that a new attractor state is measured with each iteration of the algorithm, an optimization not currently achieved by any other algorithm in the literature. Tests of its resistance to noise have also shown promising performance on devices from the current Noise Intermediate Scale Quantum Computing (NISQ) era.
Related papers
- Subspace-Search Quantum Imaginary Time Evolution for Excited State Computations [0.0]
We introduce the em subspace search quantum imaginary time evolution (SSQITE) method, which calculates excited states using quantum devices.
With its robustness in avoiding local minima, SSQITE shows promise for advancing quantum computations of excited states across a wide range of applications.
arXiv Detail & Related papers (2024-07-15T19:14:45Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Classical simulation of short-time quantum dynamics [0.0]
We present classical algorithms for approximating the dynamics of local observables and nonlocal quantities.
We establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.
arXiv Detail & Related papers (2022-10-20T18:00:04Z) - Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra.
A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
arXiv Detail & Related papers (2022-09-28T20:24:53Z) - Quantum bandit with amplitude amplification exploration in an
adversarial environment [9.563657204041682]
We propose a quantum-inspired bandit learning approach for the learning-and-adapting-based offloading problem.
A new action update strategy and novel probabilistic action selection are adopted, provoked by the amplitude amplification and collapse in quantum theory.
The proposed algorithm is generalized, via the devised mapping, for better learning weight adjustments on favourable/unfavourable actions.
arXiv Detail & Related papers (2022-08-15T12:40:34Z) - Optimal quantum control via genetic algorithms for quantum state
engineering in driven-resonator mediated networks [68.8204255655161]
We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms.
We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator.
We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
arXiv Detail & Related papers (2022-06-29T14:34:00Z) - Simulating strongly interacting Hubbard chains with the Variational
Hamiltonian Ansatz on a quantum computer [0.0]
Variational Quantum Eigensolver (VQE) has been implemented to study molecules and condensed matter systems on small size quantum computers.
We try to answer the question: how much of the underlying physics of a 1D Hubbard chain is described by a problem-inspired Variational Hamiltonian Ansatz (VHA) in a broad range of parameter values.
Our findings suggest that even low fidelity solutions capture energy and number of doubly occupied sites well, while spin-spin correlations are not well captured even when the solution is of high fidelity.
arXiv Detail & Related papers (2021-11-23T16:54:36Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.