Universal computation with quantum fields
From MaRDI portal
Publication:2681706
DOI10.1007/s11128-020-02811-5OpenAlexW3083392461MaRDI QIDQ2681706
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
Cites Work
- Unnamed Item
- Efficient quantum algorithms for simulating sparse Hamiltonians
- A bound on chaos
- Quantum Hall effect and Langlands program
- Matchgates and classical simulation of quantum circuits
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Simulating quantum systems on a quantum computer
- Hofstadter’s butterfly and Langlands duality
- Realizable Hamiltonians for universal adiabatic quantum computers
- Exact results for fidelity susceptibility of the quantum Ising model: the interplay between parity, system size, and magnetic field
- Level clustering in the regular spectrum
- Characterization of Chaotic Quantum Spectra and Universality of Level Fluctuation Laws
- Hofstadter’s butterfly in quantum geometry
This page was built for publication: Universal computation with quantum fields
