Entangled protocols and non-local games for testing quantum systems.
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/111879 |
| _version_ | 1811097617647534080 |
|---|---|
| author | Coudron., Matthew Ryan |
| author2 | Peter W. Shor. |
| author_facet | Peter W. Shor. Coudron., Matthew Ryan |
| author_sort | Coudron., Matthew Ryan |
| collection | MIT |
| description | Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017. |
| first_indexed | 2024-09-23T17:02:24Z |
| format | Thesis |
| id | mit-1721.1/111879 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T17:02:24Z |
| publishDate | 2017 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1118792021-10-01T03:41:12Z Entangled protocols and non-local games for testing quantum systems. Coudron., Matthew Ryan Peter W. Shor. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Electrical Engineering and Computer Science. Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017. Cataloged from PDF version of thesis. Includes bibliographical references (pages 177-184). The field of quantum computing investigates the extent to which one can design a quantum system that outperforms all known classical hardware at a certain task. But, to what extent can a human being, capable only (perhaps) of classical computation and of observing classical bit-string messages, verify that a quantum device in their possession is performing the task that they wish? This is a fundamental question about the nature of quantum mechanics, and the extent to which humans can harness it in a trustworthy manner. It is also a natural and important consideration when quantum devices may be used to perform sensitive cryptographic tasks which have no known efficient classical witness of correctness (Quantum Key Distribution, and Randomness Expansion are two examples of such tasks). It is remarkable that any quantum behavior at all can be tested by a verifier under such a constraint, without trusting any other quantum mechanical device in the process! But, intriguingly, when there are two or more quantum provers available in an interactive proof, there exist protocols to verify many interesting and useful quantum tasks in this setting. This thesis investigates multi-prover interactive proofs for verifying quantum behavior, and focuses on the stringent testing scenario in which the verifier in the interactive proof is completely classical as described above. It resolves the question of the maximum attainable expansion rate of a randomness expansion protocol by providing an adaptive randomness expansion protocol that achieves an arbitrary, or infinite rate of randomness expansion [29]. Secondly it presents a new rigidity result for the parallel repeated magic square game [24], which provides some improvements on previous rigidity results that play a pivotal role in existing interactive proofs for entangled provers, QKD, and randomness expansion results. This new rigidity result may be useful for improving such interactive proofs in the future. The second half of this thesis investigates the problem of bounding the role of quantum entanglement in non-local processes. This is important for understanding the upper limit on the power of multi-prover interactive proof systems with entangled provers. In particular it establishes that, assuming the Strong Kirchberg Conjecture, one can provide a doubly exponential upper bound on the class MIP* [25] (for comparison, the best known unconditional upper bound on MIP* is that its languages are recursively enumerable!). Finally this thesis presents a result which characterizes the type of entanglement that is useful in entanglement assisted quantum communication complexity by showing that any communication protocol using arbitrary shared entanglement can be simulated by a protocol using only EPR pairs for shared entanglement. Therefore all quantum communication protocols can be approximately simulated by a protocol using only the maximally entangled state as a shared resource. by Matthew Ryan Coudron. Ph. D. 2017-10-18T15:08:18Z 2017-10-18T15:08:18Z 2017 2017 Thesis http://hdl.handle.net/1721.1/111879 1004958796 eng MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582 184 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Coudron., Matthew Ryan Entangled protocols and non-local games for testing quantum systems. |
| title | Entangled protocols and non-local games for testing quantum systems. |
| title_full | Entangled protocols and non-local games for testing quantum systems. |
| title_fullStr | Entangled protocols and non-local games for testing quantum systems. |
| title_full_unstemmed | Entangled protocols and non-local games for testing quantum systems. |
| title_short | Entangled protocols and non-local games for testing quantum systems. |
| title_sort | entangled protocols and non local games for testing quantum systems |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/111879 |
| work_keys_str_mv | AT coudronmatthewryan entangledprotocolsandnonlocalgamesfortestingquantumsystems |