User talk:RobinK
| This is RobinK's talk page, where you can send them messages and comments. |
|
Archives: 1Auto-archiving period: 30 days  |
 | Welcome to my talk page. Please adhere to the talk page guidelines and particularly the following:
|
File:Decision Problem.png listed for deletion
A file that you uploaded or altered, File:Decision Problem.png, has been listed at Wikipedia:Files for deletion. Please see the discussion to see why this is (you may have to search for the title of the image to find its entry), if you are interested in it not being deleted. Thank you. The Haz talk 04:10, 2 January 2012 (UTC)
- We have a random oracle relative to which BPP and BQP are separated. This is an improvement over the Deutsch-Jozsa algorithm separating P from EQP. The oracle needs to be quantum and nondecohering.
I think what this is saying is that given a quantum oracle (running in BQP time?), the classic algorithm can't solve the problem as efficiently as quantum algorithm. It's a stronger example of the power of QC than the Deutsch-Jozsa algorithm. I don't quite understand the sentence either, but if you have another idea about how to capture this concept, it would be helpful. I don't know enough about quantum complexity to craft a sentence myself. Skippydo (talk) 14:43, 19 August 2012 (UTC)
- The first sentence is vague, but a fairly common interpretation of it would be that there is a random oracle separation between BQP and BPP. This is not known to be true, and conjectured to be false. The second sentence is OK, so I didn't remove it -- although I'll try to reword it to make it clearer. The last one about the oracle being quantum and decohering makes very little sense to me. If it just means that the oracle has to allow the quantum computer to make queries in quantum superposition, then that's part of the definition of what it means to give BQP oracle access. --Robin (talk) 15:07, 19 August 2012 (UTC)
- Thank you for the explanation and the edits. You've been very helpful. Skippydo (talk) 20:29, 19 August 2012 (UTC)
- The first sentence is vague, but a fairly common interpretation of it would be that there is a random oracle separation between BQP and BPP. This is not known to be true, and conjectured to be false. The second sentence is OK, so I didn't remove it -- although I'll try to reword it to make it clearer. The last one about the oracle being quantum and decohering makes very little sense to me. If it just means that the oracle has to allow the quantum computer to make queries in quantum superposition, then that's part of the definition of what it means to give BQP oracle access. --Robin (talk) 15:07, 19 August 2012 (UTC)
File:Theoretical computer science.svg missing description details
is missing a description and/or other details on its image description page. If possible, please add this information. This will help other editors make better use of the image, and it will be more informative to readers.
If the information is not provided, the image may eventually be proposed for deletion, a situation which is not desirable, and which can easily be avoided.
If you have any questions, please see Help:Image page. Thank you. Theo's Little Bot (error?) 09:16, 14 April 2013 (UTC)Hi,
You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 14:05, 24 November 2015 (UTC)