Mostra el registre d'ítem simple
Design space exploration for Mapping in Quantum Computers
dc.contributor | Alarcón Cot, Eduardo José |
dc.contributor | García Almudéver, Carmen |
dc.contributor.author | Zarein, Hossein |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Enginyeria Electrònica |
dc.date.accessioned | 2021-02-26T10:07:59Z |
dc.date.available | 2021-02-26T10:07:59Z |
dc.date.issued | 2020-11-30 |
dc.identifier.uri | http://hdl.handle.net/2117/340551 |
dc.description.abstract | Quantum computers have emerged as an alternative computer paradigm that will allow to solve some complex problems of large numbers that are not tractable for classical computers, e.g. factorization. Quantum computers also have the ability to simulate quantum mechanics in a real and direct way. The development of quantum computers faces many unique obstacles. In recent years, various quantum computer prototypes have been created by com- panies such as Google and IBM, on which we can run some quantum algorithms. But these prototypes are far from the quantum computers we envision and can function like today?s classical computers. It is said that we are in the time of Noisy Intermediate-Scale Quantum (NISQ) computers. This means that current quantum computers are very noisy and their size is very small compared to classical comput- ers. The challenge with small, noisy quantum devices running quantum algorithms is that due to the hardware limitations they face which must be respected, quantum algorithm needs to be modified before their execution on quantum devices. To solve this problem in quantum computers, a mapping process is needed, which is part of the compilation step that modifies the quantum algorithms to take into account all the limitations of the targeted quantum device. After mapping process, the resulting quantum circuit usually has a higher number of gates and (execution time) latency, decreasing the algorithm?s reliability. Different mapping solutions have been already proposed. Most of them are meant for a specific quan- tum processor and different in methodology, approach and features. In addition, they are usually only compared in terms of added gates (gate overhead) or added circuit execution time (latency overhead). No thorough comparative analysis of the different mapping solutions performance and features has been performed so far. In this thesis, we apply structured Design Space Exploration to the mapping of quantum circuits. By doing so, we will be able to have a deeper understanding of this process, make a thorough comparison of the mapper approaches and even develop optimized solutions for given applications and quantum devices. Moreover, we apply Design Space Exploration to the generation of quantum algorithms used as benchmarks and start to explore profiling them in a structured approach. |
dc.language.iso | eng |
dc.publisher | Universitat Politècnica de Catalunya |
dc.rights | S'autoritza la difusió de l'obra mitjançant la llicència Creative Commons o similar 'Reconeixement-NoComercial- SenseObraDerivada' |
dc.subject | Àrees temàtiques de la UPC::Enginyeria electrònica |
dc.subject.lcsh | Quantum computers |
dc.subject.lcsh | Algorithms |
dc.subject.other | DSE DesignSpaceExploration |
dc.subject.other | mapper |
dc.subject.other | NISQ NoisyIntermediate-ScaleQuantum |
dc.subject.other | NN nearest-neighbour |
dc.title | Design space exploration for Mapping in Quantum Computers |
dc.type | Master thesis |
dc.subject.lemac | Ordinadors quàntics |
dc.subject.lemac | Algorismes |
dc.identifier.slug | ETSETB-230.155032 |
dc.rights.access | Open Access |
dc.date.updated | 2020-12-10T06:50:56Z |
dc.audience.educationlevel | Màster |
dc.audience.mediator | Escola Tècnica Superior d'Enginyeria de Telecomunicació de Barcelona |
dc.contributor.covenantee | Technische Universiteit Delft |