This paper shows that individual machines can be fingerprinted based on their aggregated results.
- It would be cool to expand these results:
- Create a “Quantum Computer detector” that given a set of results, it returns the most likely computer it ran on. Ideally this algorithm would be multiclass, rather than using binary classification. We would like to add new quantum computers to the existing model without having to retrain the entire algorithm. This requires knowing how to add new classes to a multiclass algorithm
- Use the quantum algorithm used as an input, rather than fixing the algorithm used.
- This requires mapping algorithms into something understandable by a Artificial Neural Network.
- Algorithms can be represented neatly as a DAG
- There ought to be solutions that map DAGs into a Artificial Neural Network input. This needs to be researched
- The training dataset should not use the same algorithm too many times: We want a general way to fingerprint for a generic algorithm.
- This requires mapping algorithms into something understandable by a Artificial Neural Network.
- Error correction: Can we add a per quantum computer map from the obtained results to the simulated results, in a way using Artificial Neural Networks to remove as much of the noise as possible?
- Can this be done as a many-shot correction ( i.e. mapping the full probability distribution ) ?
- Can this be done as a one-shot correction ( i.e. mapping an individual evaluation of the algorithm ) ?