The unknown state combination of Alice's 'a' qubit is losslessly transferred to Bob's 'f' qubit via a randomized superposition of states generated by Alice's circuit of four quantum gates. This includes two Conditional NOT, or CNOT, gates responsible for generating entangled states between qubits.
Alice |abc> QPS

The randomized superposition of states generated by Alice's circuit is captured in a JSON data file. This file represents a Quantum Possibility Space or QPS of Alice's three qubits and becomes the input to a Teleport command in Bob's circuit.

QPS Bob |def>

Following teleport of the QPS to Bob's qubits a series of six quantum gates including three CNOT's converts the randomized superposition of states in the QPS to the coherent presentation of the teleported qubit as Bob's 3rd qubit. At the end of Bob's circuits the unknown input state of Alice's 1st qubit 'a' in the top row of the top 'Alice' circuit has been losslessly transferred to Bob's 3rd qubit 'f' in the bottom row of the bottom circuit.

In addition, Alice can use the input state |0> or |1> of her 3rd qubit to control whether Bob's teleported qubit materializes in either the lossless combination of states in Alice's qubit or its antisense reflection.

The combined features of lossless |0>,|1> state superposition qubit transfer, randomized intermediate state and transfer sense control qubit provide all the essential new ingredients for secure quantum teleportation via the Internet.

Two programs, Alice and Bob, were each run on forty-one separate quantum computing circuits of three qubits each for a total of 123 qubits in flight.

To demonstrate the complete range of use cases different combinations of Alice's three qubits were generated across forty-one separate circuits. The results are presented below with interactive graphics for Alice's and Bob's circuits showing gate by gate evolution of the state vectors for each step in the teleportation process.