-
Notifications
You must be signed in to change notification settings - Fork 1
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Architecting and Operationalizing Quantum Kernels for Machine Learning Workflows #7
Comments
Hi :) I'm interesting by this project. I'm trying to use AI to build strong opponent in my game (QPokemon fight, QNim) by using Grover and/or QAOA. I'm always willing to find out more algorithm in order to create more optimal automation process, I'm very interesting in R&D and I need to improve myself in the research field. |
Revision to |
The speech :
|
PDF of checkpoint 2 |
@mickahell Thanks for sharing the project board. Can you upload the final showcase presentations as well? |
@HuangJunye ;) |
|
Description
A recent paper on near-term, quantum-enhanced machine learning (of which I am an author) studied a theoretical bottleneck to using quantum kernels (similarity measures) in practice for ML applications involving the generation of data points. Because new data is being created in the application, there is a need to send not only that new data, but also all of the old data, to a quantum system in order to evaluate the kernel.
The paper showed how classical matrix completion can be used to alleviate that need. It also indicated that the amount of old data which needs to be sent relates to a property of the kernel matrix representing all pairwise similarity measures; namely, its rank.
While the paper successfully identified and proposed a solution to this bottleneck, it did not study what it would mean to operationalize the solution in practice. That is, it did not consider the relevant latencies and timescales for a workflow involving both quantum computation of some kernel values and classical computation to fill in the rest.
This QAMP project would study exactly this. We would study how, in practice, this quantum-enhanced ML workflow would work. We would also perform a numerical investigation workflow's timescales. In particular, we would be especially interested to look at the tradeoff between how much classical compute time is needed for the matrix completion versus the total round-trip time for the quantum kernel algorithm.
As part of this project, I hope we would leverage the Qiskit Runtime and any existing programs compatible with it. I do not envision we would write our own Runtime programs.
Paper: Kernel Matrix Completion for Offline Quantum-Enhanced Machine Learning
Deliverables
Mentors details
Number of mentees
2
Type of mentees
Recommended mentee background:
The text was updated successfully, but these errors were encountered: