16
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Fast-forwarding of Hamiltonians and exponentially precise measurements

      research-article
      ,
      Nature Communications
      Nature Publishing Group UK

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The time-energy uncertainty relation (TEUR) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta {\it{t}}\Delta {\it{E}}\,{\bf{ \ge }}\,{\textstyle{{\bf{1}} \over {\bf{2}}}}$$\end{document} holds if the Hamiltonian is completely unknown, but can be violated otherwise; here we initiate a rigorous study describing when and to what extent such violations can occur. To this end, we propose a computational version of the TEUR (cTEUR), in which Δ t is replaced by the computational complexity of simulating the measurement. cTEUR violations are proved to occur if and only if the Hamiltonian can be fast forwarded (FF), namely, simulated for time t with complexity significantly smaller than t. Shor’s algorithm provides an example of exponential cTEUR violations; we show that so do commuting local Hamiltonians and quadratic fermion Hamiltonians. A general FF method is ruled out, but finding further examples, as well as experimental demonstrations, are left for future work. We discuss possible connections to sensing and quantum gravity. This work initiates a rigorous theory of efficiency versus accuracy in energy measurements using computational complexity language.

          Abstract

          A complete theory of when and to what extent time-energy uncertainty relation violations can occur is lacking. Here, the authors set the ground for a rigorous theory to investigate this possibility.

          Related collections

          Most cited references29

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

          Many body localization and thermalization in quantum statistical mechanics

          We review some recent developments in the statistical mechanics of isolated quantum systems. We provide a brief introduction to quantum thermalization, paying particular attention to the `Eigenstate Thermalization Hypothesis' (ETH), and the resulting `single-eigenstate statistical mechanics'. We then focus on a class of systems which fail to quantum thermalize and whose eigenstates violate the ETH: These are the many-body Anderson localized systems; their long-time properties are not captured by the conventional ensembles of quantum statistical mechanics. These systems can locally remember forever information about their local initial conditions, and are thus of interest for possibilities of storing quantum information. We discuss key features of many-body localization (MBL), and review a phenomenology of the MBL phase. Single-eigenstate statistical mechanics within the MBL phase reveals dynamically-stable ordered phases, and phase transitions among them, that are invisible to equilibrium statistical mechanics and can occur at high energy and low spatial dimensionality where equilibrium ordering is forbidden.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Quantum Computation and Decision Trees

            Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root. We devise a quantum mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy succeeds in reaching level n in time polynomial in n, then so does the quantum algorithm. Moreover, we find examples of trees for which the classical algorithm requires time exponential in n, but for which the quantum algorithm succeeds in polynomial time. The examples we have so far, however, could also be solved in polynomial time by different classical algorithms.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Super-resolving phase measurements with a multi-photon entangled state

              Using a linear optical elements and post-selection, we construct an entangled polarization state of three photons in the same spatial mode. This state is analogous to a ``photon-number path entangled state'' and can be used for super-resolving interferometry. Measuring a birefringent phase shift, we demonstrate two- and three-fold improvements in phase resolution.
                Bookmark

                Author and article information

                Contributors
                g.yosiat@gmail.com
                Journal
                Nat Commun
                Nat Commun
                Nature Communications
                Nature Publishing Group UK (London )
                2041-1723
                17 November 2017
                17 November 2017
                2017
                : 8
                : 1572
                Affiliations
                ISNI 0000 0004 1937 0538, GRID grid.9619.7, School of Computer Science and Engineering, , The Hebrew University of Jerusalem, The Edmond J. Safra Campus, ; 9190416 Jerusalem, Israel
                Article
                1637
                10.1038/s41467-017-01637-7
                5691059
                29146981
                3cf982a3-4014-45a9-ae6e-32044b575036
                © The Author(s) 2017

                Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.

                History
                : 16 July 2017
                : 5 October 2017
                Categories
                Article
                Custom metadata
                © The Author(s) 2017

                Uncategorized
                Uncategorized

                Comments

                Comment on this article