Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm

M. Ávila, G. H. Sun and A. L. Salas-Brito

Advances in Mathematical Physics, 2014, vol. 2014, 1-4

Abstract:

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 , where is an 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 is, where is the time of execution of the DQC1 algorithm and 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 .

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AMP/2014/367905.pdf (application/pdf)
http://downloads.hindawi.com/journals/AMP/2014/367905.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlamp:367905

DOI: 10.1155/2014/367905

Access Statistics for this article

More articles in Advances in Mathematical Physics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().