Glossary: Difference between revisions

Jump to navigation Jump to search
7 bytes added ,  3 June 2019
Line 98: Line 98:
===Quantum One Way Function===
===Quantum One Way Function===
Based on the fundamental principles of quantum mechanics, QOWF was proposed by Gottesman and Chuang [https://arxiv.org/abs/quant-ph/0105032] and its definition is presented as follows.</br>
Based on the fundamental principles of quantum mechanics, QOWF was proposed by Gottesman and Chuang [https://arxiv.org/abs/quant-ph/0105032] and its definition is presented as follows.</br>
'''Definition 1''' Let k, <math>|f_k\rangle</math> be classical bits string of length <math>L_1</math>, quantum state of <math>L_2</math> qubits, respectively. A function <math>f : k\rightarrow |f_k\rangle</math>, where <math>|f_k\rangle</math> satisfies <math>\langle f_k|f_{k'}\rangle\le\delta < 1</math> for k\ne k', is called a QOWF under physical mechanics if
'''Definition 1''' Let k, <math>|f_k\rangle</math> be classical bits string of length <math>L_1</math>, quantum state of <math>L_2</math> qubits, respectively. A function <math>f : k\rightarrow |f_k\rangle</math>, where <math>|f_k\rangle</math> satisfies <math>\langle f_k|f_{k'}\rangle\le\delta < 1</math> for <math>k\ne k'</math>, is called a QOWF under physical mechanics if
(1) Easy to compute: The mapping <math>f : k\rightarrow |f_k\rangle</math> is easy to compute by a quantum polynomial-time algorithm.
#Easy to compute: The mapping <math>f : k\rightarrow |f_k\rangle</math> is easy to compute by a quantum polynomial-time algorithm.
(2) Hard to invert: Given <math>|f_k\rangle</math>, it is impossible to invert k by virtue of fundamental quantum information theory.
#Hard to invert: Given <math>|f_k\rangle</math>, it is impossible to invert k by virtue of fundamental quantum information theory.


===Gate Teleportation===  
===Gate Teleportation===  
Write, autoreview, editor, reviewer
3,125

edits

Navigation menu