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...
Saved in:
| Published in: | SciPost physics core Vol. 7; no. 2; p. 022 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
SciPost
01.04.2024
|
| ISSN: | 2666-9366, 2666-9366 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 expectation value in a product of a large number of identical bosonic states with a bounded number of bosons. This result complements earlier studies on the computational complexity in boson sampling and related setups. The proposed technique based on the Gaussian averaging is equally applicable to bosonic and fermionic systems. This also allows us to improve an earlier polynomial complexity estimate for the fermionic version of the same problem. |
|---|---|
| ISSN: | 2666-9366 2666-9366 |
| DOI: | 10.21468/SciPostPhysCore.7.2.022 |