Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is a widely believed, though unproven, conjecture that the capability of postselection increases the language recognition por of both probabilistic and quantum polynomial-time computers. It is also unknown whether polynomial-time quantum machines with postselection are more porful than their probabilistic counterparts with the same resource restrictions.  approach these problems by imposing additional constraints on the resources to be used by the computer, and are able to prove for the first time that postselection does augment the computational por of both classical and quantum computers, and that quantum does outperform probabilistic in this context, under simultaneous time and space bounds in a certain range.  also look at postselected versions of space-bounded classes, as ll as those corresponding to error-free and one-sided error recognition, and provide classical characterizations. It is shown that NL would equal RL if the randomized machines had the postselection capability.
['Abuzer Yakaryilmaz', 'A. C. Cem Say']
I am writing a research paper on a idea Proving the Power of Postselection
[{"from": "human", "value": "I am writing a research paper on a idea Proving the Power of Postselection"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is a widely believed, though unproven, conjecture that the capability of postselection increases the language recognition por of both probabilistic and quantum polynomial-time computers. It is also unknown whether polynomial-time quantum machines with postselection are more porful than their probabilistic counterparts with the same resource restrictions.  approach these problems by imposing additional constraints on the resources to be used by the computer, and are able to prove for the first time that postselection does augment the computational por of both classical and quantum computers, and that quantum does outperform probabilistic in this context, under simultaneous time and space bounds in a certain range.  also look at postselected versions of space-bounded classes, as ll as those corresponding to error-free and one-sided error recognition, and provide classical characterizations. It is shown that NL would equal RL if the randomized machines had the postselection capability."}]