4
$\begingroup$

I am trying to wrap my head around the correlation between repeating teleportation & XOR linked lists.

I understand that:

  1. "the quantum equivalent of the one time pad (i.e. XORing a message with a secret key) is quantum teleportation" (source)
  2. "the simplest way to generalize teleportation is to just repeat it" (source)

What I don't understand is how repeating teleportation could lead to "a data structure which is used to maintain a list of data items" (see this answer for more use cases for quantum XOR linked lists).

Hopefully someone can help me to understand how these concepts connect, because I do not understand teleportation well enough to see how it could be used to accomplish any of the use cases described in the answer to my XOR linked list question.

See also: Equivalent Quantum Circuits sections VII. A & B

As example applications we study quantum teleportation and dense coding protocols in terms of a simple XOR swapping circuit and give an intuitive picture of a basic gate teleportation circuit.

$\endgroup$

closed as unclear what you're asking by Niel de Beaudrap, Sanchayan Dutta Mar 27 at 16:44

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • 1
    $\begingroup$ I'm not sure why you suppose that teleportation would be relevant to quantum XOR-linked lists. Is it just because XOR is involved in both cases? $\endgroup$ – Niel de Beaudrap Dec 19 '18 at 12:52
  • $\begingroup$ @NieldeBeaudrap Beyond XOR being involved, it seems like a XOR linked list correlates w/ a chained XOR cipher (which has been stated to be equivalent to teleportation). I suppose the underlying question I have is how teleportation (or if it isn't teleportation what gate(s)) can be used to execute a XOR linked list. (Also contemplating XOR swapping in correlation w/ link traversal & uncomputation) $\endgroup$ – meowzz Dec 19 '18 at 13:22
  • 2
    $\begingroup$ It would appear that an "XOR cipher" (en.m.wikipedia.org/wiki/XOR_cipher) is a Vernham-like cipher, and not really anything that I would consider to be like an XOR-linked list. Chaining XOR ciphers would also seem to yield just a different XOR cipher, albeit with slightly different features. In an XOR linked list, the things which are XORed are memory addresses of forward and reverse links: it is not immediately clear why you might want to encrypt them unless you have a particular use case in mind; and it is unclear what role the list structure itself is playing. $\endgroup$ – Niel de Beaudrap Dec 19 '18 at 21:43
  • $\begingroup$ @NieldeBeaudrap What if you wanted to encrypt whatever was being teleported? Eg. in a blind computing scenario, or for a secure communications channel. I am considering XOR linked lists for logical clocks (where previous would indicate local time & next would indicate what is known about global time - possibly correlating w/ eigenvalues of clock and shift matrices) for a time entangled blockchain $\endgroup$ – meowzz Dec 19 '18 at 22:32
  • $\begingroup$ @NieldeBeaudrap I would also like to be able to generalize the logical clock (XOR linked list, n qudit teleportations, whatever is clever) system upwards to vector & matrix clocks for use in a distributed system. $\endgroup$ – meowzz Dec 19 '18 at 22:37