QUANTUM COMPUTING APPLICATIONS

Alice and Bob are Benchmark Test Circuits for quantum computing.
Sufficient complexity to validate quantum gate functionality of a useful minimal set of gates comprising L,R,S,T and CNOT.
This lossless teleportion reference worked example is a gold standard to compare experimental performance measurement results of noisy qubits.
Results show the functional effects of Alice's second and third qubits and reveals that the third qubit has the valuable feature of changing the sense of the teleported quantum state.
The QPS that is teleported from Alice's circuit to Bob's cicuit is 100% ambiguous without knowing the input state of Alice's third qubit. This is clearly demonstrated in the results by Alice's output states in circuit nine being identical with the output states in circuit ten. It is impossible for Eve to know if this is because Alice's 1st qubit is |0> and her 3rd qubit is |1> or, alternatively because Alice's 1st qubit is |1> and her 3rd qubit is |0>. Eve cannot know if she has intercepted circuit ten or nine by the state of the teleported QPS.
Additional layers of state obfuscation, scrambling and data encryption will certainly be applied in a practical system.
In the worst case scenario that all other measures have been compromised and Eve can read the JSON data file specifying the Quantum Possibility Space, the state of Alice's 1st qubit will still be 100% ambiguous without knowledge of the state of Alice's input 3rd qubit.