Related papers: Permutational Quantum Computing
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…
We describe in detail a general strategy for implementing a conditional geometric phase between two spins. Combined with single-spin operations, this simple operation is a universal gate for quantum computation, in that any unitary…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…
In this paper, we will present some ideas to use 3D topology for quantum computing. Topological quantum computing in the usual sense works with an encoding of information as knotted quantum states of topological phases of matter, thus being…
We consider an example of a quantum algorithm from the point of view of the de Broglie-Bohm formulation of quantum mechanics. For concreteness we look at two particular implementations: one using spin-1/2 particles as described by a simple…
We interpret quantum computing as a geometric evolution process by reformulating finite quantum systems via Connes' noncommutative geometry. In this formulation, quantum states are represented as noncommutative connections, while gauge…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
This article is an attempt to generalize the classical theory of reversible computing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and by Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum case.…
Systems of spin 1, such as triplet pairs of spin-1/2 fermions (like orthohydrogen nuclei) make useful three-terminal elements for quantum computation, and when interconnected by qubit equality relations are universal for quantum…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
Quantum computation is one of the most promising new paradigms for the simulation of physical systems composed of electrons and atomic nuclei, with applications in chemistry, solid-state physics, materials science, and molecular biology.…
Quantum computation is a promising emerging technology which, compared to conventional computation, allows for substantial speed-ups e.g. for integer factorization or database search. However, since physical realizations of quantum…
Using a quantumlike description for light propagation in nonhomogeneous optical fibers, quantum information processing can be implemented by optical means. Quantum-like bits (qulbits) are associated to light modes in the optical fiber and…
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering,…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
Quantum algorithms provide a potential strategy for solving computational problems that are intractable by classical means. Computing the topological invariants of topological matter is one central problem in research on quantum materials,…
Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…