Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge

arXiv: Quantum Physics, 2019.

Cited by: 0|Views11
EI

Abstract:

We define a new query measure we call quantum distinguishing complexity, denoted QD(f) for a Boolean function f. Unlike a quantum query algorithm, which must output a state close to |0> on a 0-input and a state close to |1> on a 1-input, a "quantum distinguishing algorithm" can output any state, as long as the output states for any 0-in...More

Code:

Data:

Your rating :
0

 

Tags
Comments