In the Deutsch-Jozsa problem, we are given a black box quantum computer known as an oracle that implements the function .
When a language L is complete for some class B, then AL=AB provided that machines in A can execute reductions used in the completeness definition of class B. In particular, since SAT is NP-complete with respect to polynomial time reductions, PSAT=PNP.
Oracle Corporation | Oracle | Enigma machine | Rage Against the Machine | Automated teller machine | Oracle Database | Victor Talking Machine Company | Soft Machine | Oracle database | The Time Machine | Linotype machine | Vickers machine gun | DeLorean time machine | Darne machine gun | Rube Goldberg machine | MG 17 machine gun | The Wolseley Sheep Shearing Machine Company | Machine Head (band) | Machine Head | KPV heavy machine gun | The Oracle | slot machine | machine | The Oracle, Reading | ShKAS machine gun | PK machine gun | machine pistol | Love Removal Machine | Carter the Unstoppable Sex Machine | American Machine and Foundry |