Related papers: Models of Quantum Turing machines
This work concerns a study of the quantum mechanical extension of the work of Horwitz et al. [1] on the stability of classical Hamiltonian systems by geometrical methods. Simulations are carried out for several important examples, these…
Finite-dimensional Quantum Mechanics can be geometrically formulated as a proper classical-like Hamiltonian theory in a projective Hilbert space. The description of composite quantum systems within the geometric Hamiltonian framework is…
Recent works have independently suggested that Quantum Mechanics might permit for procedures that transcend the power of Turing Machines as well as of `standard' Quantum Computers. These approaches rely on and indicate that Quantum…
We pursue the view that quantum theory may be an emergent structure related to large space-time scales. In particular, we consider classical Hamiltonian systems in which the intrinsic proper time evolution parameter is related through a…
Traditional economic growth theories, grounded in deterministic and often linear frameworks, fail to adequately capture the inherent uncertainty, non-commutativity, and complex interdependencies of modern economies. This paper proposes a…
Nonadiabatic dynamical processes are one of the most important quantum mechanical phenomena in chemical, materials, biological, and environmental molecular systems, where the coupling between different electronic states is either inherent…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
In this paper we analyze the ground state phase diagram of a class of fermionic Hamiltonians by looking at the fidelity of ground states corresponding to slightly different Hamiltonian parameters. The Hamiltonians under investigation can be…
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…
We start with the consideration of fusion rules of anyonic particles evolving on a 2D surface and the a hypergroup comes with it to construct entangled quantum Markov chains. The fusion rules induce an association scheme with Krein…
In the foreseeable future, toolchains for quantum computing should offer automatic means of transforming a high level problem formulation down to a hardware executable form. Thereby, it is crucial to find (multiple) transformation paths…
The generating function of a Hamiltonian $H$ is defined as $F(t)=\langle e^{-itH}\rangle$, where $t$ is the time and where the expectation value is taken on a given initial quantum state. This function gives access to the different moments…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
We define some of the programming and system-level challenges facing the application of quantum processing to high-performance computing. Alongside barriers to physical integration, prominent differences in the execution of quantum and…
Recently 't Hooft demonstrated that ``For any quantum system there exists at least one deterministic model that reproduces all its dynamics after prequantization''. An extension is presented here which covers quantum systems that are…
It is shown that the standard formulation of quantum mechanics in terms of Hermitian Hamiltonians is overly restrictive. A consistent physical theory of quantum mechanics can be built on a complex Hamiltonian that is not Hermitian but…
Interest in combinatorial interpretations of mathematical entities stems from the convenience of the concrete models they provide. Finding a bijective proof of a seemingly obscure identity can reveal unsuspected significance to it. Finding…
Quantum geometry on a discrete set means a directed graph with a weight associated to each arrow defining the quantum metric. However, these `lattice spacing' weights do not have to be independent of the direction of the arrow. We use this…
Hamiltonian encoding was introduced as a technique for revealing the mechanism of controlled quantum systems. It does so by decomposing the evolution into pathways between the computational basis states, where each pathway has an associated…
In the past four decades, the notion of quantum polynomial-time computability has been mathematically modeled by quantum Turing machines as well as quantum circuits. This paper seeks the third model, which is a quantum analogue of the…