Quantum Algorithmic Information Processing and Bosonic Quantum Computing

【Topic 2: Quantum Intelligence.  Subtopic 2.5: QIVM: Quantum Algorithmic Information Processing and Bosonic Quantum Computing】

In 2015 during my stay in Taiwan’s ChiaoTung University as a visiting scholar, I research various quantum Turing machine theories, quantum algorithmic indices, and the definitions of consciousness, intelligence and creativity. I invent a proof of computability of quantum consciousness (see https://sites.google.com/.../1wpAfhkuyiHLyI5v1pz865f.../edit ), which becomes the base for computability of quantum intelligence and creativity.  Because the formality of proofs always needs quantum Turing machine to involve some algorithmic indices, I call this research field “Quantum Algorithmic Information Processing (QAIP)”.

(1) CONSCIOUSNESS: I publish my mathematical proof of computability of quantum consciousness in a 2016 international quantum computing conference.  The computability proof is based on Kolmogorov exponential power of a Quantum Turing Machine that satisfies an inequality derived from Integrated Information Theory invented by Psychology Prof. Giulio Tononi, University of Wisconsin. In terms of emergence theory, consciousness is at chaotic level, and can be processed by discrete quantum computing.

(2) INTELLIGENCE: From QBD research described above, brain intelligence can be generated better in an optical quantum computer (than superconducting QC, say), with continuous variable quantum computing.  The computability proof for quantum intelligence is based on the continuous computing power of a Quantum Turing Machine that satisfies an inequality derived from general intelligence theory invented by Prof. Marcus Hutter of National Australian University (and also Google DeepMind).  In terms of emergence theory, intelligence is at ordered level, and can be processed by continuous variable quantum computing. 

(3) CREATIVITY: The computability proof for quantum creativity is based on Quantum Creativity Kolmogorov Complexity of a Quantum Turing Machine that satisfies an inequality derived from formal theory of creativity invented by Prof. J. Schmidhuber of University of Lugano.  In terms of emergence theory, creativity is at criticality level, and can be processed by modified continuous variable quantum computer (e.g. Xanadu quantum computer) to have creation quantum operator and annihilate quantum operator.

You may find that the three things of consciousness, intelligence and creativity are a bit similar to Ackoff's DIKW pyramid. Great minds think alike.

Advantages to have the above three computability theorems are (a) more theorems and corollaries can be derived to suit for different environments; (b) more applications and best practices of algorithms on intelligence and creativity can be derived.  (c) Since we now have basic theorems to govern the derivations, applications, and practices, we can predict applications of various algorithm combinations can work, work better or not at all.  For instance,

QIVM Example (i) navigational quantum intelligence,

QIVM Example (ii) QAOA (quantum approximated optimization algorithm) + CAS for quantum creativity.

From these two examples, you can see QIVM is an upgrade from AIVM by replacing the AIVM kernel with quantum algorithms.