Materials and Method

Teleport Test Design and method, Selection Criteria, Scoring and Self-Check

• Teleportation as a quantum computation by Gilles Brassard, FRSC, Universite de Montreal, May 1996 The method applied herein follows this prescient paper and implements the Alice and Bob circuits described. The results obtained are a practical demonstration of the pioneering quantum theory teleportation method developed by Brassard and Bennett.

• PASS result is Demonstrable Proof of CNOT quantum gates generating two qubit entanglement, important since CNOT is an essential component in many quantum computing circuits.

• Two separated quantum computing circuits, Alice and Bob, are tested for their combined functionality to teleport an unknown quantum state without loss or error, where a PASS condition validates each of the halves.

• Combined functionality of both circuits is testable by comparing Alice's inputs against Bob's outputs for various qubit state combinations. The results show an identical match of input and output state for a PASS test result.

• Multiple teleportation circuits run in parallel to test a full-coverage panel of qubit state combinations. In the worked example each circuit is designated by a number from zero to forty.

  Each of Alice's circuits has three input qubits, named in english, latin and korean. The state of Alices's 0'th circuit is represented by the state vector | zero, nihil, yeong >.

  Each of Bob's circuits has also three qubits, named in hmong, swahili and german. The state of Bob's 0'th circuit is represented by the state vector | xoom, sufuri, null >.

  Each qubit is stored in state |0>, state |1> or any combination of probabilities, eg. 50% |0> 50% |1>. Quantum gates preform unitary operations that alter the probability of different state combinations.

• Quantum Information Teleportation is a Real-world application of the Panvia Quantum Computer for secure networks and Quantum Multi-Factor Authetication.

• Compact Examples: Alice and Bob's circuits are the ideal size for an end-to-end worked example of a quantum computing algorithm use case.

• Extendable by users: add more quantum gates to Bob's circuit to build your own custom quantum algorithm code using Alice's teleported quantum state.

Quantum Gate Types

• L-Gate

  0.7071	-0.7071
  0.7071	0.7071

  |0>

  |1>

  =

  0.7071 * (|0> - |1>)

  0.7071 * (|0> + |1>)

  ---

• R-Gate

  0.7071	0.7071
  -0.7071	0.7071

  |0>

  |1>

  =

  0.7071 * (|0> + |1>)

  0.7071 * (|1> - |0>)

  ---

• S-Gate

  i	0
  0	1

  |0>

  |1>

  =

  |0> i

  |1>

  ---

• T-Gate

  -1	0
  0	-i

  |0>

  |1>

  =

  -|0>

  -|1> i

  ---

  Two Qubit Quantum gate operations are defined below as product of a 4x4 complex matrix and two qubits represented as a 4x1 column vector of |0> and |1> states, each as a complex variable. The control qubit is the upper pair of states and the target qubit is the lower pair of states

• CNOT

  1	0	0	0
  0	1	0	0
  0	0	0	1
  0	0	1	0

  |0>

  |1>

  |0>

  |1>

  =

  |0>

  |1>

  |1>

  |0>

  ---

  More Information: Panvia Future Technologies Inc. - www.panviaquantum.com
  Contact: Roger Selly, CEO. roger@panviaquantum.com