Cargando…

Entanglement bounds on the performance of quantum computing architectures

There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph’s performance as a quantum architecture can be difficult. In this paper, we show that a quantity know...

Descripción completa

Detalles Bibliográficos
Autores principales: Eldredge, Zachary, Zhou, Leo, Bapat, Aniruddha, Garrison, James R., Deshpande, Abhinav, Chong, Frederic T., Gorshkov, Alexey V.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8194250/
https://www.ncbi.nlm.nih.gov/pubmed/34124689
http://dx.doi.org/10.1103/physrevresearch.2.033316
_version_ 1783706381305511936
author Eldredge, Zachary
Zhou, Leo
Bapat, Aniruddha
Garrison, James R.
Deshpande, Abhinav
Chong, Frederic T.
Gorshkov, Alexey V.
author_facet Eldredge, Zachary
Zhou, Leo
Bapat, Aniruddha
Garrison, James R.
Deshpande, Abhinav
Chong, Frederic T.
Gorshkov, Alexey V.
author_sort Eldredge, Zachary
collection PubMed
description There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph’s performance as a quantum architecture can be difficult. In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states. This metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We use this metric to evaluate the hierarchical architecture proposed by A. Bapat et al. [Phys. Rev. A 98, 062328 (2018)] and find it to be a promising alternative to the conventional grid architecture. We also show that the lower bound that this metric places on the creation time of highly entangled states can be saturated with a constructive protocol, up to a factor logarithmic in the number of qubits.
format Online
Article
Text
id pubmed-8194250
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-81942502021-06-11 Entanglement bounds on the performance of quantum computing architectures Eldredge, Zachary Zhou, Leo Bapat, Aniruddha Garrison, James R. Deshpande, Abhinav Chong, Frederic T. Gorshkov, Alexey V. Phys Rev Res Article There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph’s performance as a quantum architecture can be difficult. In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states. This metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We use this metric to evaluate the hierarchical architecture proposed by A. Bapat et al. [Phys. Rev. A 98, 062328 (2018)] and find it to be a promising alternative to the conventional grid architecture. We also show that the lower bound that this metric places on the creation time of highly entangled states can be saturated with a constructive protocol, up to a factor logarithmic in the number of qubits. 2020 /pmc/articles/PMC8194250/ /pubmed/34124689 http://dx.doi.org/10.1103/physrevresearch.2.033316 Text en https://creativecommons.org/licenses/by/4.0/Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International (https://creativecommons.org/licenses/by/4.0/) license.
spellingShingle Article
Eldredge, Zachary
Zhou, Leo
Bapat, Aniruddha
Garrison, James R.
Deshpande, Abhinav
Chong, Frederic T.
Gorshkov, Alexey V.
Entanglement bounds on the performance of quantum computing architectures
title Entanglement bounds on the performance of quantum computing architectures
title_full Entanglement bounds on the performance of quantum computing architectures
title_fullStr Entanglement bounds on the performance of quantum computing architectures
title_full_unstemmed Entanglement bounds on the performance of quantum computing architectures
title_short Entanglement bounds on the performance of quantum computing architectures
title_sort entanglement bounds on the performance of quantum computing architectures
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8194250/
https://www.ncbi.nlm.nih.gov/pubmed/34124689
http://dx.doi.org/10.1103/physrevresearch.2.033316
work_keys_str_mv AT eldredgezachary entanglementboundsontheperformanceofquantumcomputingarchitectures
AT zhouleo entanglementboundsontheperformanceofquantumcomputingarchitectures
AT bapataniruddha entanglementboundsontheperformanceofquantumcomputingarchitectures
AT garrisonjamesr entanglementboundsontheperformanceofquantumcomputingarchitectures
AT deshpandeabhinav entanglementboundsontheperformanceofquantumcomputingarchitectures
AT chongfrederict entanglementboundsontheperformanceofquantumcomputingarchitectures
AT gorshkovalexeyv entanglementboundsontheperformanceofquantumcomputingarchitectures