Bounds on the quantity of entanglement in parallel quantum computing of a single ensemble quantum computer

M. Ávila Aoki, Guo Hua Sun, Shi Hai Dong

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Speeding up of the processing of quantum algorithms has been focused on from the point of view of an ensemble quantum computer (EQC) working in a parallel mode. As a consequence of such efforts, additional speed up has been achieved for processing both Shor's and Grover's algorithms. On the other hand, in the literature there is scarce concern about the quantity of entanglement contained in EQC approaches, for this reason in the present work we study such a quantity. As a first result, an upper bound on the quantity of entanglement contained in EQC is imposed. As a main result we prove that equally weighted states are not appropriate for EQC working in parallel mode. In order that our results are not exclusively purely theoretical, we exemplify the situation by discussing the entanglement on an ensemble of n1 = 3 diamond quantum computers. © 2013 Published by NRC Research Press.
Original languageAmerican English
Pages (from-to)159-162
Number of pages142
JournalCanadian Journal of Physics
DOIs
StatePublished - 1 Feb 2014

Fingerprint

quantum computers
quantum computation
diamonds

Cite this

@article{f9cfd362a20448f18a238e97d92746cf,
title = "Bounds on the quantity of entanglement in parallel quantum computing of a single ensemble quantum computer",
abstract = "Speeding up of the processing of quantum algorithms has been focused on from the point of view of an ensemble quantum computer (EQC) working in a parallel mode. As a consequence of such efforts, additional speed up has been achieved for processing both Shor's and Grover's algorithms. On the other hand, in the literature there is scarce concern about the quantity of entanglement contained in EQC approaches, for this reason in the present work we study such a quantity. As a first result, an upper bound on the quantity of entanglement contained in EQC is imposed. As a main result we prove that equally weighted states are not appropriate for EQC working in parallel mode. In order that our results are not exclusively purely theoretical, we exemplify the situation by discussing the entanglement on an ensemble of n1 = 3 diamond quantum computers. {\circledC} 2013 Published by NRC Research Press.",
author = "Aoki, {M. {\'A}vila} and Sun, {Guo Hua} and Dong, {Shi Hai}",
year = "2014",
month = "2",
day = "1",
doi = "10.1139/cjp-2013-0083",
language = "American English",
pages = "159--162",
journal = "Canadian Journal of Physics",
issn = "0008-4204",
publisher = "National Research Council of Canada",

}

Bounds on the quantity of entanglement in parallel quantum computing of a single ensemble quantum computer. / Aoki, M. Ávila; Sun, Guo Hua; Dong, Shi Hai.

In: Canadian Journal of Physics, 01.02.2014, p. 159-162.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Bounds on the quantity of entanglement in parallel quantum computing of a single ensemble quantum computer

AU - Aoki, M. Ávila

AU - Sun, Guo Hua

AU - Dong, Shi Hai

PY - 2014/2/1

Y1 - 2014/2/1

N2 - Speeding up of the processing of quantum algorithms has been focused on from the point of view of an ensemble quantum computer (EQC) working in a parallel mode. As a consequence of such efforts, additional speed up has been achieved for processing both Shor's and Grover's algorithms. On the other hand, in the literature there is scarce concern about the quantity of entanglement contained in EQC approaches, for this reason in the present work we study such a quantity. As a first result, an upper bound on the quantity of entanglement contained in EQC is imposed. As a main result we prove that equally weighted states are not appropriate for EQC working in parallel mode. In order that our results are not exclusively purely theoretical, we exemplify the situation by discussing the entanglement on an ensemble of n1 = 3 diamond quantum computers. © 2013 Published by NRC Research Press.

AB - Speeding up of the processing of quantum algorithms has been focused on from the point of view of an ensemble quantum computer (EQC) working in a parallel mode. As a consequence of such efforts, additional speed up has been achieved for processing both Shor's and Grover's algorithms. On the other hand, in the literature there is scarce concern about the quantity of entanglement contained in EQC approaches, for this reason in the present work we study such a quantity. As a first result, an upper bound on the quantity of entanglement contained in EQC is imposed. As a main result we prove that equally weighted states are not appropriate for EQC working in parallel mode. In order that our results are not exclusively purely theoretical, we exemplify the situation by discussing the entanglement on an ensemble of n1 = 3 diamond quantum computers. © 2013 Published by NRC Research Press.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84893644287&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84893644287&origin=inward

U2 - 10.1139/cjp-2013-0083

DO - 10.1139/cjp-2013-0083

M3 - Article

SP - 159

EP - 162

JO - Canadian Journal of Physics

JF - Canadian Journal of Physics

SN - 0008-4204

ER -