Oracle separations show proofs of quantumness coexist with P=NP
Oracle relative to which P^O = NP^O, BQP^O = PSPACE^O and IP^O subset BQP^O is hard on average against P^O/poly.
Stories per day · 30 days
1 stories, newest first · one card per story
1 stories, newest first · one card per story
Oracle relative to which P^O = NP^O, BQP^O = PSPACE^O and IP^O subset BQP^O is hard on average against P^O/poly.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views