Universal computation with quantum fields
- PDF / 3,559,431 Bytes
- 21 Pages / 439.37 x 666.142 pts Page_size
- 56 Downloads / 189 Views
Universal computation with quantum fields Kazuki Ikeda1 Received: 3 February 2020 / Accepted: 11 August 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract We explore a way of universal quantum computation with particles which cannot occupy the same position simultaneously and are symmetric under exchange of particle labels. Therefore the associated creation and annihilation operators are neither bosonic nor fermionic. In this work we first show universality of our method and numerically address several examples. We demonstrate dynamics of a Bloch electron system from a viewpoint of adiabatic quantum computation. In addition we provide a novel Majorana fermion system and analyze phase transitions with spin-coherent states and the time average of the out-of-time-order correlator (OTOC). We report that a first-order phase transition is avoided when it evolves in a non-stoquastic manner and the time average of the OTOC diagnoses the phase transitions successfully. Keywords Quantum annealing · Majorana fermion · Information scrambling · Quantum chaos · OTOC · Quantum simulation
1 Yet another imitation game Physics is a study on the computational principles of nature and on the algorithms implemented by an as-yet-unknown way. Future developments in quantum devises will help us explore many body systems. Technically there are two ways to simulate quantum physical dynamics of particles with quantum computers. An orthodox one is to prepare circuits exactly like the way real things work. The second is to create circuits so that the desired outcomes should be obtained. Physicists prefer the former idea and want to fingerprint their models or to find novel physical aspects which may be testable by experiments. Programmers prefer the latter. Instead of going to tiny theoretical details, they feel happy as long as their programs work without bugs. Programmers are unlikely to find new physics, but could find efficient ways to reproduce precise results. Some of the key criteria for accepting a theoretical model of physics are
B 1
Kazuki Ikeda [email protected] Department of Physics, Osaka University, Toyonaka, Osaka 560-0043, Japan 0123456789().: V,-vol
123
331
Page 2 of 21
K. Ikeda
whether its descriptions and predictions are consistent with experimental results. We now ask the question, “Can a technically valid algorithm be scientifically sound?” An algorithm which is capable of accurately reproducing results would have a chance of predicting phenomena in a way that they seem consistent with experiment, even if real things do not actually obey it. The new form of the problem can be described in terms of the “imitation game [1].” It is played with three people, an experimental physicist (A), a programmer (B), and an interrogator (C) who is a theoretical physicist and know them by labels X and Y . Suppose both of A and B have sufficient skills in their own fields, but may be less familiar with the other fields. The experimenter is allowed to use any experimental device and material, and
Data Loading...
