Generation of Pseudo-Random Quantum States on Actual Quantum Processors
arXiv:2302.04101 · doi:10.3390/e25040607
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.
arXiv comment14 pages, 8 figures
References in corpus (28)
- Quantum entanglement
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Quantum Algorithms
- Quantum computational advantage using photons
- The theory of variational hybrid quantum-classical algorithms
- Black holes as mirrors: quantum information in random subsystems
- Time Optimal Control in Spin Systems
- Validating quantum computers using randomized model circuits
- Quantum optimization using variational algorithms on near-term quantum devices
- Probing entanglement entropy via randomized measurements
- Optimal Quantum Circuits for General Two-Qubit Gates
- Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
- Maximally multipartite entangled states
- Preparing random states and benchmarking with many-body quantum chaos
- Composed ensembles of random unitary matrices
- Efficient Generation of Generic Entanglement
- Models of quantum complexity growth
- Closing the "Quantum Supremacy" Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer
- Convergence Conditions for Random Quantum Circuits
- The Boundary for Quantum Advantage in Gaussian Boson Sampling
- Emergence of typical entanglement in two-party random processes
- Probability density function characterization of multipartite entanglement
- Distribution of bipartite entanglement for random pure states
- Entanglement Generation of Nearly-Random Operators
- Entanglement Typicality
- Optimal two-qubit gate for generation of random bipartite entanglement
- Quantum circuit for three-qubit random states