Generation of Pseudo-Random Quantum States on Actual Quantum Processors
Gabriele Cenedese, Maria Bondani, Dario Rosa, Giuliano Benenti

TL;DR
This paper presents an efficient method to generate pseudo-random quantum states with high entanglement, benchmarking actual quantum processors and highlighting the importance of qubit connectivity for entanglement quality.
Contribution
The paper introduces a new method for generating highly entangled pseudo-random quantum states and demonstrates its effectiveness on real quantum hardware.
Findings
Harmony outperforms ibm_lagos despite higher error rates due to better connectivity.
The method achieves near-maximal multipartite entanglement.
Qubit network architecture significantly impacts entanglement generation.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
