A bstract Black hole event horizons and cosmological event horizons share many properties, making it natural to ask whether our recent advances in understanding black holes generalize to cosmology. To this end, we discuss a paradox that occurs if observers can access what lies beyond their cosmological horizon in the same way that they can access what lies beyond a black hole horizon. In particular, distinct observers with distinct horizons may encode the same portion of spacetime, violating the no-cloning theorem of quantum mechanics. This paradox is due precisely to the observer-dependence of the cosmological horizon — the sharpest difference from a black hole horizon — although we will argue that the gravity path integral avoids the paradox in controlled examples.
more »
« less
Quantum erasing the memory of Wigner's friend
The Wigner's friend paradox concerns one of the most puzzling problems of quantum mechanics: the consistent description of multiple nested observers. Recently, a variation of Wigner's gedankenexperiment, introduced by Frauchiger and Renner, has lead to new debates about the self-consistency of quantum mechanics. At the core of the paradox lies the description of an observer and the object it measures as a closed system obeying the Schrödinger equation. We revisit this assumption to derive a necessary condition on a quantum system to behave as an observer. We then propose a simple single-photon interferometric setup implementing Frauchiger and Renner's scenario, and use the derived condition to shed a new light on the assumptions leading to their paradox. From our description, we argue that the three apparently incompatible properties used to question the consistency of quantum mechanics correspond to two logically distinct contexts: either one assumes that Wigner has full control over his friends' lab, or conversely that some parts of the labs remain unaffected by Wigner's subsequent measurements. The first context may be seen as the quantum erasure of the memory of Wigner's friend. We further show these properties are associated with observables which do not commute, and therefore cannot take well-defined values simultaneously. Consequently, the three contradictory properties never hold simultaneously.
more »
« less
- Award ID(s):
- 1809343
- PAR ID:
- 10299786
- Date Published:
- Journal Name:
- Quantum
- Volume:
- 5
- ISSN:
- 2521-327X
- Page Range / eLocation ID:
- 498
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Quantum reference frames are expected to differ from classical reference frames because they have to implement typical quantum features such as fluctuations and correlations. Here, we show that fluctuations and correlations of reference variables, in particular of time, are restricted by their very nature of being used for reference. Mathematically, this property is implemented by imposing constraints on the system to make sure that reference variables are not physical degrees of freedom. These constraints not only relate physical degrees of freedom to reference variables in order to describe their behavior, they also restrict quantum fluctuations of reference variables and their correlations with system degrees of freedom. We introduce the notion of “almost-positive” states as a suitable mathematical method. An explicit application of their properties to examples of recent interest in quantum reference frames reveals previously unrecognized restrictions on possible frame–system interactions. While currently discussed clock models rely on assumptions that, as shown here, make them consistent as quantum reference frames, relaxing these assumptions will expose the models to new restrictions that appear to be rather strong. Almost-positive states also shed some light on a recent debate about the consistency of relational quantum mechanics.more » « less
-
null (Ed.)We present a new method of automatic critical mechanic discovery for video games using a combination of game description parsing and playtrace information. This method is applied to several games within the General Video Game Artificial Intelligence (GVG-AI) framework. In a user study, human-identified mechanics are compared against system-identified critical mechanics to verify alignment between humans and the system. The results of the study demonstrate that the new method is able to match humans with higher consistency than baseline. Our system is further validated by comparing MCTS agents augmented with critical mechanics and vanilla MCTS agents on 4 games from GVG-AI. Our new playtrace method shows a significant performance improvement over the baseline for all 4 tested games. The proposed method also shows either matched or improved performance over the old method, demonstrating that playtrace information is responsible for more complete critical mechanic discovery.more » « less
-
null (Ed.)We review the Montevideo Interpretation of quantum mechanics, which is based on the use of real clocks to describe physics, using the framework that was recently introduced by Höhn, Smith, and Lock to treat the problem of time in generally covariant systems. These new methods, which solve several problems in the introduction of a notion of time in such systems, do not change the main results of the Montevideo Interpretation. The use of the new formalism makes the construction more general and valid for any system in a quantum generally covariant theory. We find that, as in the original formulation, a fundamental mechanism of decoherence emerges that allows for supplementing ordinary environmental decoherence and avoiding its criticisms. The recent results on quantum complexity provide additional support to the type of global protocols that are used to prove that within ordinary—unitary—quantum mechanics, no definite event—an outcome to which a probability can be associated—occurs. In lieu of this, states that start in a coherent superposition of possible outcomes always remain as a superposition. We show that, if one takes into account fundamental inescapable uncertainties in measuring length and time intervals due to general relativity and quantum mechanics, the previously mentioned global protocols no longer allow for distinguishing whether the state is in a superposition or not. One is left with a formulation of quantum mechanics purely defined in quantum mechanical terms without any reference to the classical world and with an intrinsic operational definition of quantum events that does not need external observers.more » « less
-
We give two new quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with m constraint matrices, each of dimension n, rank at most r, and sparsity s. The first algorithm assumes an input model where one is given access to an oracle to the entries of the matrices at unit cost. We show that it has run time O~(s^2 (sqrt{m} epsilon^{-10} + sqrt{n} epsilon^{-12})), with epsilon the error of the solution. This gives an optimal dependence in terms of m, n and quadratic improvement over previous quantum algorithms (when m ~~ n). The second algorithm assumes a fully quantum input model in which the input matrices are given as quantum states. We show that its run time is O~(sqrt{m}+poly(r))*poly(log m,log n,B,epsilon^{-1}), with B an upper bound on the trace-norm of all input matrices. In particular the complexity depends only polylogarithmically in n and polynomially in r. We apply the second SDP solver to learn a good description of a quantum state with respect to a set of measurements: Given m measurements and a supply of copies of an unknown state rho with rank at most r, we show we can find in time sqrt{m}*poly(log m,log n,r,epsilon^{-1}) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as rho on the m measurements, up to error epsilon. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes' principle from statistical mechanics. As in previous work, we obtain our algorithm by "quantizing" classical SDP solvers based on the matrix multiplicative weight update method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians, given quantum states encoding these Hamiltonians, with a poly-logarithmic dependence on its dimension, which is based on ideas developed in quantum principal component analysis. We also develop a "fast" quantum OR lemma with a quadratic improvement in gate complexity over the construction of Harrow et al. [Harrow et al., 2017]. We believe both techniques might be of independent interest.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.22331/q-2021-07-08-498
