Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm
The power of one qubit deterministic quantum processor (DQC1) (Knill and Laflamme (1998)) generates a nonclassical correlation known as quantum discord. The DQC1 algorithm executes in an efficient way with a characteristic time given by τ=Tr[Un]/2n, where Un is an n qubit unitary gate. For pure st...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Advances in Mathematical Physics |
| Online Access: | http://dx.doi.org/10.1155/2014/367905 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849308358907002880 |
|---|---|
| author | M. Ávila G. H. Sun A. L. Salas-Brito |
| author_facet | M. Ávila G. H. Sun A. L. Salas-Brito |
| author_sort | M. Ávila |
| collection | DOAJ |
| description | The power of one qubit deterministic quantum processor (DQC1) (Knill and Laflamme (1998)) generates a nonclassical correlation known as quantum discord. The DQC1 algorithm executes in an efficient way with a characteristic time given by τ=Tr[Un]/2n, where Un is an n qubit unitary gate. For pure states, quantum discord means entanglement while for mixed states such a quantity is more than entanglement. Quantum discord can be thought of as the mutual information between two systems. Within the quantum discord approach the role of time in an efficient evaluation of τ is discussed. It is found that the smaller the value of t/T is, where t is the time of execution of the DQC1 algorithm and T is the scale of time where the nonclassical correlations prevail, the more efficient the calculation of τ is. A Mösbauer nucleus might be a good processor of the DQC1 algorithm while a nuclear spin chain would not be efficient for the calculation of τ. |
| format | Article |
| id | doaj-art-0f4d348775ee4ea8beb783b055841d9a |
| institution | Kabale University |
| issn | 1687-9120 1687-9139 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Advances in Mathematical Physics |
| spelling | doaj-art-0f4d348775ee4ea8beb783b055841d9a2025-08-20T03:54:29ZengWileyAdvances in Mathematical Physics1687-91201687-91392014-01-01201410.1155/2014/367905367905Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 AlgorithmM. Ávila0G. H. Sun1A. L. Salas-Brito2Centro Universitario UAEM Valle de Chalco, UAEMex María Isabel, 56615 Valle de Chalco, MEX, MexicoCentro Universitario UAEM Valle de Chalco, UAEMex María Isabel, 56615 Valle de Chalco, MEX, MexicoInstituto de Ciencias Nucleares, Universidad Nacional Autónoma de México, Circuito Exterior, CU, Coyoacán, DF, MexicoThe power of one qubit deterministic quantum processor (DQC1) (Knill and Laflamme (1998)) generates a nonclassical correlation known as quantum discord. The DQC1 algorithm executes in an efficient way with a characteristic time given by τ=Tr[Un]/2n, where Un is an n qubit unitary gate. For pure states, quantum discord means entanglement while for mixed states such a quantity is more than entanglement. Quantum discord can be thought of as the mutual information between two systems. Within the quantum discord approach the role of time in an efficient evaluation of τ is discussed. It is found that the smaller the value of t/T is, where t is the time of execution of the DQC1 algorithm and T is the scale of time where the nonclassical correlations prevail, the more efficient the calculation of τ is. A Mösbauer nucleus might be a good processor of the DQC1 algorithm while a nuclear spin chain would not be efficient for the calculation of τ.http://dx.doi.org/10.1155/2014/367905 |
| spellingShingle | M. Ávila G. H. Sun A. L. Salas-Brito Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm Advances in Mathematical Physics |
| title | Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm |
| title_full | Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm |
| title_fullStr | Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm |
| title_full_unstemmed | Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm |
| title_short | Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm |
| title_sort | scales of time where the quantum discord allows an efficient execution of the dqc1 algorithm |
| url | http://dx.doi.org/10.1155/2014/367905 |
| work_keys_str_mv | AT mavila scalesoftimewherethequantumdiscordallowsanefficientexecutionofthedqc1algorithm AT ghsun scalesoftimewherethequantumdiscordallowsanefficientexecutionofthedqc1algorithm AT alsalasbrito scalesoftimewherethequantumdiscordallowsanefficientexecutionofthedqc1algorithm |