Related papers: Halting in quantum Turing computation
The question of the termination of a periodic spatial structure of Turing type in a growing system is addressed in a chemical engineering perspective and a biomimetic approach. The effects of the dynamical parameters on the stability and…
In this paper we briefly define distance vector routing algorithms, their advantages and possible drawbacks. On these possible drawbacks, currently widely used methods split horizon and poisoned reverse are defined and compared. The count…
Quantum computing is presently undergoing rapid development to achieve a significant speedup promised in certain applications. Nonetheless, scaling quantum computers remains a formidable engineering challenge, prompting exploration of…
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both…
In this note we point out the fact that the proper conceptual setting of quantum computation is the theory of Linear Time Invariant systems. To convince readers of the utility of the approach, we introduce a new model of computation based…
We demonstrate how quantum field theory problems can be embedded on quantum annealers. The general method we use is a discretisation of the field theory problem into a general Ising model, with the continuous field values being encoded into…
An integrable anharmonic oscillator is presumably simulable by a classical computer and therefore by a quantum computer. An integrable anharmonic oscillator whose Hamiltonian is of normal type and quartic in the canonical coordinates is not…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
In this paper are discussed some formal properties of quantum devices necessary for implementation of nondeterministic Turing machine.
Quantum computers, if fully realized, promise to be a revolutionary technology. As a result, quantum computing has become one of the hottest areas of research in the last few years. Much effort is being applied at all levels of the system…
Foundations of the notion of quantum Turing machines are investigated. According to Deutsch's formulation, the time evolution of a quantum Turing machine is to be determined by the local transition function. In this paper, the local…
The paper reviews positive and negative time delays in various processes of classical and quantum physics. In the beginning, we demonstrate how a time-shifted response of a system to an external perturbation appears in classical mechanics…
The puzzling properties of quantum mechanics, wave-particle duality, entanglement and superposition, were dissected experimentally at past decades. However, hidden-variable (HV) models, based on three classical assumptions of wave-particle…
The concept and the formalization of the arrival time in quantum mechanics are discussed. Different approaches based on trajectories, quantization rules, time operators, phase space techniques, renewal equations or operational procedures…
The Halting Problem is a version of the Liar's Paradox.
Multiway Turing machines (also known as nondeterministic Turing machines or NDTMs) with explicit, simple rules are studied. Even very simple rules are found to generate complex behavior, characterized by complex multiway graphs, that can be…
The general principle for a quantum signature scheme is proposed and investigated based on ideas from classical signature schemes and quantum cryptography. The suggested algorithm is implemented by a symmetrical quantum key cryptosystem and…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
We study the shuttling instability in an array of three quantum dots the central one of which is movable. We extend the results by Armour and MacKinnon on this problem to a broader parameter regime. The results obtained by an efficient…
We clarify the confusion, misunderstanding and misconception that the physical finiteness of the universe, if the universe is indeed finite, would rule out all hypercomputation, the kind of computation that exceeds the Turing computability,…