4

Setting aside the practical problems in actually building such things, quantum computers/networks can do everything their classical counterparts do without any fundamental overhead. Your reasoning seems to stem from a misunderstanding of the no-cloning theorem. The no-cloning theorem says that you cannot reversibly clone unknown states with a protocol that ...


3

There is a set of two packages in Mathematica called "Quantum Notation" and "Quantum Computing" for Wolfram Mathematica Environment, and here you can very well mimic all three considerations you are concerned with and much more in the usual Dirac Notation and Quantum Circuit Formalism. The link to the packages are as follows: http://homepage.cem.itesm.mx/...


3

Reutter and Vicary Features of teleportation, dense coding and secure key distribution are mimicked even without having an honest quantum internet. The main idea is the groudit. That is a special type of groupoid where there certain bijections as sets given as extra data. That is for a given natural number $d$, think about $d$ finite groups all of ...


2

Is it possible to emulate a quantum network over a classic network? Yes. The following projects are currently available: SimulaQron SimulaQron is a distributed simulation of the end nodes in a future quantum internet with the specific goal to explore application development. The end nodes in a quantum internet are few qubit processors, which may ...


2

I joined the Quantum internet Hackaton with Simulaqron We did simulations for the quantum leader election algorithms Simulaqron is more an abstract simulator on a classical computer or classical network. Most important aspect is entanglement between 2 nodes. This can be done with only command called EPR and creates an entangled pair of qubits on different ...


2

Say you have $m$ vertices and the longest list you can build is of size $n$. The simplest way I could think of is an encoding in basis state like : $$ | \text{origin} \rangle | v_0 (\text{origin})\rangle |v_1 (\text{origin})\rangle... |v_{n-1}(\text{origin})\rangle $$ We basically would encode the origin vertex and its corresponding n-sized adjacency-list ...


1

I have found this paper in which an insight about the question can be seen as the author states the difficulty of constructing the so-called quantum repeaters for quantum networks due to the no-cloning theorem. However, the constructions are indeed possible. The aforementioned paper is can be found here. The same author has a book called Quantum Networking ...


1

What are the biggest bottlenecks in the realization of a global quantum network (ie quantum internet)? It would seem only complexity, getting everything working together, with high reliability, for a long enough period of time. The OSI description of network layers describes 7 layers, quantum networks will likely end up with more but we can already ...


Only top voted, non community-wiki answers of a minimum length are eligible