000			01717nab a22001817i 4500
999			_c90488 _d90488
003			CITU
005			20250516163655.0
008			250516c2020 ph |||p| |||| 00| 0 eng d
100	1		_aDel Rosario, Luis Gabriel Q. _eauthor
245	1	0	_aEffect of quantum decoherence on the Deutsch-Jozsa algorithm / _cLuis Gabriel Q. del Rosario, Henry N. Adorna.
264		1	_c2020
520			_aQuantum computers have the potential to solve certain problems exponentially faster than classical computers, with one of the most simple examples being Deutsch and Jozsa’s black box algorithm for determining whether a function f : {0, 1}n → {0, 1} is constant or balanced. However, one major roadblock in the realization of the quantum computer is decoherence, or the loss of quantum information through coupling with the environment. Several methods have been proposed for incorporating decoherence in the study of quantum algorithms, one of which was introduced by Chuang et. al. and redefined by Brian De Jesus in 2014. This method, which had the characteristic of being easily applicable to different quantum algorithms, was used to find that the decoherence of the Deutsch-Jozsa algorithm is bounded by 𝛼 < L/3L−1 , which for large L, shows it is more tolerant than Shor’s factoring algorithm and Grover’s unstructured search algorithm. Moreover, it was found that even if the algorithm were to return the wrong answer 50% of the time, it would still be more efficient than its classical counterpart.
650		0	_aQuantum computing.
650		0	_aComputer algorithms.
700	1		_aAdorna, Henry N. _eauthor
773			_tPhilippine Computing Journal _gvol. 15, no. 2: (Dec. 2020), pages 47-58.
942			_2ddc _cART