Dokument: The role of quantum correlations beyond entanglement in quantum information theory
| Titel: | The role of quantum correlations beyond entanglement in quantum information theory | |||||||
| URL für Lesezeichen: | https://docserv.uni-duesseldorf.de/servlets/DocumentServlet?id=26112 | |||||||
| URN (NBN): | urn:nbn:de:hbz:061-20130625-092212-4 | |||||||
| Kollektion: | Dissertationen | |||||||
| Sprache: | Englisch | |||||||
| Dokumententyp: | Wissenschaftliche Abschlussarbeiten » Dissertation | |||||||
| Medientyp: | Text | |||||||
| Autor: | Streltsov, Alexander [Autor] | |||||||
| Dateien: |
| |||||||
| Dewey Dezimal-Klassifikation: | 500 Naturwissenschaften und Mathematik » 530 Physik | |||||||
| Beschreibung: | Quantum entanglement is the most popular kind of quantum correlations. Its role in several tasks in quantum information theory like quantum cryptography, quantum dense coding and quantum teleportation is indisputable. The role of entanglement in quantum algorithms has also attracted enormous amount of attention in the literature. The research in this direction is motivated by the finding that a quantum computer can efficiently factorize arbitrary integer numbers. Since no classical algorithm is known today that can solve this problem efficiently, this example clearly demonstrates the superiority of a quantum computer compared to its classical counterpart. In this context, entanglement also plays a crucial role: if the quantum computer operates on a pure state without entanglement, then the computational process can be simulated efficiently on a classical computer. In this case entanglement is the key ingredient that makes the difference between a quantum and a classical computer.
However, the situation is more involved if the computational process is not perfect. In this case the quantum computer operates on a mixed state, and the role of entanglement is less obvious. A seminal result in this direction is a quantum algorithm known under the acronym DQC1. This algorithm operates on an almost maximally mixed state with vanishingly little entanglement. However, DQC1 can still perform tasks efficiently for which no efficient classical algorithm is known today. Thus, it is reasonable to assume that entanglement in general is not related to the efficiency of a quantum algorithm. Triggered by this observation other kinds of quantum correlations have been studied. In this context a particular measure of quantum correlations known as quantum discord is referred to frequently in the literature. Quantum discord is a measure of quantum correlations beyond entanglement, i.e., a quantum state can have no entanglement, but nonvanishing quantum discord. Quantum discord is also regarded as the key resource in the DQC1 algorithm. Although this statement is still controversial, it was shown under very general assumptions that quantum discord is required if a quantum computer is to show an exponential speedup over any classical algorithm. In this thesis we give a short introduction into the theory of entanglement and general quantum correlations, and further discuss our results. In particular, we show that two different kinds of entanglement measures can coincide. This result is used to build an algorithm for computing entanglement. We also consider the role of quantum correlations for the distribution of entanglement and for the quantum measurement process. We further discuss the behavior of quantum correlations under local noise, and their monogamy properties. | |||||||
| Lizenz: |  Urheberrechtsschutz | |||||||
| Fachbereich / Einrichtung: | Mathematisch- Naturwissenschaftliche Fakultät » WE Physik » Theoretische Physik | |||||||
| Dokument erstellt am: | 25.06.2013 | |||||||
| Dateien geändert am: | 25.06.2013 | |||||||
| Promotionsantrag am: | 31.01.2013 | |||||||
| Datum der Promotion: | 14.06.2013 |
