Quantum and Quantum-inspired Methods for de novo Discovery of Altered Cancer Pathways

The combinatorial calculations for de novo discovery of altered pathways in cancer cohorts involve both coverage (i.e. recurrence) and mutual exclusivity, and solving mutual exclusivity problems is NP-hard for classical computers. Advances in quantum computing systems and our classical, quantum-inspired algorithm GAMA (Graver Aug-mented Multi-seed Algorithm) motivated us to revisit methods for identifying altered pathways. Using different types of quantum and classical algorithms, we report novel formulations of the problem that are tailored to these new computational models. Our formulations require fewer binary variables than available methods, and offer a tuning parameter that allows a trade-off between coverage and exclusivity; varying this parameter returns a variety of solutions. We illustrate our formulations and methods with TCGA mutation data for Acute Myeloid Leukemia (AML). Both the D-Wave quantum annealing solver and the classical GAMA solver returned altered pathways that are known to be important in AML, with different tuning parameter values returning alternative altered pathways. Our reduced-variable algorithm and QUBO problem for-mulations demonstrate how quantum annealing-based binary optimization solvers can be used now in cancer genomics.

[1]  Benjamin J. Raphael,et al.  Genomic and epigenomic landscapes of adult de novo acute myeloid leukemia. , 2013, The New England journal of medicine.

[2]  Shi-Hua Zhang,et al.  Efficient methods for identifying mutated driver pathways in cancer , 2012, Bioinform..

[3]  Niko Beerenwinkel,et al.  Computational approaches for the identification of cancer genes and pathways , 2016, Wiley interdisciplinary reviews. Systems biology and medicine.

[4]  Xia Li,et al.  Identifying mutual exclusivity across cancer genomes: computational approaches to discover genetic interaction and reveal tumor vulnerability , 2019, Briefings Bioinform..

[5]  Catherine C. McGeoch.  Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice , 2014, Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice.

[6]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[7]  Sridhar Tayur,et al.  The Topology of Mutated Driver Pathways , 2019, bioRxiv.

[8]  M. W. Johnson,et al.  Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor , 2010, 1004.1628.

[9]  Alexander Elgart,et al.  The Adiabatic Theorem of Quantum Mechanics , 1998 .

[10]  John Preskill,et al.  Quantum Computing in the NISQ era and beyond , 2018, Quantum.

[11]  Zhongming Zhao,et al.  Advances in computational approaches for prioritizing driver mutations and significantly mutated genes in cancer genomes , 2016, Briefings Bioinform..

[12]  Raouf Dridi,et al.  A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations , 2018, ArXiv.

[13]  Niko Beerenwinkel,et al.  Modeling Mutual Exclusivity of Cancer Mutations , 2014, RECOMB.

[14]  M. W. Johnson,et al.  Quantum annealing with manufactured spins , 2011, Nature.

[15]  Raouf Dridi,et al.  Graver Bases via Quantum Annealing with Application to Non-Linear Integer Programs , 2019, ArXiv.

[16]  Eli Upfal,et al.  De Novo Discovery of Mutated Driver Pathways in Cancer , 2011, RECOMB.

[17]  C. Sander,et al.  Mutual exclusivity analysis identifies oncogenic network modules. , 2012, Genome research.

[18]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[19]  Roded Sharan,et al.  Simultaneous Identification of Multiple Driver Pathways in Cancer , 2013, PLoS Comput. Biol..

[20]  Vicky Choi,et al.  Minor-embedding in adiabatic quantum computation: I. The parameter setting problem , 2008, Quantum Inf. Process..

[21]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[22]  S. Onn.  Nonlinear Discrete Optimization , 2010 .

[23]  Mark W. Johnson,et al.  Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor , 2014, IEEE Transactions on Applied Superconductivity.

[24]  Jack E. Graver,et al.  On the foundations of linear and integer linear programming I , 1975, Math. Program..

[25]  Sridhar Tayur,et al.  GAMA: A Novel Algorithm for Non-Convex Integer Programs , 2019, ArXiv.

[26]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .