Verification of Universal Quantum Computation: Difference between revisions

Jump to navigation Jump to search
Line 17: Line 17:


==Properties==
==Properties==
*'''Problem Definition (Verifiability of BQP computations)''': Does every problem in BQP admit an interactive-proof system in which the prover is restricted to BQP computations?
*'''[https://complexityzoo.uwaterloo.ca/Complexity_Zoo Complexity Classes]'''
*'''[https://complexityzoo.uwaterloo.ca/Complexity_Zoo Complexity Classes]'''
#'''BQP''' is the class of problems which can be efficiently solved by quantum computers
#'''BQP''' is the class of problems which can be efficiently solved by quantum computers
Write, autoreview, editor, reviewer
3,125

edits

Navigation menu