The stabilizer rank of quantum states and classical simulation of quantum circuits
One of the leading proposals for classically simulating quantum circuits relies on decomposing the output state of the circuit as a superposition of stabilizer states. These simulations require an amount of classical resources that scales linearly in the number of terms in the superposition, and polynomially in the number of qubits and inverse error. The stabilizer rank of a quantum state is the minimum number of terms possible over all such decompositions.
The stabilizer rank of an n-qubit state is difficult to compute or bound, even for simple tensor product states. However, various techniques exist for finding decompositions in which the number of terms is much milder than 2^n, which allows for faster classical simulations. In this talk I will give an overview of these techniques, and describe various improvements in this framework.
Join the seminar on Zoom!
Meeting link: https://zoom.us/j/99786325766?pwd=TkJWTHhnUzBNbXRCMG1xRFhVWkZjQT09
Meeting ID: 997 8632 5766
Password: 0DEnFgj
Add event to calendar