Quantum algorithm for Hilbert's tenth problem
From MaRDI portal
Publication:1413772
DOI10.1023/A:1025780028846zbMath1037.81016arXivquant-ph/0110136OpenAlexW2089555907WikidataQ55968648 ScholiaQ55968648MaRDI QIDQ1413772
Publication date: 17 November 2003
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0110136
Related Items (19)
The physical Church thesis as an explanation of the Galileo thesis ⋮ What is the Church-Turing Thesis? ⋮ A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ A broader view on the limitations of information processing and communication by nature ⋮ Methods of geometric control theory for quantum computations ⋮ Geometric methods for construction of quantum gates ⋮ Physical constraints on hypercomputation ⋮ Solving the generalized subset sum problem with a light based device ⋮ Why there is no such discipline as hypercomputation ⋮ A hypercomputational alien ⋮ Computational power of infinite quantum parallelism ⋮ ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS ⋮ Quantum principles and mathematical computability ⋮ Solving the subset-sum problem with a light-based device ⋮ Computational Complexity in Non-Turing Models of Computation ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮ Quantum computing: beyond the limits of conventional computation† ⋮ The Significance of Relativistic Computation for the Philosophy of Mathematics
This page was built for publication: Quantum algorithm for Hilbert's tenth problem
