Full text
![[thumbnail of TESIS_MASTER_SHEIDA_NAZARY.pdf]](https://oa.upm.es/style/images/fileicons/application_pdf.png) |
PDF
- Users in campus UPM only
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) |
Study the complexity of discretec quantum states by defining Fibonacci states
Citation
Nazary, Sheida (2021). Study the complexity of discretec quantum states by defining Fibonacci states. Thesis (Master thesis), E.T.S.I. de Sistemas Informáticos (UPM).
Description
| Title: | Study the complexity of discretec quantum states by defining Fibonacci states |
|---|---|
| Author/s: |
|
| Contributor/s: |
|
| Item Type: | Thesis (Master thesis) |
| Masters title: | Ciencias y Tecnologías de la Computación |
| Date: | July 2021 |
| Subjects: | |
| Freetext Keywords: | Quantum Counting; Computación cuántica |
| Faculty: | E.T.S.I. de Sistemas Informáticos (UPM) |
| Department: | Matemática Aplicada a las Tecnologías de la Información y las Comunicaciones |
| Creative Commons Licenses: | Recognition - No derivative works - Non commercial |
Abstract
A model of discrete quantum computing is presented in details. The model is proved for two-qubit discrete quantum gates. We investigate discrete quantum gates of more than two qubits. In order to develop the model to apply to n-qubit systems, we need to study the complexity of the states and the gates. Frankly it is very complicated to study the complexity of discrete quantum states, because they grow exponentially. We deffine some general simple arbitrary states to facilitate studying the complexity of disceret quantum states.
More information
| Item ID: | 68508 |
|---|---|
| DC Identifier: | https://oa.upm.es/68508/ |
| OAI Identifier: | oai:oa.upm.es:68508 |
| Deposited by: | Biblioteca Universitaria Campus Sur |
| Deposited on: | 10 Sep 2021 08:46 |
| Last Modified: | 10 Sep 2021 08:46 |
