|Title||Entanglement Bounds on the Performance of Quantum Computing Architectures|
|Publication Type||Journal Article|
|Year of Publication||2019|
|Authors||Eldredge, Z, Zhou, L, Bapat, A, Garrison, JR, Deshpande, A, Chong, FT, Gorshkov, AV|
There are many possible architectures for future quantum computers that designers 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 establish a connection between a quantity known as the isoperimetric number and a lower bound on the time required to create highly entangled states. The metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We describe how these results can be applied to the evaluation of the hierarchical architecture proposed in Phys. Rev. A 98, 062328 (2018). We also show that the time-complexity bound we place on the creation of highly-entangled states can be saturated up to a multiplicative factor logarithmic in the number of qubits.