Benchmarking an 11-qubit quantum computer
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:XPHQOUH4record.jsonopen to challenge →
read the original abstract
The field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 $^{171}$Yb$^{+}$ ions. We demonstrate average single-qubit gate fidelities of 99.5$\%$, average two-qubit-gate fidelities of 97.5$\%$, and state preparation and measurement errors of 0.7$\%$. To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani (BV) and Hidden Shift (HS) algorithms into our native gates and execute them on the hardware with average success rates of 78$\%$ and 35$\%$, respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Localizing genuine multiparty entanglement in noisy stabilizer states
Lower bounds on localizable genuine multiparty entanglement are computed for graph states and toric codes under single-qubit Pauli noise, revealing critical noise strengths beyond which post-measurement states are bis...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.