Perfect State Distinguishability and Computational Speedups with Postselected Closed Timelike Curves
 Todd A. Brun,
 Mark M. Wilde
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Bennett and Schumacher’s postselected quantum teleportation is a model of closed timelike curves (CTCs) that leads to results physically different from Deutsch’s model. We show that even a single qubit passing through a postselected CTC (PCTC) is sufficient to do any postselected quantum measurement with certainty, and we discuss an important difference between “Deutschian” CTCs (DCTCs) and PCTCs in which the future existence of a PCTC might affect the present outcome of an experiment. Then, based on a suggestion of Bennett and Smith, we explicitly show how a party assisted by PCTCs can distinguish a set of linearly independent quantum states, and we prove that it is not possible for such a party to distinguish a set of linearly dependent states. The power of PCTCs is thus weaker than that of DCTCs because the Holevo bound still applies to circuits using them, regardless of their ability to conspire in violating the uncertainty principle. We then discuss how different notions of a quantum mixture that are indistinguishable in linear quantum mechanics lead to dramatically differing conclusions in a nonlinear quantum mechanics involving PCTCs. Finally, we give explicit circuit constructions that can efficiently factor integers, efficiently solve any decision problem in the intersection of NP and coNP, and probabilistically solve any decision problem in NP. These circuits accomplish these tasks with just one qubit traveling back in time, and they exploit the ability of postselected closed timelike curves to create grandfather paradoxes for invalid answers.
 Gödel, K. (1949) An example of a new type of cosmological solutions of Einstein’s field equations of gravitation. Rev. Mod. Phys. 21: pp. 447450 CrossRef
 Bonnor, W.B. (1980) The rigidly rotating relativistic dust cylinder. J. Phys. A, Math. Gen. 13: pp. 2121 CrossRef
 Gott, J.R. (1991) Closed timelike curves produced by pairs of moving cosmic strings: Exact solutions. Phys. Rev. Lett. 66: pp. 11261129 CrossRef
 Hartle, J.B. (1994) Unitarity and causality in generalized quantum mechanics for nonchronal spacetimes. Phys. Rev. D, Part. Fields 49: pp. 65436555 CrossRef
 Morris, M.S., Thorne, K.S., Yurtsever, U. (1988) Wormholes, time machines, and the weak energy condition. Phys. Rev. Lett. 61: pp. 14461449 CrossRef
 Deutsch, D. (1991) Quantum mechanics near closed timelike lines. Phys. Rev. D, Part. Fields 44: pp. 31973217 CrossRef
 Bacon, D. (2004) Quantum computational complexity in the presence of closed timelike curves. Phys. Rev. A 70: CrossRef
 Aaronson, S., Watrous, J. (2009) Closed timelike curves make quantum and classical computing equivalent. Proc. R. Soc. A 465: pp. 631647 CrossRef
 Brun, T.A., Harrington, J., Wilde, M.M. (2009) Localized closed timelike curves can perfectly distinguish quantum states. Phys. Rev. Lett. 102: CrossRef
 DeJonghe, R., Frey, K., Imbo, T. (2010) Discontinuous quantum evolutions in the presence of closed timelike curves. Phys. Rev. D, Part. Fields 81: CrossRef
 Pati, A.K., Chakrabarty, I., Agrawal, P.: Purification of mixed state with closed timelike curve is not possible. May 2010. arXiv:1003.4221
 Holevo, A.S. (1973) Bounds for the quantity of information transmitted by a quantum channel. Probl. Inf. Transm. 9: pp. 177183
 Bennett, C.H., Leung, D., Smith, G., Smolin, J.A. (2009) Can closed timelike curves or nonlinear quantum mechanics improve quantum state discrimination or help solve hard problems?. Phys. Rev. Lett. 103: CrossRef
 Bennett, C.H., Leung, D., Smith, G., Smolin, J. (2010) The impotence of nonlinearity: Why closed timelike curves and nonlinear quantum mechanics don’t improve quantum state discrimination, and haven’t been shown to dramatically speed up computation, if computation is defined in a natural, adversarial way. Rump Session Presentation at the 13th Workshop on Quantum Information Processing.
 Ralph, T.C., Myers, C.R.: Information flow of quantum states interacting with closed timelike curves. March 2010. arXiv:1003.1987
 Cavalcanti, E.G., Menicucci, N.C.: Verifiable nonlinear quantum evolution implies failure of density matrices to represent proper mixtures. April 2010. arXiv:1004.1219
 Wallman, J.J., Bartlett, S.D.: Revisiting consistency conditions for quantum states of systems on closed timelike curves: an epistemic perspective. May 2010. arXiv:1005.2438
 Lloyd, S., Maccone, L., GarciaPatron, R., Giovannetti, V., Shikano, Y., Pirandola, S., Rozema, L.A., Darabi, A., Soudagar, Y., Shalm, L.K., Steinberg, A.M.: Closed timelike curves via postselection: theory and experimental demonstration. May 2010. arXiv:1005.2219
 Lloyd, S., Maccone, L., GarciaPatron, R., Giovannetti, V., Shikano, Y.: The quantum mechanics of time travel through postselected teleportation. July 2010. arXiv:1007.2615
 Svetlichny, G.: Effective quantum time travel. February 2009. arXiv:0902.4898
 Bennett, C.H.: Talk at QUPON, Wien. http://www.research.ibm.com/people/b/bennetc/, May 2005
 Bennett, C.H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W.K. (1993) Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels. Phys. Rev. Lett. 70: pp. 18951899 CrossRef
 Aaronson, S. (2005) Quantum computing, postselection, and probabilistic polynomialtime. Proc. R. Soc. A 461: pp. 34733482 CrossRef
 Brun, T.A. (2003) Computers with closed timelike curves can solve hard problems. Found. Phys. Lett. 16: pp. 245253 CrossRef
 Chefles, A. (1998) Unambiguous discrimination between linearly independent quantum states. Phys. Lett. A 239: pp. 339347 CrossRef
 Bennett, C.H. (2009) Private communication. 12th Workshop on Quantum Information Processing.
 Smith, G. (2010) Private communication. International Symposium on Information Theory.
 Horowitz, G.T., Maldacena, J. (2004) The black hole final state. J. High Energy Phys. 2004: CrossRef
 Lloyd, S. (2006) Almost certain escape from black holes in final state projection models. Phys. Rev. Lett. 96: CrossRef
 Nielsen, M.A., Chuang, I.L. (2000) Quantum Computation and Quantum Information. Cambridge University Press, Cambridge
 Bennett, C. (1992) Quantum cryptography using any two nonorthogonal states. Phys. Rev. Lett. 68: pp. 31213124 CrossRef
 Bennett, C., Brassard, G. (1984) Quantum cryptography: Publickey distribution and coin tossing. Proceedings of IEEE International Conference on Computers, Systems and Signal Processing. pp. 175179
 Scarani, V., Acin, A., Ribordy, G., Gisin, N. (2004) Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulse implementations. Phys. Rev. Lett. 92: CrossRef
 d’Espagnat, B. (2006) On Physics and Philosophy. Princeton University Press, Princeton
 Cook, S.A. (1971) The complexity of theorem proving procedures. Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing. pp. 151158
 Title
 Perfect State Distinguishability and Computational Speedups with Postselected Closed Timelike Curves
 Journal

Foundations of Physics
Volume 42, Issue 3 , pp 341361
 Cover Date
 20120301
 DOI
 10.1007/s1070101196010
 Print ISSN
 00159018
 Online ISSN
 15729516
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 Postselected closed timelike curves
 State distinguishability
 Paradoxical computation
 Industry Sectors
 Authors

 Todd A. Brun ^{(1)}
 Mark M. Wilde ^{(2)}
 Author Affiliations

 1. Communication Sciences Institute, University of Southern California, Los Angeles, CA, 90089, USA
 2. School of Computer Science, McGill University, Montreal, Quebec, H3A 2A7, Canada