Universal computation with quantum fields

DOI10.1007/S11128-020-02811-5MaRDI QIDQ2681706zbMATH OpenOpenAlexFDO

Authors Kazuki Ikeda

Publication date 3 February 2023

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.02833

zbMATH Keywords

information scramblingMajorana fermionOTOCquantum annealingquantum chaosquantum simulation

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Fermionic quantum computation
• The power of noisy fermionic quantum computation
• Universal computation by multiparticle quantum walk
• Universal quantum computation with metaplectic anyons
• Quantum computation based on particle statistics

Cites work

• A bound on chaos
• Characterization of Chaotic Quantum Spectra and Universality of Level Fluctuation Laws
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Exact results for fidelity susceptibility of the quantum Ising model: the interplay between parity, system size, and magnetic field
• Hofstadter's butterfly and Langlands duality
• Hofstadter's butterfly in quantum geometry
• Level clustering in the regular spectrum
• Matchgates and classical simulation of quantum circuits
• Quantum Hall effect and Langlands program
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Realizable Hamiltonians for universal adiabatic quantum computers
• Simulating quantum systems on a quantum computer
• The complexity of stoquastic local Hamiltonian problems

Cited in

(3)

• scientific article; zbMATH DE number 5931426 (Why is no real title available?)
• The power of noisy fermionic quantum computation
• Quantum computation of phase transition in interacting scalar quantum field theory

This page was built for publication: Universal computation with quantum fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2681706)