Universal Computation with Quantum Fields
arXiv:1910.02833 · doi:10.1007/s11128-020-02811-5
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.
22 pages
References in corpus (8)
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Application of Quantum Annealing to Nurse Scheduling Problem
- Quantum annealing with antiferromagnetic fluctuations
- BQP-completeness of Scattering in Scalar Quantum Field Theory
- Hofstadter's Butterfly in Quantum Geometry
- Relation between quantum fluctuations and the performance enhancement of quantum annealing in a nonstoquastic Hamiltonian
- Hofstadter's Butterfly and Langlands Duality
- Quantum Hall Effect and Langlands Program