Assessing the mapping of quantum algorithms on superconducting quantum processors
Quantum computing is a promising field regarding computation capabilities for several important tasks. One of the most promising solid-state quantum technology, which is being developed at Qutech (TU Delft), is superconducting qubits. In superconducting quantum processors, qubits are arranged along...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/134893 |
| Acceso en línea: | https://hdl.handle.net/2117/134893 |
| Access Level: | acceso abierto |
| Palabra clave: | Quantum computing Algorithms quantum mapping qubit metrics fidelity probability of success quantum volume depth latency SWAP quantum gate quantum circuit quantum algorithm superconducting Programació quàntica Algorismes Àrees temàtiques de la UPC::Enginyeria de la telecomunicació |
| Sumario: | Quantum computing is a promising field regarding computation capabilities for several important tasks. One of the most promising solid-state quantum technology, which is being developed at Qutech (TU Delft), is superconducting qubits. In superconducting quantum processors, qubits are arranged along a 2D grid that only permits information transmission between adjacent qubits. In order to run a quantum algorithm on such a processor a mapping strategy of scheduling-placement-routing is needed. |
|---|