摘要Braunstein proposed an algorithm to distinguish the Boolean functions of two different weights. Here we implement the algorithm in a two-qubit nuclear magnetic resonance quantum information processor. The experiment shows that the algorithm could distinguish the Boolean functions of two different weights efficiently.
Abstract：Braunstein proposed an algorithm to distinguish the Boolean functions of two different weights. Here we implement the algorithm in a two-qubit nuclear magnetic resonance quantum information processor. The experiment shows that the algorithm could distinguish the Boolean functions of two different weights efficiently.
[1] Deutsch D 1985 Proc. R. Soc. A 400 97
[2] Deutsch D and Jozsa R 1992 Proc. R. Soc. A 439 553
[3] Shor P W 1997 SIAM J. Comput. 26 1484
[4] Grover L K 1996 Proc. 28th Ann. ACM Symposium on the Theory of Computing (Philadelphia, PA) p 212
[5] Grover L K 1997 Phys. Rev. Lett. 79 325
[6] Filiol E et al 1998 Proceedings of Advances in Cryptology–EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques (Philadelphia, USA 22–24 May 1996) Lecture Notes in Computer Science vol 1403 p 475
[7] MacWilliams F J et al 1996 The Theory of Error-Correting Codes (Amsterdam: North-Holland)
[8] Chakrabarty K et al 1996 J. Electron. Test.: Theory Appl. 8 71
[9] Chakrabarty K et al 1995 IEEE Trans. VLSI Syst. 3 72
[10] Braunstein 2007 J. Phys. A 40 8441
[11] Long G L et al 1999 Commun. Theor. Phys. 32 335
[12] Long G L et al 1999 Phys. Lett. A 262 27
[13] Long G L et al 2002 Phys. Lett. A 294 143
[14] Li S S et al 2001 Proc. Natl. Acad. Sci. 98 11847
[15] Gershenfeld N A et al 1997 Science 275 350
[16] Vandersypen L M K et al 2001 Nature 414 883
[17] Chuang I L et al 1998 Nature 393 143
[18] Jones J A et al 1998 J. Chem. Phys. 109 1648
[19] Liu X M et al 2007 Chin. Phys. Lett. 24 3316
[20] Hao L et al 2010 Sci. Chin. G 53 1765
[21] Hao L et al 2010 Sci. Chin. G 53 491
[22] Wang C et al 2011 Chin. Phys. Lett. 28 080307
[23] Cory D G 1998 Physica D 120 82
2011, Vol. 28 
