相关论文: Revisiting Boole Equation in the Quantum Context

The algebraic approach to bundles in non-commutative geometry and the definition of quantum real weighted projective spaces are reviewed. Principal U(1)-bundles over quantum real weighted projective spaces are constructed. As the spaces in…

We consider the quantum computational process as viewed by an insider observer: this is equivalent to an isomorphism between the quantum computer and a quantum space, namely the fuzzy sphere. The result is the formulation of a reversible…

The paper consists of two parts. In the first part Schroedinger's equation for a charged quantum particle in a Galilei-Newton curved space-time is derived in a fully geometrical way. Gravitational and electromagnetic fields are coded into…

Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…

We describe a quantum computer emulator for a generic, general purpose quantum computer. This emulator consists of a simulator of the physical realization of the quantum computer and a graphical user interface to program and control the…

The main aim of this thesis is to look for a logical deductive calculus (we will adopt sequent calculus, originally introduced in Gentzen, 1935), which could describe quantum information and its properties. More precisely, we intended to…

A quantum principal bundle is constructed for every Coxeter group acting on a finite-dimensional Euclidean space $E$, and then a connection is also defined on this bundle. The covariant derivatives associated to this connection are the…

The state function of a quantum object is undetermined with respect to its phase. This indeterminacy does not matter if it is global, but what if the components of the state have unknown relative phases? Can useful computations be performed…

We develop a generalised gauge theory in which the role of gauge group is played by a coalgebra and the role of principal bundle by an algebra. The theory provides a unifying point of view which includes quantum group gauge theory,…

We introduce the notion of quantum computational webs: These are quantum states universal for measurement-based computation which can be built up from a collection of simple primitives. The primitive elements - reminiscent of building…

Quantum game theory offers a lot of interesting questions, and it is relevant to use the quantum information theory to resolve or improve games with lack of information : how to use the power of quantum entanglement to show the superiority…

These notes provide an introduction to standard topics on quantum computation and communication for those who already have a basic knowledge of quantum mechanics. The main target audience are professional physicists as well as advanced…

Quantum computing is usually associated with discrete quantum states and physical quantities possessing discrete eigenvalue spectrum. However, quantum computing in general is any computation accomplished by the exploitation of quantum…

Quantum information is defined by applying the concepts of ordinary (Shannon) information theory to a quantum sample space consisting of a single framework or consistent family. A classical analogy for a spin-half particle and other…

We study the relation between quantum computational complexity and general relativity. The quantum computational complexity is proposed to be quantified by the shortest length of geodesic quantum curves. We examine the complexity/volume…

We present an approach to simulating quantum computation based on a classical model that directly imitates discrete quantum systems. Qubits are represented as harmonic functions in a 2D vector space. Multiplication of qubit representations…

Recent advances in our understanding of foundations of quantum mechanics have shown that information can be made objective through quantum states. Such objectification processes, predicted e.g. in a variety of quantum open systems, must…

A theoretical model of computation is proposed based on Lorentz quantum mechanics. Besides the standard qubits, this model has an additional bit, which we call hyperbolic bit (or hybit in short). A set of basic logical gates are constructed…

We explore the role played by the phase in an accurate description of the entanglement of bipartite systems. We first present an appropriate polar decomposition that leads to a truly Hermitian operator for the phase of a single qubit. We…

Existing abstract models of quantum computation make reference to circuit elements, much in contrast to their classical counterparts. Circuits, as a model of computation, substantially limit algorithmic expression and obscure high-level…