Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer

Details Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer

2005-09-28

arxiv.org/abs/quant-ph/0509193v1

Physics

Quantum Physics

4 pages

Scientific paper

In the past few years it has been shown that universal quantum computation can be obtained by projective measurements alone, with no need for unitary gates. This suggests that the underlying logic of quantum computing may be an algebra of sequences of quantum measurements rather than an algebra of products of unitary operators. Such a Sequential Quantum Logic (SQL) was developed in the late 70's and has more recently been applied to the consistent histories framework of quantum mechanics as a possible route to the theory of quantum gravity. In this letter, I give a method for deciding the truth of a proposition in SQL with nonzero probability of success on a quantum computer.

Affiliated with

Also associated with

No associations

Rating

Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239149