Estimating Algorithmic Information using Quantum Computing for Genomics Applications

Abstract

Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics. The canonical computation model of the Turing machine is restricted in time and space resources, to make the target metrics computable under realistic assumptions. The universal prior distribution for the automata is obtained as a quantum superposition, which is further conditioned to estimate the metrics. Specific cases are explored where the quantum implementation offers polynomial advantage, in contrast to an indispensable exhaustive enumeration in the corresponding classical case. The unstructured output data and the computational irreducibility of Turing machines make this algorithm impossible to approximate using heuristics. Thus, exploring the space of program-output relations is one of the most promising problems for demonstrating quantum supremacy using Grover search that cannot be dequantized. Experimental use cases for quantum acceleration are developed for self-replicating programs and algorithmic complexity of short strings. With quantum computing hardware rapidly attaining technological maturity, we discuss how this framework will have significant advantage for various genomics applications in meta-biology, phylogenetic tree analysis, protein-protein interaction mapping and synthetic biology. This is the first time experimental algorithmic information theory is implemented using quantum computation. Our implementation on the Qiskit quantum programming platform is copy-left and can be found on https://github.com/Advanced-Research-Centre/QPULBA

Ten principles for responsible quantum innovation

“…QT roadmaps developed by governments, companies, and consulting firms worldwide anticipate various opportunities, challenges, and risks arising within the next 25 years. Some challenges demand immediate attention, such as establishing practical solutions to protect privacy [109] and ensure information security [110] in light of quantum computing's threat to widely used public key cryptosystems 13 . Other ELSPI of QT may emerge in the longer term, but proactive measures are necessary to guarantee responsible quantum R&D. Previous cycles of technological innovation-including currently AI-teach us that important ELSPI that can emerge in the longer term [72].…”

Quantum Accelerated Causal Tomography: Circuit Considerations For Applications In Bioinformatics and AGI

“…In [14] a global/objective view is presented, which involves quantum automata for algorithmic information. A framework for causal inference based on algorithmic generative models is developed.…”

QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers

“…State of the art development of the QAOA algorithm in practice is shown to be advancing, with a wide variety of algorithms shown for different, but similar problems. While these NP-hard problems are similar, it has been shown that QAOA is not well suited for every problem [54]. In some cases, such as the Ising problem, current classical approximations are expected to perform better and alternatives like the quantum adiabatic algorithm might be a better fit.…”