Generation and Uses of Distributed Entanglement in Quantum Information
| dc.contributor.advisor | Rolston, Steven L | en_US |
| dc.contributor.advisor | Gorshkov, Alexey V | en_US |
| dc.contributor.author | Eldredge, Zachary David | en_US |
| dc.contributor.department | Physics | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2019-06-21T05:34:14Z | |
| dc.date.available | 2019-06-21T05:34:14Z | |
| dc.date.issued | 2019 | en_US |
| dc.description.abstract | In this thesis, we focus on the questions of how quantum entanglement can be generated between two or more spatially separated systems and, once generated, how it can be applied in quantum technology. First we will discuss a protocol, which we conjecture to be optimal in some regimes, that quickly creates entangled states across long distances in systems with power-law interactions. We will discuss how this protocol compares with currently known bounds on entangled state generation and how it might be implemented in a three-dimensional lattice of Rydberg atoms. Next, we will turn our attention to more general questions of how the Lieb-Robinson bound and other limitations on entanglement can be used to inform the design of quantum computers. Quantum computers will be required to create entanglement if they are to realize significant advantages over classical computers, meaning that the generation of entanglement is an important question. First, we will discuss the implications of the Lieb-Robinson bound on graph descriptions of quantum computer architectures, and how the relevant graph parameter (diameter) compares to likely cost functions for architectures, such as maximum graph degree and total number of necessary connections. We will present a proposed graph architecture, the hierarchical product, which we believe provides excellent balance between these considerations. We will then introduce new methods of evaluating graphs that allow us to include quantum architectures capable of measurement and feedback operations. After doing so, we will show that the generation of entanglement entropy becomes a limit on computation. We will show that, for several possible physical models of computation, the generation of entanglement can be bounded by simple graph properties. We demonstrate a connection between worst-case scenarios for entanglement generation and a graph quantity called the Cheeger constant or isoperimetric number, which we evaluate for several proposed quantum computing architectures. Finally, we will look at the scenario of quantum sensing. In particular, we will examine protocols for quantum function estimation, where quantum sensors are available to measure all of the inputs to the function. We will demonstrate that entangled sensors are more capable than non-entangled ones by first deriving a new lower bound on measurement error and then presenting protocols that saturate these bounds. We will first do so for linear functions of the measured quantities and then extend this to general functions using a two-step linearizing protocol. | en_US |
| dc.identifier | https://doi.org/10.13016/6b1j-tsik | |
| dc.identifier.uri | http://hdl.handle.net/1903/22102 | |
| dc.language.iso | en | en_US |
| dc.subject.pqcontrolled | Quantum physics | en_US |
| dc.subject.pquncontrolled | architectures | en_US |
| dc.subject.pquncontrolled | entanglement | en_US |
| dc.subject.pquncontrolled | metrology | en_US |
| dc.subject.pquncontrolled | quantum | en_US |
| dc.title | Generation and Uses of Distributed Entanglement in Quantum Information | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Eldredge_umd_0117E_19815.pdf
- Size:
- 11.03 MB
- Format:
- Adobe Portable Document Format