Halting Is Poly-Time Quantum Provable
Gödel’s Lost Letter and P=NP 2020-01-15
Summary:
How does this intersect David Deutsch’s thoughts in 1985? Composite crop from homepages Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen (JNVWY) have just posted a paper titled . The title means that multiple provers sharing quantum entanglement, given any Turing machine and string accepted by , can convince a polynomial-time bounded … … Continue reading →