A mathematical proof for a ground-state identification criterion
Tien D. Kieu
TL;DR
This paper provides a rigorous mathematical proof for a criterion that identifies the ground state in quantum algorithms solving Hilbert's tenth problem, applicable to both infinite and finite state scenarios.
Contribution
It introduces a formal proof for a ground-state identification criterion in quantum adiabatic algorithms addressing Hilbert's tenth problem.
Findings
Proof of a ground-state identification criterion
Applicable to infinite and finite state models
Enhances understanding of quantum adiabatic algorithms
Abstract
We give a mathematical proof for an identification criterion by a probability measure for the ground state among an infinite number of available states, or a finitely truncated number with appropriate boundary conditions, in a quantum adiabatic algorithm for Hilbert's tenth problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRadiation Detection and Scintillator Technologies · Target Tracking and Data Fusion in Sensor Networks · Fault Detection and Control Systems