<--- Back to Details
First PageDocument Content
Quantum complexity theory / Stochastic process / PP / Pi / Boolean algebra / PostBQP / Theoretical computer science / Applied mathematics / Statistics
Date: 2009-12-01 22:56:24
Quantum complexity theory
Stochastic process
PP
Pi
Boolean algebra
PostBQP
Theoretical computer science
Applied mathematics
Statistics

Visio-sscs_dkw081808_extended.vsd

Add to Reading List

Source URL: paradise.caltech.edu

Download Document from Source Website

File Size: 177,93 KB

Share Document on Facebook

Similar Documents

Quantum complexity theory / Stochastic process / PP / Pi / Boolean algebra / PostBQP / Theoretical computer science / Applied mathematics / Statistics

Visio-sscs_dkw081808_extended.vsd

DocID: rpHK - View Document

Quantum complexity theory / Models of computation / Turing machine / PostBQP / PP / Quantum Turing machine / Probabilistic Turing machine / RL / Bounded-error probabilistic polynomial / Theoretical computer science / Computational complexity theory / Applied mathematics

Proving the power of postselection⋆ Abuzer Yakaryılmaz1, ⋆⋆ and A.C. Cem Say2, ⋆ ⋆ ⋆ 1 arXiv:1111.3125v1 [cs.CC] 14 Nov 2011

DocID: nntQ - View Document

PostBQP / PP / QMA / Computational complexity theory / Quantum computer / BQP / Density matrix renormalization group / Oracle machine / PEPS / Theoretical computer science / Applied mathematics / Quantum complexity theory

PEPS and Postselection The computational complexity of PEPS

DocID: 5OPp - View Document

Quantum complexity theory / Stochastic process / PP / Pi / Boolean algebra / PostBQP / Theoretical computer science / Applied mathematics / Statistics

Visio-sscs_dkw081808_extended.vsd

DocID: 5p5E - View Document

Quantum mechanics / Quantum circuit / Quantum gate / Quantum computer / PostBQP / Qubit / Quantum Fourier transform / Controlled NOT gate / Toffoli gate / Theoretical computer science / Quantum information science / Applied mathematics

A Linear-Optical Proof that the Permanent is #P-Hard Scott Aaronson∗ For Les Valiant, on the occasion of his Turing Award

DocID: 4AZt - View Document