The Cybercades Project: πτ_έρως και μαν(τ)ική ικανότητα

Thursday, 5 May 2011

"ή ποίησις υπό της των μαινόμενων
ή του σωφρονοΰντος ήφανίσθη"

[Πλάτωνα Φαίδρος, παλινωδία]

xtina said...: http://www.scribd.com/doc/30774684/%CE%A6%CE%B1%CE%AF%CE%B4%CF%81%CE%BF%CF%82-%CE%A0%CE%BB%CE%AC%CF%84%CF%89%CE%BD-%CE%BC%CE%B5-%CF%83%CF%87%CF%8C%CE%BB%CE%B9%CE%B1; 5 May 2011 at 12:31
xtina said...: Quantum decision tree

The quantum decision tree complexity Q2(f) is the depth of the lowest-depth quantum decision tree that gives the result f(x) with probability at least 2 / 3 for all x\in \{0,1\}^n . Another quantity, QE(f), is defined as the depth of the lowest-depth quantum decision tree that gives the result f(x) with probability 1 in all cases (i.e. computes f exactly). Q2(f) and QE(f) are more commonly known as quantum query complexities, because the direct definition of a quantum decision tree is more complicated than in the classical case. Similar to the randomized case, we define Q0(f) and Q1(f).[wiki]

http://en.wikipedia.org/wiki/Quantum_information_science; 5 May 2011 at 12:43
xtina said...: http://en.wikipedia.org/wiki/Fourier_operator

http://en.wikipedia.org/wiki/Unitary_operator

http://en.wikipedia.org/wiki/Grover%27s_algorithm; 5 May 2011 at 13:30
xtina said...: http://en.wikipedia.org/wiki/Deutsch-Jozsa_algorithm; 5 May 2011 at 13:30
xtina said...: π flag; 14 February 2014 at 14:02

The Cybercades Project