233 search results - page 12 / 47 » Interactive Proofs For Quantum Computations |
STOC
2006
ACM
16 years 22 hour ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
107
click to vote
HIP
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we propose a new class of Human Interactive Proofs (HIPs) that allow a human to distinguish one computer from another. Unlike traditional HIPs, where the computer is...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
ARTS
1999
Springer
15 years 4 months ago
1999
Springer
This paper discusses the adaptation of the PVS theorem prover for performing analysis of real-time systems written in the ASTRAL formal specification language. A number of issues w...