Thursday, February 19, 2026

What We Do - Team - In News

Quantum Computing    Quantum computers are expected to accelerate scientific discovery spanning many different areas such as medicine, AI, material science, and financial predictions. Quantum hardware manipulates with much more complex than binary information that is represented in classical computers. We are interested in quantum algorithms and methods of their hybridization with classical computing systems as well as how classical computing can facilitate and improve quantum computing.

Machine Learning    Many machine learning algorithms are prohibitive for large-scale number of variables, samples and high dimensionality. For example, this can happen because of the slow convergence or NP-hardness of underlying optimization problems (such as in support vector machines and cut-based clustering). We are interested in algorithms that cope with such problems.

AI, Literature Based Discovery and Text Mining    Hypothesis generation is becoming a crucial time-saving family of techniques which allow researchers to quickly discover implicit connections between important concepts. We are interested in such techniques and complex text mining problems, in general. Applications include biomedical discovery with scientific texts, healthcare and social media.

Network Science and Graph Algorithms    We are interested in computational, modeling, theory and data problems related to complex networks in social/natural/information sciences, and engineering. Their analysis often requires scalable algorithms for frequent pattern discovery, outliers detection, quantitative methods for importance ranking of network elements, time-dependent data analysis, evolution modeling, visualization, and community detection.

Combinatorial Scientific Computing    This is an area in which we study discrete optimization problems on large-scale graphs that are used to accelerate the performance of scientific computing algorithms. Examples include (hyper)graph partitioning, reordering, and coloring to improve load-balancing, task mapping, and data locality on HPC.

Multiscale Methods    A broad range of scientific problems involve multiple scales. Traditional monoscale approaches have proven to be inadequate, even with the largest supercomputers, because of the prohibitively large number of variables involved. We develop multiscale approaches in which a hierarchy of coarse scale approximations is used to solve large-scale problems efficiently.

Wednesday, February 18, 2026

Reductions of QAOA Induced by Classical Symmetries

 Super excited to share our new preprint "Reductions of QAOA Induced by Classical Symmetries: Theoretical Insights and Practical Implications" on arXiv! 

https://arxiv.org/abs/2602.16141

We explore how the performance of QAOA is determined by the structure of its dynamical Lie algebras and its connection to the expressivity and trainability. The primary objective of this work is to advance this understanding by studying the DLAs associated QAOA through the lens of symmetry reduction. Many combinatorial optimization objectives are invariant under a global bit-flip symmetry. From a classical standpoint, this symmetry allows one to fix the value of a single bit without loss of information. At first glance, this symmetry reduction appears to offer little advantage beyond a trivial reduction in problem size. One of the main contributions of this paper is to show that, at the quantum level, the situation is considerably richer. 

Huge congratulations to the students Bao Bach and Jose Falla! And special shout-out to first author Boris Tsvelikhovskiy for driving this project forward.

#QuantumComputing #QAOA #QuantumOptimization #Research #VariationalQuantumAlgorithms #Symmetry

What We Do - Team - In News

Quantum Computing     Quantum computers are expected to accelerate scientific discovery spanning many different areas such as medicine, AI, ...