Entanglement bounds on the performance of quantum computing architectures

Download

• Paper

Abstract

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.

Citation

Eldredge, Z., Zhou, L., Bapat, A., Garrison, J. R., Deshpande, A., Chong, F. T., & Gorshkov, A. V. (2020). “Entanglement bounds on the performance of quantum computing architectures”. Physical review research, 2(3), 033316

@article{eldredge2020entanglement,
  title={Entanglement bounds on the performance of quantum computing architectures},
  author={Eldredge, Zachary and Zhou, Leo and Bapat, Aniruddha and Garrison, James R and Deshpande, Abhinav and Chong, Frederic T and Gorshkov, Alexey V},
  journal={Physical review research},
  volume={2},
  number={3},
  pages={033316},
  year={2020},
  publisher={APS}
}

Related material