Generation of Pseudo-Random Quantum States on Actual Quantum Processors

Abstract

The generation of a large amount of entanglement is a necessary condition for a quantum computer to achieve quantum advantage. In this paper, we propose a method to efficiently generate pseudo-random quantum states, for which the degree of multipartite entanglement is nearly maximal. We argue that the method is optimal, and use it to benchmark actual superconducting (IBM's ibm_lagos) and ion trap (IonQ's Harmony) quantum processors. Despite the fact that ibm_lagos has lower single-qubit and two-qubit error rates, the overall performance of Harmony is better thanks to low error rate in state preparation and measurement and to the all-to-all connectivity of qubits. Our result highlights the relevance of the qubits network architecture to generate highly entangled state.

14 pages, 8 figures

References in corpus (8)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Black holes as mirrors: quantum information in random subsystems
• Maximally multipartite entangled states
• Emergence of typical entanglement in two-party random processes
• Probability density function characterization of multipartite entanglement
• Entanglement Typicality
• Optimal two-qubit gate for generation of random bipartite entanglement