Related papers: Quantum Turing automata
We introduce a construction that turns a category of pure state spaces and operators into a category of observable algebras and superoperators. For example, it turns the category of finite-dimensional Hilbert spaces into the category of…
Invariant-based inverse engineering is an elegant approach to quantum control with corresponding experimental implementations that perform tasks with applications in quantum information processing such as shuttling trapped ions. We build on…
One-dimensional unitary scattering controlled by non-Hermitian (typically, ${\cal PT}$-symmetric) quantum Hamiltonians $H\neq H^\dagger$ is considered. Treating these operators via Runge-Kutta approximation, our three-Hilbert-space…
By adapting Feynman's sum over paths method to a quantum mechanical system whose phase space is a torus, a new proof of the Landsberg-Schaar identity for quadratic Gauss sums is given. In contrast to existing non-elementary proofs, which…
We consider the geometrization of quantum mechanics. We then focus on the pull-back of the Fubini-Study metric tensor field from the projective Hibert space to the orbits of the local unitary groups. An inner product on these tensor fields…
The Moore-Penrose algorithm provides a generalized notion of an inverse, applicable to degenerate matrices. In this paper, we introduce a covariant extension of the Moore-Penrose method that permits to deal with general relativity involving…
This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus…
We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept…
Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite ($*$-finite) number of bits while keeping the finite…
Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and…
Supersymmetric quantum mechanical models are computed by the Path integral approach. In the $\beta\rightarrow0$ limit, the integrals localize to the zero modes. This allows us to perform the index computations exactly because of…
Time-reversal (TR) symmetry is crucial for understanding a wide range of physical phenomena, and plays a key role in constraining fundamental particle interactions and in classifying phases of quantum matter. In this work, we introduce an…
The halt scheme for quantum Turing machines, originally proposed by Deutsch, is reformulated precisely and is proved to work without spoiling the computation. The ``conflict'' pointed out recently by Myers in the definition of a universal…
Quantum systems with real energies generated by an apparently non-Hermitian Hamiltonian may re-acquire the consistent probabilistic interpretation via an ad hoc metric which specifies the set of observables in the updated Hilbert space of…
The geometrical description of a Hilbert space asociated with a quantum system considers a Hermitian tensor to describe the scalar inner product of vectors which are now described by vector fields. The real part of this tensor represents a…
In our model a fixed Hamiltonian acts on the joint Hilbert space of a quantum system and its controller. We show under which conditions measurements, state preparations, and unitary implementations on the system can be performed by quantum…
By means of techniques from the Morita equivalence theory, we get finitely generated and projective modules over the quantum Heisenberg manifolds. This enables us to get some information about the range of the trace of these algebras, at…
A representation of finite-dimensional probabilistic models in terms of formally real Jordan algebras is obtained, in a strikingly easy way, from simple assumptions. This provides a framework in which real, complex and quaternionic quantum…
Machine learning is a fascinating and exciting field within computer science. Recently, this excitement has been transferred to the quantum information realm. Currently, all proposals for the quantum version of machine learning utilize the…
It is not currently known if quantum Turing machines can efficiently simulate probabilistic computations in the space-bounded case. In this paper we show that space-bounded quantum Turing machines can efficiently simulate a limited class of…