Quantum Proofs
نویسندگان
چکیده
منابع مشابه
Quantum Proofs
Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational analogue of the complexity class NP, known as QMA, in which a quantum state plays the role of a proof (also called a certificate or witness), and is checked by a polynomial-time quantum computation. For some problems, ...
متن کاملQuantum Proofs of Knowledge
We motivate, define and construct quantum proofs of knowledge, that is, proofs of knowledge secure against quantum adversaries. Our constructions are based on a new quantum rewinding technique that allows us to extract witnesses in many classical proofs of knowledge. We give criteria under which a classical proof of knowledge is a quantum proof of knowledge. Combining our results with Watrous’ ...
متن کاملQuantum Proofs for Classical Theorems
Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in diverse classical (non-quantum) areas, such as coding theory, communication complexity, and polynomial approximations. In this paper we survey these results and the quantum toolbox they use. ACM Classification: F.1.2 AMS Classifi...
متن کاملInteractive Proofs For Quantum Computation
The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems perform as they should, if we cannot efficiently compute predictions for their behavior? Vazirani has asked [Vaz07]: If computing predictions for Quantum Mech...
متن کاملInteractive Proofs For Quantum Computations
Making the computation of U|x〉 blind: we use a universal circuit Q, which on input |“U”〉 |x〉 outputs |“U”〉 U|x〉 Fault tolerance: we adapt standard techniques to the QPIP protocol. Care is due since the verifier needs to prepare authenticated states sequentially, due to lack of space. Interactive View of Shor’s Algorithm For N=xy,x≤y decide whether xi=1 P sends x,y: x≤y & xy=N. V accepts if xy=N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations and Trends® in Theoretical Computer Science
سال: 2016
ISSN: 1551-305X,1551-3068
DOI: 10.1561/0400000068