-
Notifications
You must be signed in to change notification settings - Fork 9
Bayesian Framework for Quantum Algorithms in Qiskit: Principled Computing Amidst Noise #34
Comments
@ismaila-at-za-ibm Interesting idea! |
This project looks very interesting! Hopefully I can contribute as part of this team. |
@qcamp to win |
Hi @unicornhunter! I could not add you to this group because you are already in #15. If you want to change teams, unassign yourself from #15 and write me again here. |
1 similar comment
@ismaila-at-za-ibm I sent you an invitation to the coaches team. Please, join that team so our bot knows that you are not a participant but a coach! Thanks! |
Our submission is here https://github.com/conradhaupt/Qiskit-Bayesian-Inference-Module-QCA19- in the notebook titled IQPE Bayesian Inference.ipynb. |
Our presentation is given here: https://github.com/conradhaupt/Qiskit-Bayesian-Inference-Module-QCA19-/blob/master/Qiskit%20Camp%20Africa%202019.pdf |
Abstract
Bayesian Inference is a powerful tool for handling noise and uncertainty while learning from data. It leverages well-defined parameterized models (theory) of the system under study and raw observations of the system (data) to iteratively gain information about the uncertain parameters in the theory. For quantum algorithms run on quantum computing devices, the "model" of the system is the circuit itself run on the device with detailed noise models plus the variability introduced by measurement. A proper Bayesian treatment can be used to manage the noise on actual runs and piece together evidence gathered over those runs to arrive at useful answers that would otherwise be washed away. This project implements a Bayesian version of the well known iterative quantum phase estimation algorithm in such a way that the introduced primitives could be reused for other "Bayesified" algorithms:
Efficient Bayesian Phase Estimation:
https://arxiv.org/pdf/1508.00869.pdf
Description
Bayesian methods can be used to learn unknown parameters, average over parameters that are not of interest and select between competing models. It is a philosophically motivated, principled treatment of knowledge with uncertainty.
However, the first problem with Bayesian methods is that it requires accurate models. Fortunately, in the field of quantum computing, the "behaviour" of the system is well understood, even though the actual noise of any one run is unknown and even though the final answer is, of course, unknown. The noise and final answer enter the theory as parameters that Bayesian methods can elegantly manage.
The second problem with Bayesian methods is that it is computationally intensive. Fortunately, there are algorithms where the classical load is manageable (small number of parameters and good approximations: rejection filtering). Furthermore, for other algorithms there is the long-term hope that quantum bayesian inference may help alleviate the computational load, leading to Quantum-Classical-Quantum Hybrid systems.
Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions:
https://arxiv.org/abs/1907.09965
All of these considerations suggest the need for a framework to manage the "Bayesification" of algorithms.
References:
QInfer: Statistical inference software for Quantum Applications:
https://quantum-journal.org/papers/q-2017-04-25-5/pdf
Approximate Bayesian Inference via Rejection Filtering:
https://arxiv.org/pdf/1511.06458v2.pdf
Experimentally Detecting a Quantum Change Point via Bayesian Inference:
https://arxiv.org/pdf/1801.07508.pdf
Members
@slackhandle
email:[email protected]
Deliverable
Aqua module,
Series of papers
GitHub repo
The text was updated successfully, but these errors were encountered: