TY - Generic T1 - Experimental Comparison of Two Quantum Computing Architectures T2 - Proceedings of the National Academy of Sciences Y1 - 2017 A1 - N.M. Linke A1 - Dmitri Maslov A1 - Martin Roetteler A1 - S. Debnath A1 - C. Figgatt A1 - K. A. Landsman A1 - K. Wright A1 - Christopher Monroe AB -

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device [1] with limited connectivity, and the other is a fully connected trapped-ion system [2]. Even though the two systems have different native quantum interactions, both can be programmed in a way that is blind to the underlying hardware, thus allowing the first comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that employ more connectivity clearly benefit from a better connected system of qubits. While the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that co-designing particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

JA - Proceedings of the National Academy of Sciences VL - 114 U4 - 3305-3310 UR - http://www.pnas.org/content/114/13/3305 U5 - 10.1073/pnas.1618020114 ER -