Interactive proofs: Ten-year-old problem in theoretical computer science falls
Interactive proofs -- mathematical games that underlie much modern cryptography -- work even if players try to use quantum information to cheat. Computer scientists show there are multiprover interactive proofs that hold up against entangled respondents....
Published By: ScienceDaily Tech - Friday, 3 August, 2012
blog comments powered by Disqus
