MARC보기
LDR02064nam u200397 4500
001000000421720
00520190215165541
008181129s2018 |||||||||||||||||c||eng d
020 ▼a 9780438325111
035 ▼a (MiAaPQ)AAI10817687
035 ▼a (MiAaPQ)berkeley:17934
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 247004
0820 ▼a 004
1001 ▼a Mahadev, Urmila M.
24510 ▼a Classical Verification and Blind Delegation of Quantum Computations.
260 ▼a [S.l.]: ▼b University of California, Berkeley., ▼c 2018.
260 1 ▼a Ann Arbor: ▼b ProQuest Dissertations & Theses, ▼c 2018.
300 ▼a 119 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 80-01(E), Section: B.
500 ▼a Adviser: Umesh Vazirani.
5021 ▼a Thesis (Ph.D.)--University of California, Berkeley, 2018.
520 ▼a 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
520 ▼a 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
520 ▼a 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.
590 ▼a School code: 0028.
650 4 ▼a Computer science.
690 ▼a 0984
71020 ▼a University of California, Berkeley. ▼b Computer Science.
7730 ▼t Dissertation Abstracts International ▼g 80-01B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0028
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T14998390 ▼n KERIS ▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다.
980 ▼a 201812 ▼f 2019
990 ▼a ***1012033