Showing posts with label students. Show all posts
Showing posts with label students. Show all posts

Wednesday, March 13, 2024

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.

Machine Learning and Data Mining    Many standard machine learning and data mining algorithms are prohibitive for large-scale number of variables. 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    Computational, modeling, theory and data problems related to complex networks in social/natural/information sciences, and engineering. The analysis often includes 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    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.

Thursday, December 14, 2023

Ankit Kulshrestha's PhD Defense

Congratulations to Dr. Ankit Kulshrestha for successfully defending his Ph.D. thesis "A Machine Learning Approach To Improve Scalability and Robustness of Variational Quantum Circuits"! Ankit will join the quantum computing research group at Fujitsu Research USA.



Friday, September 30, 2022

Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation

We are excited to announce that our paper received the best student paper award at #IEEE High Performance Extreme Computing #HPEC2022! Leading student is Cameron Ibrahim. Congratulations to all!

Cameron Ibrahim, Danylo Lykov, Zichang He, Yuri Alexeev, Ilya Safro "Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation", 2022, preprint at https://arxiv.org/abs/2209.02895

One of the key problems in tensor network based quantum circuit simulation is the construction of a contraction tree which minimizes the cost of the simulation, where the cost can be expressed in the number of operations as a proxy for the simulation running time. This same problem arises in a variety of application areas, such as combinatorial scientific computing, marginalization in probabilistic graphical models, and solving constraint satisfaction problems. In this paper, we reduce the computationally hard portion of this problem to one of graph linear ordering, and demonstrate how existing approaches in this area can be utilized to achieve results up to several orders of magnitude better than existing state of the art methods for the same running time. To do so, we introduce a novel polynomial time algorithm for constructing an optimal contraction tree from a given order. Furthermore, we introduce a fast and high quality linear ordering solver, and demonstrate its applicability as a heuristic for providing orderings for contraction trees. Finally, we compare our solver with competing methods for constructing contraction trees in quantum circuit simulation on a collection of randomly generated Quantum Approximate Optimization Algorithm Max Cut circuits and show that our method achieves superior results on a majority of tested quantum circuits.





Monday, May 23, 2022

Graduate Student Achievement Award

Congratulations to my former PhD student Xiaoyuan Joey Liu for winning Frank A. Pehrson Graduate Student Achievement Award! Her thesis is titled "Combinatorial Optimization Algorithms on Quantum and Quantum Inspired Devices". Xiaoyuan is now a research scientist at Fujitsu working in the area of quantum computing. This award is given to a computer science graduate student in recognition of outstanding performance, and potential for future significant contribution to the field of computer science.



Friday, December 10, 2021

Congratulations to Dr. Joey!

Congratulations to Dr. Xiaoyuan Joey Liu for successfully defending her Ph.D. thesis "Combinatorial Optimization Algorithms on Quantum and Quantum-inspired Devices"! Joey will join quantum computing research group at Fujitsu Research USA.



Monday, August 30, 2021

Tutorial on the quantum approximate optimization algorithm, its applications and simulation

We recorded this tutorial for IEEE International Conference on Quantum Computing and Engineering (QCE) 2020. This tutorial consists of four parts:

  1. QAOA theory and quantum computing basics
  2. Hands on example of QAOA and MaxCut
  3. Introduction to problem decomposition and solving large-scale problems with QAOA
  4. Tensor networks and simulation of QAOA with classical computers

Wednesday, June 10, 2020

PhD thesis defense

Congratulations to Dr. Ruslan Shaydulin for successfully defending his Ph.D. thesis "Quantum and Classical Multilevel Algorithms for (Hyper)Graphs"! Ruslan will join Argonne National Lab with  MGM fellowship in August. This is the second defense in our lab this week!



Monday, June 8, 2020

PhD thesis defense

Congratulations to Dr. Ehsan Sadrfaridpour for successfully defending his Ph.D. thesis "Fast Machine Learning Algorithms for Massive Datasets with Applications in Biomedical Domain"! Ehsan will join Lowe's data science team this summer.



Tuesday, April 14, 2020

Thursday, March 26, 2020

PhD thesis defense

Congratulations to Dr. Justin Sybrandt for successfully defending his Ph.D. thesis "Exploiting Latent Features of Text and Graphs"! Justin will join Google Brain this summer.



Friday, January 17, 2020

Congratulations to PhD student Ruslan Shaydulin

Congratulations to PhD student Ruslan Shaydulin, advised by Dr. Ilya Safro, for receiving 2020 Maria Goeppert Mayer fellowship for postdoctoral studies at Argonne National Lab. Ruslan will start in Fall 2020. He was selected among many candidates from top schools and different disciplines.


Monday, October 14, 2019

Congratulations to PhD student Justin Sybrandt for being selected in top 12 among more than 3000 summer interns based on his achievements. Over the summer, Justin was an intern at Facebook working on Instagram.



Monday, May 13, 2019

PhD thesis proposal defense

Congratulations to Justin Sybrandt for successfully defending his PhD thesis proposal!



Saturday, January 12, 2019

Welcome new students!

Two new students, Zirou Qiu (MSc) and Korey Palmer (senior undergrad) are joining our research group.

Monday, November 26, 2018

Thesis defense

Congratulations to Varsha Chauhan for successfully defending her MSc thesis on planar graph generation! 



Travel awards

Congratulations to Justin Sybrandt and Ruslan Shaydulin for receiving travel awards to present their papers at IEEE Big Data 2018 and APS 2018!

Thesis defense

Congratulations to Dr. Hayato Ushijima-Mwesigwa for successfully defending his Ph.D. thesis "Models for Networks with Consumable Resources"!



What we do/Team/In news

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