4.5 Article

A linear-optical proof that the permanent is #P-hard

Related references

Note: Only part of the references are listed.
Article Multidisciplinary Sciences

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

Michael J. Bremner et al.

PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES (2011)

Article Multidisciplinary Sciences

Quantum computing, postselection, and probabilistic polynomial-time

S Aaronson

PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES (2005)

Article Multidisciplinary Sciences

A scheme for efficient quantum computation with linear optics

E Knill et al.

NATURE (2001)