A linear-optical proof that the permanent is # <b>P</b> -hard (Q2901811): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1109.1674 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quantum computing, postselection, and probabilistic polynomial-time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PP is closed under intersection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank |
Latest revision as of 11:51, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A linear-optical proof that the permanent is # <b>P</b> -hard |
scientific article |
Statements
A linear-optical proof that the permanent is # <b>P</b> -hard (English)
0 references
31 July 2012
0 references
bosons
0 references
permanent
0 references
quantum computing
0 references
valiant
0 references
\(\#\mathrm{P}\)-complete
0 references
linear optics
0 references
0 references