Print Email Facebook Twitter Routing of Quantum States in 2D Lattices Title Routing of Quantum States in 2D Lattices Author Zhong, C. Contributor Bertels, K.L.M. (mentor) GarcĂa Almudever, C. (mentor) Faculty Electrical Engineering, Mathematics and Computer Science Department Quantum Engineering / CE Lab Programme Computer Engineering Date 2017-04-26 Abstract Running quantum algorithms in a quantum machine may solve some complex problems that are intractable for even the most powerful classical computers. Quantum algorithms can be described by quantum circuits consisting of a set of qubits and a sequence of gates operating on those qubits when the quantum circuit model of computation is adopted. This circuit description on an algorithm usually assumes that any kind of interaction between qubits is possible. However, in real experiments, qubits are placed on a specific physical qubit layout, which constraints the possible interactions between qubits due to its limited connectivity. One possible layout for arranging qubits is a 2D array with 4 neighbours per qubit, which corresponds with the topology of surface code, one of the most promising quantum correction codes. In such 2D nearest-neighbour (NN) arrangement of qubits not all pairs of qubits that have to interact during computation can be directly connected (be neighbours). This means that non-adjacent qubits or qubit states need to be moved or routed (by e.g. SWAP operations) and be placed close to each other when required. In this thesis, we applied different routing algorithms used in Network on Chip (NoC) for defining the routing paths when quantum states are moved. After investigating 7 different NoC routing algorithms, we redesign and adapt them to the quantum scenario. We use the quantum plane simulation platform for comparing the routing overhead and the success rate of such routing algorithms when running 4 different quantum algorithms. We conclude that the routing algorithm which has the best overall routing performance is the one called Hot Potato. It is deadlock and livelock free in perfect qubit lattices, and shows the best fault-tolerance when faulty qubits are considered. To reference this document use: http://resolver.tudelft.nl/uuid:4f42f39b-6bc1-40f8-99eb-686475e7f58c Embargo date 2017-04-26 Part of collection Student theses Document type master thesis Rights (c) 2017 Zhong, C. Files PDF MSc_Thesis_Report_Cheng_Z ... 307143.pdf 11.3 MB Close viewer /islandora/object/uuid:4f42f39b-6bc1-40f8-99eb-686475e7f58c/datastream/OBJ/view