Entanglement bounds on the performance of quantum computing architectures
arXiv:1908.04802 · doi:10.1103/PhysRevResearch.2.033316
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.
9 pages, 5 figures, 1 table (journal version)
References in corpus (25)
- Quantum entanglement
- Concentrating Partial Entanglement by Local Operations
- Efficient classical simulation of slightly entangled quantum computations
- Quantum Teleportation is a Universal Computational Primitive
- Matrix Product Density Operators: Simulation of finite-T and dissipative systems
- Experimental Comparison of Two Quantum Computing Architectures
- Optimal local implementation of non-local quantum gates
- Distributed Quantum Computation Based-on Small Quantum Registers
- Deterministic teleportation of a quantum gate between two logical qubits
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- On the capacities of bipartite Hamiltonians and unitary gates
- Basic circuit compilation techniques for an ion-trap quantum machine
- Universal quantum computation with little entanglement
- On entropy growth and the hardness of simulating time evolution
- Modular architectures for quantum networks
- Entanglement rates and area laws
- Distributing Graph States Over Arbitrary Quantum Networks
- Entanglement area laws for long-range interacting systems
- Universality of Entanglement and Quantum Computation Complexity
- Entanglement over the rainbow
- Quantum phase transition from bounded to extensive entanglement entropy in a frustration-free spin chain
- Impact of qubit connectivity on quantum algorithm performance
- Minimally complex ion traps as modules for quantum communication and computing
- Holographic rainbow networks for colorful Motzkin and Fredkin spin chains
- Unitary Entanglement Construction in Hierarchical Networks