Print Email Facebook Twitter Mapping of quantum algorithms on a quantum chip Title Mapping of quantum algorithms on a quantum chip: 2D topology with nearest neighbor interaction Author van Wee, Bas (TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor Almudever, Carmen G. (mentor) Bertels, K.L.M. (mentor) Möller, M. (graduation committee) Degree granting institution Delft University of Technology Programme Electrical Engineering | Microelectronics Date 2017-12-15 Abstract Quantum algorithms can be described by quantum circuits which consist of quantum bits (qubits) and quantum gates. Such a circuit description assumes that any kind of interaction between qubits is possible. However, quantum chips have limited qubits connectivity only allowing, for instance, nearest-neighbor (NN) interactions. That means, qubits need to be placed in adjacent positions for performing a two-qubit gate. In this thesis, a routing algorithm is proposed where physical qubits or planar-based logical qubits are routed to obey this nearest neighbor constraint in a 2D qubit topology. This algorithm tries to minimize the circuit latency or communication overhead. The proposed routing algorithm is based on a sliding window principle. Different paths, found by using an adapted breadth-first search algorithm, are evaluated based on the interleaving of the corresponding routing instructions, e.g., SWAP operations with previous instructions, and by looking at the disordering of future qubits. The path that will add the lowest number of cycles to the algorithm is then selected and efficiently inserted with the rest of the instructions. This process continues until all the instructions inside the quantum algorithm obey the nearest neighbor constraints.The routing algorithm is tested for several real quantum algorithms taken from QLib and ScaffCC, as well as for random generated benchmarks. Taking different alternative paths into account and evaluating those paths for possible interleaving with previous instructions, always has a positive effect to minimize the number of added cycles. The results concerning the evaluation of the disordering of future qubits could have a positive or negative effect on the circuit latency depending on the quantum circuit. Subject QuantumMappingRouting To reference this document use: http://resolver.tudelft.nl/uuid:7c6c37df-2ca8-44a7-9b85-efcd7df0e077 Part of collection Student theses Document type master thesis Rights © 2017 Bas van Wee Files PDF 20171212_Quantum_Mapping_Thesis.pdf 7.6 MB Close viewer /islandora/object/uuid:7c6c37df-2ca8-44a7-9b85-efcd7df0e077/datastream/OBJ/view