相关论文: Nondeterministic Recursion with Quantum Units (I-V…
This paper analyzes infinitary nondeterministic computability theory. The main result is D $\ne$ ND $\cap$ coND where D is the class of sets decidable by infinite time Turing machines and ND is the class of sets recognizable by a…
Nondeterministic choice is a useful program construct that provides a way to describe the behaviour of a program without specifying the details of possible implementations. It supports the stepwise refinement of programs, a method that has…
For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with the components of deterministic Turing machines, the time evolution…
Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and experiments. The description of quantum computers is under active…
We outline the construction of a molecular system that could, in principle, implement a thermodynamically reversible Universal Turing Machine (UTM). By proposing a concrete-albeit idealised-design and operational protocol, we reveal…
In this paper, we show how the non-holonomic control technique can be employed to build completely controlled quantum devices. Examples of such controlled structures are provided.
We propose a deterministic implementation of weak cubic nonlinearity, which is a basic building block of a full scale CV quantum computation. Our proposal relies on preparation of a specific ancillary state and transferring its nonlinear…
This paper investigates a variety of unconventional quantum computation devices, including fermionic quantum computers and computers that exploit nonlinear quantum mechanics. It is shown that unconventional quantum computing devices can in…
The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some…
The structure of covariant instruments is studied and a general structure theorem is derived. A detailed characterization is given to covariant instruments in the case of an irreducible representation of a locally compact group.
Recently, among experiments for realization of quantum computers, NMR quantum computers have achieved the most impressive succession. There is a model of the NMR quantum computation,namely Atsumi and Nishino's bulk quantum Turing Machine.…
Turing computability is the standard computability paradigm which captures the computational power of digital computers. To understand whether one can create physically realistic devices which have super-Turing power, one needs to…
We analyze the possibility and efficiency of non-holonomic control over quantum devices with exponentially large number of Hilbert space dimensions. We show that completely controllable devices of this type can be assembled from elementary…
Some fundamental aspects related with the construction of Robertson-Schr\"odinger like uncertainty principle inequalities are reported in order to provide an overall description of quantumness, separability and nonlocality of quantum…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…
This note is about encoding Turing machines into the lambda-calculus.
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact,…
In this paper, the space complexity of nonuniform quantum computations is investigated. The model chosen for this are quantum branching programs, which provide a graphic description of sequential quantum algorithms. In the first part of the…
Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparation and the measurement of quantum Turing machines is discussed. The local transition functions are characterized for fully general quantum…