COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Cambridge Mathematics Placements Seminars > Near-term quantum algorithms
Near-term quantum algorithmsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dr Vivien Gruar. Can be both open-ended or well-defined (depending on student interest). Open-ended version: you will read and understand recent papers on near-term quantum algorithms (choice according to your interest), implement a simulation into code and hopefully suggest improvements to the algorithm. Well-defined version: you will focus on active machine learning variational quantum algorithms to solve chemistry problems (i.e. finding ground state energies of compounds like H2O , O2 etc.). An even more well-defined version: you will optimise existing company code of standard quantum algorithms (such as Shor’s, Grover’s, eigensolver) or a particular algorithm recently invented by the company. This talk is part of the Cambridge Mathematics Placements Seminars series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsTwenty Years of Human Development: the past and the future of the Human Development Index British Epigraphy Society JSOCOther talksMagnetic Resonance on Two Scales for Research into Cell Cycle and Stroke Chemical genetic approaches to accelerate antimalarial target discovery Constructing datasets for multi-hop reading comprehension across documents How to make planets: physical and chemical processes in protoplanetary discs IMPACT OF MAGNETIC TOPOLOGY ON PLASMA DYNAMICS |