Quantum Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits

Abstract

We show that low-depth random quantum circuits can be efficiently simulated by a quantum teleportation-inspired algorithm. By using logical qubits to redirect and teleport the quantum information in quantum circuits, the original circuits can be renormalized to new circuits with a smaller number of logical qubits. We demonstrate the algorithm to simulate several random quantum circuits, including 1D-chain 1000-qubit 42-depth, 2D-grid 125*8-qubit 42-depth and 2D-Bristlecone 72-qubit 32-depth circuits. Our results present a memory-efficient method with a clear physical picture to simulate low-depth random quantum circuits.

arXiv comment9 pages, 11 figures

References in corpus (23)

• Quantum Computing in the NISQ era and beyond
• Quantum algorithm for solving linear systems of equations
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Simulated Quantum Computation of Molecular Energies
• Characterizing Quantum Supremacy in Near-Term Devices
• Quantum Computational Supremacy
• High-fidelity quantum logic gates using trapped-ion hyperfine qubits
• High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
• High-Fidelity Universal Gate Set for ${}^9$Be${}^{+}$ Ion Qubits
• Simulating quantum computation by contracting tensor networks
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• No imminent quantum supremacy by boson sampling
• 64-Qubit Quantum Circuit Simulation
• Massively parallel quantum computer simulator, eleven years later
• Simulation of low-depth quantum circuits as complex undirected graphical models
• Classical Simulation of Intermediate-Size Quantum Circuits
• Quantum Supremacy Is Both Closer and Farther than It Appears
• Parameters of Pseudo-Random Quantum Circuits
• Quantum Supremacy Circuit Simulation on Sunway TaihuLight

Cited by in corpus (14)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• Computational advantage of quantum random sampling
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Variational Quantum Circuits for Quantum State Tomography
• Visualizing Entanglement in multi-Qubit Systems
• A quantum circuit simulator and its applications on Sunway TaihuLight supercomputer
• Entanglement and complexity of interacting qubits subject to asymmetric noise
• Quantum entanglement, local indicators and effect of external fields in the Kugel-Khomskii model
• Two imaginarity monotones induced by unified $(\alpha ,\beta )$-relative entropy
• Efficient approximation of experimental Gaussian boson sampling
• Noisy Monitored Quantum Circuits
• High-performance parallel classical scheme for simulating shallow quantum circuits