| 000 -LEADER |
|---|
| fixed length control field |
01717nab a22001817i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
CITU |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250516163655.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250516c2020 ph |||p| |||| 00| 0 eng d |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Preferred name for the person |
Del Rosario, Luis Gabriel Q. |
| Relator term |
author |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Effect of quantum decoherence on the Deutsch-Jozsa algorithm / |
| Statement of responsibility, etc |
Luis Gabriel Q. del Rosario, Henry N. Adorna. |
| 264 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Date of publication, distribution, etc |
2020 |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
Quantum 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<br/>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 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Quantum computing. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer algorithms. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Adorna, Henry N. |
| Relator term |
author |
| 773 ## - HOST ITEM ENTRY |
|---|
| Title |
Philippine Computing Journal |
| Relationship information |
vol. 15, no. 2: (Dec. 2020), pages 47-58. |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Source of classification or shelving scheme |
|
| Item type |
JOURNAL ARTICLE |