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: | M. Ávila, G. H. Sun, A. L. Salas-Brito |
|---|---|
| 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!
|
Similar Items
-
Towards fault-tolerant distributed quantum computation (FT-DQC): Taxonomy, recent progress, and challenges
by: Harashta Tatimma Larasati, et al.
Published: (2025-06-01) -
Measuring quantum discord at the LHC
by: Tao Han, et al.
Published: (2025-05-01) -
Asymmetric cloning of steering, quantum discord, and coherence
by: Irina Ion, et al.
Published: (2025-08-01) -
Entanglement and quantum discord in the cavity QED models
by: Hui-hui Miao, et al.
Published: (2025-01-01) -
Drive-Loss Engineering and Quantum Discord Probing of Synchronized Optomechanical Squeezing
by: Hugo Molinares, et al.
Published: (2025-07-01)