Ben Raphael - Models and Algorithms for Cancer Evolution, Pt. 2/2

Uploaded February 2026 | Updated September 2026, 3 weeks ago

Recorded 24 February 2026. Ben Raphael of Princeton University presents "Models and Algorithms for Cancer Evolution, Pt. 2/2" at IPAM's Mathematics of Cancer: Open Mathematical Problems Workshop.
Abstract: Cancer arises through the accumulation of genetic and epigenetic alterations in the cells of a tissue. This tutorial will describe models and algorithms to address some of the challenges that arise in inferring cancer evolution from high-throughput DNA/RNA sequencing data. These challenges include: deconvolving mixtures of mutations from sequencing of bulk tumor sampling, addressing high rates of error and missing data in single-cell sequencing, modeling copy number aberrations that alter large genomic regions, and leveraging information from regional, spatial and longitudinal sampling.
Learn more online at: https://www.ipam.ucla.edu/programs/workshops/mathematics-of-cancer-open-mathematical-problems/

Ben Raphael - Models and Algorithms for Cancer Evolution, Pt. 2/2 - IPAM at UCLA

Miriam Kuzbary - 0-Surgeries on Links - IPAM at UCLA

Tanushree Shah - Contact cosmetic surgery - IPAM at UCLA

Haiwen Guan - LUCIE Lightweight Uncoupled Climate Emulator long-term stability, physical consistency

Peter Benner - Discovery and Model Reduction of Hamiltonian Systems - IPAM at UCLA

John Jakeman - Forward Uncertainty Quantification - IPAM at UCLA

Paul Newton - Gaming the Cancer-Immunity Cycle by Synchronizing the Dose Schedules - IPAM at UCLA

Smita Krishnaswamy - Cellular Trajectories & Regulatory Networks w/ Neural & Graph ODE Models, 2/2

Max Tegmark - Neural network interpretability: symmetry, geometry and formal verification

Dimitris Giannakis - Operator-theoretic approach, feature extraction & statistical model of climate

$Artur Izmaylov - Quantum SENiority-based Subspace Expansion (Q-SENSE) and Its Extensions Recorded 18 February 2026. Artur Izmaylov of the University of Toronto presents Quantum SENiority-based Subspace Expansion (Q-SENSE) and Its Extensions at IPAMs Bridging the Gap Between NISQ and FTQC Workshop. Abstract: Quantum SENiority-based Subspace Expansion (Q-SENSE) is a hybrid quantum-classical algorithm that interpolates between the Variational Quantum Eigensolver (VQE) and Configuration Interaction (CI) methods. It constructs Hamiltonian matrix elements on a quantum device and solves the resulting eigenvalue problem classically. Unlike other expansion-based methods — such as Quantum Subspace Expansion (QSE), Quantum Krylov Algorithms, and the Non-Orthogonal Quantum Eigensolver — Q-SENSE introduces seniority operators as artificial symmetries to construct orthogonal basis states. This seniority-symmetry-based approach reduces one of the primary limitations of VQE on near-term quantum hardware — circuit depth — at the cost of measuring additional matrix elements. The artificial symmetries also reduce the number of Hamiltonian terms that must be measured, as only a small fraction of the terms couple basis states in different seniority subspaces. With all these merits, Q-SENSE offers a scalable and resource-efficient route to quantum advantage on near-term quantum devices and in the early fault-tolerant regime. Learn more online at: https://www.ipam.ucla.edu/programs/workshops/bridging-the-gap-between-nisq-and-ftqc/$

Ciaran Ryan-Anderson - Experimental Quantum Error Correction at Quantinuum - IPAM at UCLA