Related papers: Quantum Turing automata
Quantum entanglement does not necessarily imply Einstein-Podolsky-Rosen steering. We identify a \emph{boundary mechanism} that closes this gap when an entangled state meets the boundary of the trusted state space in a nondegenerate way. The…
We define a formal framework for reasoning about linear-time properties of quantum systems in which quantum automata are employed in the modeling of systems and certain closed subspaces of state (Hilbert) spaces are used as the atomic…
A hierarchical, reversible mapping between levels of tree structured computation, applicable for structuring the Quantum Computation algorithm for NP-complete problem is presented. It is proven that confining the state of a quantum computer…
We describe a quantum computer based upon the coherent manipulation of two-level atoms between discrete one-dimensional momentum states. Combinations of short laser pulses with kinetic energy dependent free phase evolution can perform the…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…
A new model of a Quantum Automaton (QA), working with qubits is proposed. The quantum states of the automaton can be pure or mixed and are represented by density operators. This is the appropriated approach to deal with measurements and…
A version of quantum Cram\'{e}r-Rao bound dictates that the covariance of any set of operators is bounded by a product of the derivatives of expectation values and the inverse of quantum metric. We elaborate that because quantum metric…
We define an integral form of shifted quantum affine algebras of type $A$ and construct Poincar\'e-Birkhoff-Witt-Drinfeld bases for them. When the shift is trivial, our integral form coincides with the RTT integral form. We prove that these…
We demonstrate that the task of determining an unknown quantum state can be accomplished efficiently by making a sequential measurement of two observables $\hat{A}$ and $\hat{B}$, provided that the two observables are chosen in such a way…
The method of group quantization described in the preceeding paper I is extended so that it becomes applicable to some parametrized systems that do not admit a global transversal surface. A simple completely solvable toy system is studied…
Bounded self-certification in Turing machines fails because self-simulation necessarily incurs a strictly positive temporal overhead. We translate this operational constraint into a domain-theoretic framework, defining an operator that…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
Geometric quantum computation offers a potential route to fault-tolerant quantum information processing by exploiting the global nature of geometric phases. However, achieving controlled high-order suppression of multiple error sources…
There exist several graphical languages for quantum information processing, like quantum circuits, ZX-Calculus, ZW-Calculus, etc. Each of these languages forms a dagger-symmetric monoidal category (dagger-SMC) and comes with an…
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
It is first pointed out that there is a common mathematical model for the universe and the quantum computer. The former is called the histories approach to quantum mechanics and the latter is called measurement based quantum computation.…
We define quantum automorphism groups of a wide range of discrete structures. The central tool for their construction is a generalisation of the Tannaka-Krein reconstruction theorem. For any direct sum of matrix algebras $M$, and any…
An input-output model of a two-level quantum system in the Heisenberg picture is of bilinear form with constant system matrices, which allows the introduction of the concepts of controllability and observability in analogy with those of…
We here put forward a new path-integral over Hilbert space and show that it reproduces quantum mechanics exactly. This approach works by optimizing the generating functional under a variation of the final state; it is hence an example of a…