World Library  
Flag as Inappropriate
Email this Article

Quantum mechanics of time travel

Article Id: WHEBN0030366747
Reproduction Date:

Title: Quantum mechanics of time travel  
Author: World Heritage Encyclopedia
Language: English
Subject: Time travel, Misner space, Rudolph Fentz, BTZ black hole, Moberly–Jourdain incident
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Quantum mechanics of time travel

Until recently, most studies on time travel are based upon classical general relativity. Coming up with a quantum version of time travel requires us to figure out the time evolution equations for density states in the presence of closed timelike curves (CTC).

Novikov[1] had conjectured that once quantum mechanics is taken into account, self-consistent solutions always exist for all time machine configurations, and initial conditions. However, it has been noted such solutions are not unique in general, in violation of determinism, unitarity and linearity.

The application of self-consistency to quantum mechanical time machines has taken two main routes. Novikov's rule applied to the density matrix itself gives the Deutsch prescription. Applied instead to the state vector, the same rule gives nonunitary physics with a dual description in terms of post-selection.

Deutsch's prescription

In 1991, David Deutsch[2] came up with a proposal for the time evolution equations, with special note as to how it resolves the grandfather paradox and nondeterminism. However, his resolution to the grandfather paradox is considered unsatisfactory to some people, because it states the time traveller reenters another parallel universe, and that the actual quantum state is a quantum superposition of states where the time traveller does and does not exist.

He made the simplifying assumption that we can split the quantum system into a subsystem A external to the closed timelike curve, and a CTC part. Also, he assumed that we can combine all the time evolution between the exterior and the CTC into a single unitary operator U. This presupposes the Schrödinger picture. We have a tensor product for the combined state of both systems. He makes the further assumption there is no correlation between the initial density state of A and the density state of the CTC. This assumption is not time-symmetric, which he tried to justify by appealing to measurement theory and the second law of thermodynamics. He proposed that the density state restricted to the CTC is a fixed-point of

\rho_{\text{CTC}} = \text{Tr}_A \left[ U \left( \rho_A \otimes \rho_{\text{CTC}} \right) U^\dagger\right].

He showed that such fixed points always exist. He justified this choice by noting the expectation value of any CTC observable will match after a loop. However, this could lead to "multivalued" histories if memory is preserved around the loop. In particular, his prescription is incompatible with path integrals unless we allow for multivalued fields. Another point to note is in general, we have more than one fixed point, and this leads to nondeterminism in the time evolution. He suggested the solution to use is the one with the maximum entropy. The final external state is given by \text{Tr}_{\text{CTC}} \left[ U \left( \rho_A \otimes \rho_{\text{CTC}} \right) U^\dagger\right]. Pure states can evolve into mixed states.

This leads to seemingly paradoxical resolutions to the grandfather paradox. Assume the external subsystem is irrelevant, and only a qubit travels in the CTC. Also assume during the course around the time machine, the value of the qubit is flipped according to the unitary operator

U = \begin{pmatrix}0 & 1\\1 & 0\end{pmatrix}.

The most general fixed-point solution is given by

\rho_{\text{CTC}} = \begin{pmatrix}\frac{1}{2} & a\\a & \frac{1}{2}\end{pmatrix}

where a is a real number between -1/2 and 1/2. This is an example of the nonuniqueness of solutions. The solution maximizing the von Neumann entropy is given by a=0. We can think of this as a mixture (not superposition) between the states \left( \left| 0 \right\rangle + \left| 1 \right\rangle \right)/\sqrt{2} and \left( \left| 0 \right\rangle - \left| 1 \right\rangle \right)/\sqrt{2}. This leads to an interesting interpretation that if the qubit starts off with a value of 0, it will end up with a value of 1, and vice versa, but this should not be problematic according to Deutsch because the qubit ends up in a different parallel universe in the many worlds interpretation.

Later researchers have noted that if his prescription turned out to be right, computers in the vicinity of a time machine can solve PSPACE-complete problems.[3]

Lloyd's prescription

An alternative proposal was later presented by Seth Lloyd[4][5] based upon post-selection and path integrals. In particular, the path integral is over single-valued fields, leading to self-consistent histories. He assumed it is ill-defined to speak of the actual density state of the CTC itself, and we should only focus upon the density state outside the CTC. His proposal for the time evolution of the external density state is

\rho_f = \frac{C\rho_i C^\dagger}{\text{Tr}\left[ C\rho_i C^\dagger\right]}, where C = \text{Tr}_{\text{CTC}}\left[ U \right].

If \text{Tr}\left[ C\rho_i C^\dagger\right]=0, no solution exists due to destructive interference in the path integral. For instance, the grandfather paradox has no solution, and leads to an inconsistent state. If a solution exists, it is clearly unique. Now, quantum computers using time machines can only solve PP-complete problems.

Entropy and computation

The same description of CTC physics was derived independently in 2001 by Michael Devin, and applied to thermodynamics.[6][7] The same model with the introduction of a noise term allowing for inexact periodicity, allows the grandfather paradox to be resolved, and clarifies the computational power of a time machine assisted computer. Each time traveling qubit has an associated negentropy, given approximately by the logarithm of the noise of the communication channel. Each use of the time machine can be used to extract as much work from a thermal bath. In a brute force search for a randomly generated password, the entropy of the unknown string can be effectively reduced by a similar amount. Because the negentropy and computational power diverge as the noise term goes to zero, complexity class may not be the best way to describe the capabilities of time machines.

Nonlinear time evolution

Bennett[8] et al. have pointed some of the problems which arise when unitarity breaks down and quantum evolution becomes nonlinear.

See also

References

  1. ^
  2. ^
  3. ^
  4. ^
  5. ^
  6. ^
  7. ^
  8. ^
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.