Abstract
In the same way as the quantum no-cloning theorem and quantum key distribution in two preceding papers, entanglement-assisted quantum teleportation and Grover’s search algorithm are generalized by transferring them to an abstract setting, including usual quantum mechanics as a special case. This again shows that a much more general and abstract access to these quantum mechanical features is possible than commonly thought. A non-classical extension of conditional probability and, particularly, a very special type of state-independent conditional probability are used instead of Hilbert spaces and wavefunctions.
Similar content being viewed by others
References
Alfsen, E.M., Shultz, F.W.: Geometry of State Spaces of Operator Algebras. Springer, Berlin (2012)
Alfsen, E.M., Shultz, F.W.: State Spaces of Operator Algebras: Basic Theory, Orientations, and C*-Products. Springer, Berlin (2012)
Barnum, H., Barrett, J., Leifer, M., Wilce, A.: Teleportation in general probabilistic theories. Proc. Symp. Appl. Math. 71, 25–48 (2012)
Beltrametti, E.G., Cassinelli, G., Rota, G.C.: The Logic of Quantum Mechanics. Cambridge University Press, Cambridge (1984)
Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, vol. 175, p. 8, Bangalore, India, Dec 1984
Bennett, C.H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels. Phys. Rev. Lett. 70(13), 1895 (1993)
Beran, L.: Orthomodular Lattices. Springer, Berlin (1985)
Brabec, J.: Compatibility in orthomodular posets. Časopis pro pěstování matematiky 104(2), 149–153 (1979)
Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. R. Soc. Lond. A 454(1969), 339–354 (1998)
Deutsch, D.: Quantum theory, the church-turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400(1818), 97–117 (1985)
Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A 439(1907), 553–558 (1992)
Dieks, D.: Communication by EPR devices. Phys. Lett. A 92(6), 271–272 (1982)
Ekert, A.K.: Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 67, 661–663 (1991)
Fritz, T.: On the existence of quantum representations for two dichotomic measurements. J. Math. Phys. 51(5), Journal of Mathematical Physics (2010)
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM (1996)
Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325 (1997)
Kalmbach, G.: Orthomodular Lattices. Academic Press, London (1983)
Lee, C.M., Selby, J.H.: Deriving grover’s lower bound from simple physical principles. New J. Phys. 18(9), 093047 (2016)
Niestegge, G.: Non-Boolean probabilities and quantum measurement. J. Phys. A Math. Gen. 34(30), 6031 (2001)
Niestegge, G.: An approach to quantum mechanics via conditional probabilities. Found. Phys. 38(3), 241–256 (2008)
Niestegge, G.: A representation of quantum measurement in order-unit spaces. Found. Phys. 38(9), 783–795 (2008)
Niestegge, G.: A hierarchy of compatibility and comeasurability levels in quantum logics with unique conditional probabilities. Commun. Theor. Phys. 54(6), 974 (2010)
Niestegge, G.: Conditional probability, three-slit experiments, and the Jordan algebra structure of quantum mechanics. Adv. Math. Phys. (2012). doi:10.1155/2012/156573
Niestegge, G.: A generalized quantum theory. Found. Phys. 44(11), 1216–1229 (2014)
Niestegge, G.: Non-classical conditional probability and the quantum no-cloning theorem. Phys. Scr. 90(9), 095101 (2015)
Niestegge, G.: Quantum key distribution without the wavefunction. Preprint arXiv:1611.02515v1 [quant-ph] (2016)
Pták, P., Pulmannová, S.: Orthomodular Structures as Quantum Logics. Kluwer, Dordrecht (1991)
Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134, IEEE (1994)
Sorkin, R.D.: Quantum mechanics as quantum measure theory. Mod. Phys. Lett. A 9(33), 3119–3127 (1994)
Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802–803 (1982)
Author information
Authors and Affiliations
Corresponding author
Annex
Annex
Lemma 5
Suppose that the quantum logic E satisfies the Assumptions 1, 2 and 3 and that \(\mathbb {P}(f|e) = p = \mathbb {P}(e|f)\) for some \(e,f \in E\). Then, for \(r = 1, 2, 3,\ldots \),
Proof
The first equality follows from the invariance of \(\mathbb {P}(\ |\ )\) under the automorphism \((S_f S_e)^{r}\), which is its own inverse. For the proof of the second equality, consider the following four elements in the order-unit space A: \(b_1 := e\), \(b_2 := f\), \(b_3 := U_{e^{\prime }} f\) and \(b_4 := U_{f^{\prime }} e\). Note that Lemmas 2(a) and 4 are repeatedly applied in the following calculations. \(S_f S_e b_1 = S_f S_e e = S_f e = 2 U_f e + 2 U_{f^{\prime }} e - e = 2 p f + 2 U_{f^{\prime }} e - e = - b_1 + 2 p b_2 + 2 b_4\)
Then use the identity \(S_e f = 2 U_e f + 2 U_{e^{\prime }} f - f = 2 p e + 2 U_{e^{\prime }} f - f\) to get
The linear subspace in A, generated by \(b_1, b_2, b_3, b_4\), is invariant under \(S_f S_e\), which follows from the above identities. With respect to this basis, the restriction of \(S_f S_e\) to this subspace is represented by the following matrix:
The Jordan form of this \(4\times 4\)matrix is now computed in two steps, each one basically dealing with the better manageable \(2\times 2\)-matrices. First consider the following matrix \(N_1\)
and its inverse
Then
The Jordan forms of the two \(2 \times 2\) submatrices top left and bottom right can be calculated separately. With
and
the desired Jordan form of M is:
where
and 1 are the eigenvalues of M. This (almost diagonal) matrix can now easily be raised to the r-th power, and \(M^{r}\) can be calculated:
Here, Re(z) [Im(z)] denotes the real [imaginary] part of the complex number z. Since \(\alpha _2\) is the complex conjugate of \(\alpha _1\), it does not anymore appear in this matrix. Note that only the second column is displayed, since only these entries will be used for the following calculation of \(U_e (S_f S_e)^{r} b_2 = U_e (S_f S_e)^{r} f \). The third entry in this column is not needed, since \(U_e b_3 = U_e U_{e^{\prime }} f = 0\). Moreover, recall that \(U_e b_1 = U_e e = e\), \(U_e b_2 = U_e f = p e\) and \(U_e b_4 = U_e U_{f^{\prime }} e= (1 - p)^{2}e\).
Therefore
Since \(\left| \alpha _1 \right| = 1\), \(\alpha _1 = e^{it}\) with \(t = arcsin (4(1-2p)\sqrt{p(1-p)})\). Furthermore, define \(s := arcsin(2\sqrt{p(1-p)}\). Then \(cos(s) = 1-2p \), since \((1-2p)^{2} + (2\sqrt{p(1-p)})^{2} = 1\), and
The second and the third equality follow from the trigonometric identities \(cos(x) + cos(y) = cos(x) cos(y) - sin(x) sin(y)\) and \(sin^{2}(\frac{x}{2}) = \frac{1 - cos(x)}{2}\). The last equality follows from the definitions of s and t and the following identity:
by inserting \(x = p\), which then gives \(s+rt = (4r+2) arcsin(\sqrt{p}) \). This identity can be proved by differentiation with respect to x: The derivative is constantly zero and the function thus constant; checking the function for \(x=0\) yields that it is constantly zero. \(\square \)
Rights and permissions
About this article
Cite this article
Niestegge, G. Quantum Teleportation and Grover’s Algorithm Without the Wavefunction. Found Phys 47, 274–293 (2017). https://doi.org/10.1007/s10701-016-0060-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10701-016-0060-5