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...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2020-08-01
|
| Series: | Physical Review Research |
| Online Access: | http://doi.org/10.1103/PhysRevResearch.2.033316 |
| _version_ | 1797211246751121408 |
|---|---|
| author | Zachary Eldredge Leo Zhou Aniruddha Bapat James R. Garrison Abhinav Deshpande Frederic T. Chong Alexey V. Gorshkov |
| author_facet | Zachary Eldredge Leo Zhou Aniruddha Bapat James R. Garrison Abhinav Deshpande Frederic T. Chong Alexey V. Gorshkov |
| author_sort | Zachary Eldredge |
| collection | DOAJ |
| 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)2469-992610.1103/PhysRevA.98.062328] 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. |
| first_indexed | 2024-04-24T10:23:27Z |
| format | Article |
| id | doaj.art-11761f431ded4dfea59e9e5c2fec6700 |
| institution | Directory Open Access Journal |
| issn | 2643-1564 |
| language | English |
| last_indexed | 2024-04-24T10:23:27Z |
| publishDate | 2020-08-01 |
| publisher | American Physical Society |
| record_format | Article |
| series | Physical Review Research |
| spelling | doaj.art-11761f431ded4dfea59e9e5c2fec67002024-04-12T16:59:32ZengAmerican Physical SocietyPhysical Review Research2643-15642020-08-012303331610.1103/PhysRevResearch.2.033316Entanglement bounds on the performance of quantum computing architecturesZachary EldredgeLeo ZhouAniruddha BapatJames R. GarrisonAbhinav DeshpandeFrederic T. ChongAlexey V. GorshkovThere 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)2469-992610.1103/PhysRevA.98.062328] 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.http://doi.org/10.1103/PhysRevResearch.2.033316 |
| spellingShingle | Zachary Eldredge Leo Zhou Aniruddha Bapat James R. Garrison Abhinav Deshpande Frederic T. Chong Alexey V. Gorshkov Entanglement bounds on the performance of quantum computing architectures Physical Review Research |
| 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 |
| url | http://doi.org/10.1103/PhysRevResearch.2.033316 |
| work_keys_str_mv | AT zacharyeldredge entanglementboundsontheperformanceofquantumcomputingarchitectures AT leozhou entanglementboundsontheperformanceofquantumcomputingarchitectures AT aniruddhabapat entanglementboundsontheperformanceofquantumcomputingarchitectures AT jamesrgarrison entanglementboundsontheperformanceofquantumcomputingarchitectures AT abhinavdeshpande entanglementboundsontheperformanceofquantumcomputingarchitectures AT frederictchong entanglementboundsontheperformanceofquantumcomputingarchitectures AT alexeyvgorshkov entanglementboundsontheperformanceofquantumcomputingarchitectures |