Created by W.Langdon from gp-bibliography.bib Revision:1.8081
I have never seen anyone answer a question on quantum computers in ten seconds before.
Reduce need for specialist expertise using GI. Make quantum computer programming easier.
Qbit as point on a sphere. Multiple qbits also as points on a three dimensional sphere (slide 6).
Mapping from quantum circuit (effectively specification?) onto real quantum hardware. But each quantum hardware works differently and is differently connected. Do this mapping automatically using genetic programming.
ZX graph (not tree) nodes and gates. Fitness = minimising errors produced by quantum gates.
Random input => IBM Quantum hardware
2 3 4 and 5 Qbit. Probability of correct measurement 0.7 -- 0.9 (slide 13) Number of gates != number of qbits.
slide 21 real human designed circuits (not random). Several cases where GP just worked.
Automating Quantum Programming GI definitely improved ease of use.
Video 1nuPLMSPU10 George O'Brien
14:40 Discussion Bobby R. Bruce
15:03 Stephanie Forrest \cite{spector:book} A: ZX
16:33 A: Westley Weimer \cite{Vasicek:2014:ieeeTEC} A: quantum more inter woven than classical circuits. Quantum much rougher. Quantum not well understood. A: scaling. Need for better engineering of software engineering support stack.
20:57 Q: W. B. Langdon
22:25 Q: Bobby R. Bruce
23:26 Q: Westley Weimer, Grover's algorithm. A: move operations from worse (higher error rate) Qbit to better q-bit. Bobby R. Bruce: I have never seen anyone answer a question on quantum computers in ten seconds before.
part of \cite{Petke:2021:ICSEworkshop} http://geneticimprovementofsoftware.com/events/icse2021.html",
Genetic Programming entries for George O'Brien John A Clark