Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states
It is known that computing the permanent of the matrix 1+A, where A is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I extend this result to a generalization of the matrix permanent: An...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SciPost
2024-04-01
|
| Series: | SciPost Physics Core |
| Online Access: | https://scipost.org/SciPostPhysCore.7.2.022 |