Open AccessPosted Content
Universal Computation with Quantum Fields
TL;DR: In this paper, a universal quantum computation with particles which cannot occupy the same position simultaneously and are symmetric under exchange of particle labels is proposed, where the associated creation and annihilation operators are neither bosonic nor fermionic.
read more
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 OTOC (out-of-time-order correlator). 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
BQP-completeness of Scattering in Scalar Quantum Field Theory | NIST
TL;DR: In this article, it was shown that the problem of estimating the vacuum-to-vacuum transition amplitude in the presence of spacetime-dependent classical sources for a massive scalar field theory in (1+1) dimensions is BQP-hard.
27
•Posted Content
Comments on the Fractal Energy Spectrum of Honeycomb Lattice with Defects
Yoshiyuki Matsuki,Kazuki Ikeda +1 more
TL;DR: In this article, the authors investigated the energy spectrum of a honeycomb lattice with various defects or impurities under a perpendicular magnetic field and showed that the existence of the Hofstadter's butterfly depends on the choice of defect pairs.
3
Diagnosing first- and second-order phase transitions with probes of quantum chaos.
TL;DR: This work explores quantum phase transitions using out-of-time-order correlators (OTOCs) and the r-parameter obtained from the level spacing statistics, finding that the time-averaging OTOCs for the ground state and the average r- parameters change behavior around the corresponding transition points, diagnosing the phase transition.
Snowmass White Paper: Quantum Computing Systems and Software for High-energy Physics Research
Travis S. Humble,Andrea Delgado,Raphael C. Pooser,Christopher M. Seck,Ryan S. Bennink,Vicente Leyton-Ortega,C.-C. Joseph Wang,Eugene F. Dumitrescu,Titus Morris,Kathleen E. Hamilton,Dmitry I. Lyakh,Prasanna Date,Yan Wang,Nicholas A. Peters,Katherine J. Evans,M. Demarteau,Alexander McCaskey,Thiên-Lôc Nguyên,S. K. Clark,Melissa Reville,A. Di Meglio,Michele Grossi,Sofia Vallecorsa,Kerstin Borras,Karl Jansen,D. Kr"ucker +25 more
- 14 Mar 2022
TL;DR: Challenges and opportunities are described for the focused development of algorithms, applications, software, hardware, and infrastructure to support both practical and theoretical applications of quantum computing to HEP problems within the next 10 years.
References
I.—computing machinery and intelligence
TL;DR: I propose to consider the question, “Can machines think?”♣ This should begin with definitions of the meaning of the terms “machine” and “think”.
11.1K
On Computable Numbers, with an Application to the Entscheidungsproblem
TL;DR: This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
•Book
Computing Machinery and Intelligence
A. M. Turing
- 01 Jan 1950
TL;DR: If the meaning of the words “machine” and “think” are to be found by examining how they are commonly used it is difficult to escape the conclusion that the meaning and the answer to the question, “Can machines think?” is to be sought in a statistical survey such as a Gallup poll.
Quantum theory, the Church-Turing principle and the universal quantum computer
TL;DR: In this paper, it is argued that underlying the Church-Turing hypothesis there is an implicit physical assertion: every finitely realizable physical system can be perfectly simulated by a universal model computing machine operating by finite means.
Energy levels and wave functions of Bloch electrons in rational and irrational magnetic fields
TL;DR: In this paper, an effective single-band Hamiltonian representing a crystal electron in a uniform magnetic field is constructed from the tight-binding form of a Bloch band by replacing the operator of the Schr\"odinger equation with a matrix method, and the graph of the spectrum over a wide range of "rational" fields is plotted.
3.8K