Workshop Registration Link: FSTTCS Google Form link. This link has now been closed. Please use the late registration link.
Please fill in the required details and check the box next to the option marked "Quantum Information Science and Engg. (18 Dec 2021)".
Late Registration Link: Google Form link.
This link closes at 6 pm IST on 17th December 2021. Participants will receive Zoom links and other information related to the workshop only after registration closes.
Recent developments have once again revived great interest in quantum computing, its potential in the near term, and its relationship with other areas of science and technology. Several initiatives, at universities and research labs, have been taken in India, especially after the announcement of governmental support for such initiatives. Simultaneously, the IT industry India has started developing mechanisms to develop expertise in the area of quantum computing in order to stay abreast of the developments and prepare itself for future opportunities.
In its currently emerging version, quantum science offers a unique opportunity for interaction among a wide spectrum of scientists who specialize in areas us as theoretical physics, novel materials, communication technology, control theory, information theory, computing and mathematics. It also presents unique challenges for both laboratory and industrial implementations of quantum devices and the manipulation of uniquely quantum phenomena.
The proposed workshop is intended to evolve into a regular yearly event providing a platform to a diverse audience for learning about the recent developments in areas related to quantum science in general and quantum computing in particular.
Goals of the workshop: In the first edition of the workshop, we would like to use this opportunity to provide a robust exposure to students, researchers and industry practitioners to the recent developments in quantum computation, from the point of view of computer science, physics, and engineering. Apart from this we would like to familiarize the participants, especially the students, to recent quantum computing and simulation tools, e.g., with the view to introducing them to quantum machine learning.
Recent advances in experimental quantum computing are propelling us towards the era of small to medium scale quantum computers. But quantum computation also forces us to reimagine our entire conception of computation, with major implications for both computer science and physics. In this talk I will discuss these conceptual changes while describing recent breakthroughs in the design of protocols for the testing and benchmarking of quantum computers, a task that has deep computational and philosophical implications. I will describe how this leads to protocols for scalable and verifiable quantum supremacy, certifiable quantum random generation and verification of quantum computation.
One of the major challenges in computer science is to establish lower bounds on the resources, usually time, that are needed to solve computational problems. This holds in particular for computational problems that appear in practise.
One way towards dealing with this situation is the study of fine-grained complexity where we use special reductions to prove time lower bounds for many diverse problems based on the conjectured hardness of some key problems. For example, computing the edit distance between two strings, a problem that has a practical interest when determining the genetic distance between species based on their DNA, has an algorithm that takes O(n^2) time. Using a fine-grained reduction it can be shown that faster algorithms for edit distance also imply a faster algorithm for the Boolean Satisfiability (SAT) problem (that is believed to not exist). This is evidence that the current edit distance algorithms are optimal. Another problem, besides SAT, that is used as a basis for these reductions is the 3SUM problem.
The situation in the quantum regime is no better; almost all known lower bounds for quantum algorithms are defined in terms of query complexity, which doesn’t help much for problems for which the best-known algorithms take super-linear time. Therefore, employing fine-grained reductions in the quantum setting seems a natural way forward. However, translating the classical fine-grained reductions directly into the quantum regime is not always possible for various reasons. In this talk, I will present some recent results in which we circumvent these challenges and prove quantum time lower bounds for some problems in BQP conditioned on the conjectured quantum hardness of SAT (and its variants) and the 3SUM problem.
This is based on joint work with Bruno Loff, Florian Speelman, and Subhasree Patro.
| Time | Event | Speakers/Organizers |
|---|---|---|
| Morning Session | ||
| 09:30 am - 11:00 am IST | A Quantum Wave in Computing | Dr. Umesh Vazirani (UC Berkeley) |
| 11:00 am - 12:30 pm IST | Tutorial on Quantum ML | Dr. Apoorva Patel, Dr. Abhijith J, Dr. Abhay Shastry |
| 12:30 pm - 1:30 pm IST | Lunch | --- |
| 1:30 pm - 3:00 pm IST | Poster Session | Mr. Manoj Nambiar |
| 3:00 pm - 4:00 pm IST | Panel Discussion 1 - Quantum Computing in India | Dr. R Vijayraghavan, Dr. Pranab Sen, Dr. Anil Prabhakar, Dr. Apoorva Patel, Dr. Shayan Srinivasa Garani, Dr. Prasanta Panigrahi |
| Evening Session | ||
| 6:30 pm - 7:45 pm IST | Quantum fine-grained complexity | Dr. Harry Burhman (CWI Amsterdam) |
| 7:45 pm - 8:45 pm IST | Panel Discussion 2 - Quantum Computing Theory, Hardware and Software – Recent Advances and Near-Term Challenges | Dr. Harry Burhman, Dr. Krishna Kumar Sabapathy (Xanadu, India), Dr. Anil Prabhakar |
The workshop which will be held online, will also feature a virtual poster presentation session. This will be a great opportunity for graduate students, undergraduate students, researchers, practitioners, entrepreneurs, and start-ups to showcase their work and engage with the experts in Quantum Computing. Posters are intended to stimulate discussions of recent advances, experiences, and challenges in quantum computing and engineering.
The poster session will be held during the workshop. We welcome posters containing original work (both unpublished and previously published works are welcome) in all areas related to quantum information, both computing and engineering aspects. In addition, we will accept posters from the industry that showcase the work being done there, and also the career opportunities they offer.
Poster submissions to QISE 2021 will be in the form of an extended abstract (12-point font minimum, 2 pages maximum excluding references). The abstract may include a link to a longer manuscript posted on a public server or an online repository such as arXiv, HAL, or ECCC. Extended abstracts should be typeset using the LIPIcs LaTeX style file available here.
The posters will be subjected to a review by the PC members for originality, technical maturity, and relevance to the theme of the workshop. The list of accepted posters will be put up on the workshop website. Posters will be used only for presentation during the poster session and will not be published in any proceedings. As the workshop is virtual, all poster presentations will also be in a virtual mode.
For any questions related to posters please send a message to qise2021@easychair.org
Poster Submission Timeline (updated): 15th October 23:59 GMT to 15th November 22nd November 23:59 GMT.
EasyChair Submission Link
| Anil Prabhakar, IIT Madras |
| Debajyoti Bera, IIIT Delhi |
| Pranab Sen, TIFR Mumbai |
| Prasanta Panigrahi, IISer Kolkata |
| Shayan Srinivasa Garani, IISc Bangalore |
| Sugata Gangopadhyay, IIT Roorke |
We also thank the ACM Goa chapter for assisting in the organisation of the workshop.
