# Quantum Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits

## TL;DR

This paper introduces a quantum teleportation-inspired algorithm that efficiently simulates low-depth random quantum circuits by reducing the number of logical qubits, enabling memory-efficient simulation of large circuits.

## Contribution

The paper presents a novel teleportation-based algorithm that renormalizes quantum circuits to fewer logical qubits, improving simulation efficiency for large, low-depth random quantum circuits.

## Key findings

- Successfully simulated 1D 1000-qubit, 42-depth circuits.
- Simulated 2D grid 125*8-qubit, 42-depth circuits.
- Simulated 2D Bristlecone 72-qubit, 32-depth 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.