.png){kind=icon}
Return
Efficient classical algorithms for simulating symmetric quantum systems
.png){kind=icon}
OA
AI
DOI：10.22331/q-2023-11-28-1189.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariant Hamiltonians specified in the symmetrized Pauli basis with runtimes polynomial in the system size. We use tensor-network methods to transform symmetry-equivariant operators to the block-diagonal Schur basis that is of polynomial size, and then perform exact matrix multiplication or diagonalization in this basis. These methods are adaptable to a wide range of input and output states including those prescribed in the Schur basis, as matrix product states, or as arbitrary quantum states when given the power to apply low depth circuits and single qubit measurements.
Journal
IF:
5.4
Papers:
974
Citations:
1.0W
Organization
Cited Papers
ShareSaveBlood sampling through peripheral intravenous cannulas: A look at current practice in Australia.png)
Collegian
OAAI
CollegianIF0
OAAIShareSaveShareSaveDefining Roles and Expectations for Faculty, Nurses, and Students in a Dedicated Education Unit
PREAI
ShareSave
View more