Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Computational complexity of exterior products and multi-particle amplitudes of non-interacting fermions in entangled states (1603.02724v3)

Published 8 Mar 2016 in cs.CC, cond-mat.other, and quant-ph

Abstract: Noninteracting bosons were proposed to be used for a demonstration of quantum-computing supremacy in a boson-sampling setup. A similar demonstration with fermions would require that the fermions are initially prepared in an entangled state. I suggest that pairwise entanglement of fermions would be sufficient for this purpose. Namely, it is shown that computing multi-particle scattering amplitudes for fermions entangled pairwise in groups of four single-particle states is #P hard. In linear algebra, such amplitudes are expressed as exterior products of two-forms of rank two. In particular, a permanent of a NxN matrix may be expressed as an exterior product of N2 two-forms of rank two in dimension 2N2, which establishes the #P-hardness of the latter.

Citations (4)

Summary

We haven't generated a summary for this paper yet.