상세정보
Export to Refworks부가기능
Classical Verification and Blind Delegation of Quantum Computations
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Classical Verification and Blind Delegation of Quantum Computations. |
| 개인저자 | Mahadev, Urmila M. |
| 단체저자명 | University of California, Berkeley. Computer Science. |
| 발행사항 | [S.l.]: University of California, Berkeley., 2018. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
| 형태사항 | 119 p. |
| 기본자료 저록 | Dissertation Abstracts International 80-01B(E). Dissertation Abstract International |
| ISBN | 9780438325111 |
| 학위논문주기 | Thesis (Ph.D.)--University of California, Berkeley, 2018. |
| 일반주기 |
Source: Dissertation Abstracts International, Volume: 80-01(E), Section: B.
Adviser: Umesh Vazirani. |
| 요약 | In this dissertation, we solve two open questions. First, can the output of a quantum computation be verified classically? We give the first protocol for provable classical verification of efficient quantum computations, depending only on the as |
| 요약 | The second question, which is related to verifiability and is often referred to as blind computation, asks the following: can a classical client delegate a desired quantum computation to a remote quantum server while hiding all data from the ser |
| 요약 | While we use entirely different techniques to construct the verification and homomorphic encryption protocols, they both rely on the same underlying cryptographic primitive of trapdoor claw-free functions. |
| 일반주제명 | Computer science. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
