자료유형 | E-Book |
---|---|
개인저자 | Mahadev, Urmila M. |
단체저자명 | University of California, Berkeley. Computer Science. |
서명/저자사항 | Classical Verification and Blind Delegation of Quantum Computations. |
발행사항 | [S.l.] : University of California, Berkeley., 2018 |
발행사항 | Ann Arbor : ProQuest Dissertations & Theses, 2018 |
형태사항 | 119 p. |
소장본 주기 | School code: 0028. |
ISBN | 9780438325111 |
일반주기 |
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. |
언어 | 영어 |
기본자료 저록 | Dissertation Abstracts International80-01B(E). Dissertation Abstract International |
대출바로가기 | http://www.riss.kr/pdu/ddodLink.do?id=T14998390 |
인쇄
No. | 등록번호 | 청구기호 | 소장처 | 도서상태 | 반납예정일 | 예약 | 서비스 | 매체정보 |
---|---|---|---|---|---|---|---|---|
1 | WE00027827 | 004 | 가야대학교/전자책서버(컴퓨터서버)/ | 대출가능 |