Simulating physics with computers

DOI10.1007/BF02650179MaRDI QIDQ7236018zbMATH OpenFDO

Authors Richard P. Feynman

Publication date 29 April 2026

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02650179

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Mathematical modeling or simulation for problems pertaining to quantum theory (81-10)

Cited in

(15)

• Toward end-to-end quantum simulation of rapidly distorted turbulence
• Classical-quantum state quantum Markov chains and finiteness
• Quantum spatial best-arm identification on a complete bipartite graph
• AMDS codes and quantum AMDS codes of length \(3p^s\) over \(\mathbb{F}_{p^m}\)
• Uniform semiclassical observable error bound of Trotter-Suzuki splitting: a simple algebraic proof
• Advancements in numerical methods for quantum resources
• Aperiodicity in quantum Wang tilings
• Resource-efficient quantum search: a conditional multi-target exact search algorithm for the NISQ era
• Convergence rates for the Trotter splitting for unbounded operators
• Quantum divisive hierarchical clustering based on Manhattan distance
• Securities transaction settlement optimization on superconducting quantum devices
• Nearly optimal circuit size for sparse quantum state preparation
• Spatial entanglement sudden death in spin chains at all temperatures
• Symmetry-protected topology and deconfined solitons in a multi-link \(\mathbb{Z}_2\) gauge theory
• Quantum simulation of the Liouville equation in geometrical optics with partial transmission and reflection via Schrödingerization

This page was built for publication: Simulating physics with computers

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