Mostra el registre d'ítem simple

dc.contributorAlarcón Cot, Eduardo José
dc.contributorGarcía Almudéver, Carmen
dc.contributor.authorZarein, Hossein
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Electrònica
dc.date.accessioned2021-02-26T10:07:59Z
dc.date.available2021-02-26T10:07:59Z
dc.date.issued2020-11-30
dc.identifier.urihttp://hdl.handle.net/2117/340551
dc.description.abstractQuantum 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.isoeng
dc.publisherUniversitat Politècnica de Catalunya
dc.rightsS'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.lcshQuantum computers
dc.subject.lcshAlgorithms
dc.subject.otherDSE DesignSpaceExploration
dc.subject.othermapper
dc.subject.otherNISQ NoisyIntermediate-ScaleQuantum
dc.subject.otherNN nearest-neighbour
dc.titleDesign space exploration for Mapping in Quantum Computers
dc.typeMaster thesis
dc.subject.lemacOrdinadors quàntics
dc.subject.lemacAlgorismes
dc.identifier.slugETSETB-230.155032
dc.rights.accessOpen Access
dc.date.updated2020-12-10T06:50:56Z
dc.audience.educationlevelMàster
dc.audience.mediatorEscola Tècnica Superior d'Enginyeria de Telecomunicació de Barcelona
dc.contributor.covenanteeTechnische Universiteit Delft


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple