Results 11  20
of
50
On the identification of the ground state based on occupation probabilities: An investigation of Smith’s apparent counterexample
 Journal of Applied Mathematics and Computation
, 2005
"... Abstract. We study a set of truncated matrices, given by Smith [8], in connection to an identification criterion for the ground state in our proposed quantum adiabatic algorithm for Hilbert’s tenth problem. We identify the origin of the trouble for this truncated example and show that for a suitable ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. We study a set of truncated matrices, given by Smith [8], in connection to an identification criterion for the ground state in our proposed quantum adiabatic algorithm for Hilbert’s tenth problem. We identify the origin of the trouble for this truncated example and show that for a suitable choice of some parameter it can always be removed. We also argue that it is only an artefact of the truncation of the underlying Hilbert spaces, through showing its sensitivity to different boundary conditions available for such a truncation. It is maintained that the criterion, in general, should be applicable provided certain conditions are satisfied. We also point out that, apart from this one, other criteria serving the same identification purpose may also be available. In a proposal of a quantum adiabatic algorithm for Hilbert’s tenth problem [5], we employ an adiabatic process with a timedependent Hamiltonian (1) H(t) = (1 − t/T)HI + (t/T)HP. Here t is time and this Hamiltonian metamorphoses from HI when t = 0 to HP when t = T. The final Hamiltonian HP encodes the Diophantine equation in consideration, while the initial HI is universal and independent of the Diophantine equation, except only on its number of variables K. The process is captured by the Schrödinger equation (2) ∂tψ(t)〉
Reply to “the quantum algorithm of Kieu does not solve the Hilbert’s tenth problem”. Archive preprint http://arxiv.org/abs/quantph/0111020
, 2001
"... The arguments employed in quantph/0111009, to claim that the quantum algorithm in quantph/0110136 does not work, are so general that were they true then the adiabatic theorem itself would have been wrong. As a matter of fact, those arguments are only valid for the sudden approximation, not the adi ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The arguments employed in quantph/0111009, to claim that the quantum algorithm in quantph/0110136 does not work, are so general that were they true then the adiabatic theorem itself would have been wrong. As a matter of fact, those arguments are only valid for the sudden approximation, not the adiabatic process. The author of [1] carefully distinguishes between the general groundstate oracle from the algorithm which explicitly employs the adiabatic evolution, both proposed for the Hilbert’s tenth problem in [2]. Then it is concluded that this latter quantum algorithm is untenable. However, the arguments employed to reach this conclusion is so general. They are apparently applicable not only to the quantum algorithm but also to any adiabatic process. Were they true then the adiabatic theorem would have been wrong. In the below we examine the crucial steps in the arguments and point out their shortcoming. We follow the notations of [1] and just pick up at the crucial inequality (the unnumbered, last inequality of the paper) ‖g(T) 〉 − g0(T)〉 ‖ ≤ T ‖HP gI〉‖. (1) where g(T) 〉 is the end state arrived at some time T in a supposedly adiabatic process which starts with the initial state gI 〉 and ends with the hamiltonian HP. The state g0(T) 〉 is constructed so that it only differs from the initial state gI 〉 by a Tdependent phase factor. Then from the fact that lim xmin→ ∞ ‖HP gI〉 ‖ = lim xmin→ ∞ 〈xmingI〉  = 0 (2) (where xmin 〉 is the soughtafter state, contained in HP), it was concluded that the left hand side of (1) can be vanishingly small and thus that g(T) 〉 can never be closed to xmin〉
Towards a theory of intelligence
 Theoretical Computer Science
"... In 1950, Turing suggested that intelligent behavior might require “a departure from the completely disciplined behaviour involved in computation”, but nothing that a digital computer could not do. In this paper, I want to explore Turing’s suggestion by asking what it is, beyond computation, that int ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In 1950, Turing suggested that intelligent behavior might require “a departure from the completely disciplined behaviour involved in computation”, but nothing that a digital computer could not do. In this paper, I want to explore Turing’s suggestion by asking what it is, beyond computation, that intelligence might require, why it might require it and what knowing the answers to the first two questions might do to help us understand artificial and natural intelligence.
On the existence of truly autonomic computing systems and the link with quantum computing, arXiv: cs.LO/0411094
"... A theoretical model of truly autonomic computing systems (ACS), with infinitely many constraints, is proposed. An argument similar to Turing’s for the unsolvability of the halting problem, which is permitted in classical logic, shows that such systems cannot exist. Turing’s argument fails in the rec ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
A theoretical model of truly autonomic computing systems (ACS), with infinitely many constraints, is proposed. An argument similar to Turing’s for the unsolvability of the halting problem, which is permitted in classical logic, shows that such systems cannot exist. Turing’s argument fails in the recently proposed nonAristotelian finitary logic (NAFL), which permits the existence of ACS. NAFL also justifies quantum superposition and entanglement, which are essential ingredients of quantum algorithms, and resolves the EinsteinPodolskyRosen (EPR) paradox in favour of quantum mechanics and nonlocality. NAFL requires that the autonomic manager (AM) must be conceptually and architecturally distinct from the managed element, in order for the ACS to exist as a nonselfreferential entity. Such a scenario is possible if the AM uses quantum algorithms and is protected from all problems by (unbreakable) quantum encryption, while the managed element remains classical. NAFL supports such a link between autonomic and quantum computing, with the AM existing as a metamathematical entity. NAFL also allows quantum algorithms to access truly random elements and thereby supports nonstandard models of quantum (hyper) computation that permit infinite parallelism. 1.
2005 A possible hypercomputational quantum algorithm Quantum
 SPIE) Proc. SPIE 5815 219–26
, 2005
"... The term ‘hypermachine ’ denotes any data processing device (theoretical or that can be implemented) capable of carrying out tasks that cannot be performed by a Turing machine. We present a possible quantum algorithm for a classically noncomputable decision problem, Hilbert’s tenth problem; more sp ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
The term ‘hypermachine ’ denotes any data processing device (theoretical or that can be implemented) capable of carrying out tasks that cannot be performed by a Turing machine. We present a possible quantum algorithm for a classically noncomputable decision problem, Hilbert’s tenth problem; more specifically, we present a possible hypercomputation model based on quantum computation. Our algorithm is inspired by the one proposed by Tien D. Kieu, but we have selected the infinite square well instead of the (onedimensional) simple harmonic oscillator as the underlying physical system. Our model exploits the quantum adiabatic process and the characteristics of the representation of the dynamical Lie algebra su(1, 1) associated to the infinite square well.
A Formalization of the ChurchTuring Thesis for StateTransition Models
"... Abstract. Our goal is to formalize the ChurchTuring Thesis for a very large class of computational models. Specifically, the notion of an “effective model of computation ” over an arbitrary countable domain is axiomatized. This is accomplished by modifying Gurevich’s “Abstract State Machine ” postu ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Our goal is to formalize the ChurchTuring Thesis for a very large class of computational models. Specifically, the notion of an “effective model of computation ” over an arbitrary countable domain is axiomatized. This is accomplished by modifying Gurevich’s “Abstract State Machine ” postulates for statetransition systems. A proof is provided that all models satisfying our axioms, regardless of underlying data structure—and including all standard statetransition models—are equivalent to (up to isomorphism), or weaker than, Turing machines. To allow the comparison of arbitrary models operating over arbitrary domains, we employ a quasiordering on computational models, based on their extensionality. LCMs can do anything that could be described as “rule of thumb ” or “purely mechanical”.... This is sufficiently well established that it is now agreed amongst logicians that “calculable by means of an LCM” is the correct accurate rendering of such phrases. 1
Physicallyrelativized ChurchTuring Hypotheses. Applied Mathematics and Computation 215, 4
 in the School of Mathematics at the University of Leeds, U.K. © 2012 ACM 00010782/12/03 $10.00 march 2012  vol. 55  no. 3  communications of the acm 83
"... Abstract. We turn ‘the ’ ChurchTuring Hypothesis from an ambiguous source of sensational speculations into a (collection of) sound and welldefined scientific problem(s): Examining recent controversies, and causes for misunderstanding, concerning the state of the ChurchTuring Hypothesis (CTH), sug ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We turn ‘the ’ ChurchTuring Hypothesis from an ambiguous source of sensational speculations into a (collection of) sound and welldefined scientific problem(s): Examining recent controversies, and causes for misunderstanding, concerning the state of the ChurchTuring Hypothesis (CTH), suggests to study the CTH relative to an arbitrary but specific physical theory—rather than vaguely referring to “nature ” in general. To this end we combine (and compare) physical structuralism with (models of computation in) complexity theory. The benefit of this formal framework is illustrated by reporting on some previous, and giving one new, example result(s) of computability
Constraints on Hypercomputation, in
 Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, CiE 2006
, 2006
"... “To infinity, and beyond!”, Buzz Lightyear, Toy Story, Pixar, 1995. Many attempts to transcend the fundamental limitations to computability implied by the Halting Problem for Turing Machines depend on the use of forms of hypercomputation that draw on notions of infinite or continuous, as opposed to ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
“To infinity, and beyond!”, Buzz Lightyear, Toy Story, Pixar, 1995. Many attempts to transcend the fundamental limitations to computability implied by the Halting Problem for Turing Machines depend on the use of forms of hypercomputation that draw on notions of infinite or continuous, as opposed to bounded or discrete, computation. Thus, such schemes may include the deployment of actualised rather than potential infinities of physical resources, or of physical representations of real numbers to arbitrary precision. Here, we argue that such bases for hypercomputation are not materially realisable and so cannot constitute new forms of effective calculability. 1
Five views of hypercomputation
"... We overview different approaches to the study of hypercomputation and other investigations on the plausibility of the physical Church–Turing thesis. We propose five thesis to classify investigation in this area. Sly does it. Tiptoe catspaws. Slide and creep. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We overview different approaches to the study of hypercomputation and other investigations on the plausibility of the physical Church–Turing thesis. We propose five thesis to classify investigation in this area. Sly does it. Tiptoe catspaws. Slide and creep.