Results 1  10
of
129
Topological quantum computation
 Bull. Amer. Math. Soc. (N.S
"... Abstract. The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in WittenChernSimons theory. The braiding and fusion of anyonic excitations ..."
Abstract

Cited by 109 (14 self)
 Add to MetaCart
Abstract. The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in WittenChernSimons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liquids and 2Dmagnets are modeled by modular functors, opening a new possibility for the realization of quantum computers. The chief advantage of anyonic computation would be physical error correction: An error rate scaling like e−αℓ, where ℓ is a length scale, and α is some positive constant. In contrast, the “presumptive ” qubitmodel of quantum computation, which repairs errors combinatorically, requires a fantastically low initial error rate (about 10−4) before computation can be stabilized. Quantum computation is a catchall for several models of computation based on a theoretical ability to manufacture, manipulate and measure quantum states. In this context, there are three areas where remarkable algorithms have been found: searching a data base [15], abelian groups (factoring and discrete logarithm) [19],
A modular functor which is universal for quantum computation
 Comm. Math. Phys
"... Abstract: We show that the topological modular functor from Witten–Chern–Simons theory is universal for quantum computation in the sense that a quantum circuit computation can be efficiently approximated by an intertwining action of a braid on the functor’s state space. A computational model based o ..."
Abstract

Cited by 87 (17 self)
 Add to MetaCart
Abstract: We show that the topological modular functor from Witten–Chern–Simons theory is universal for quantum computation in the sense that a quantum circuit computation can be efficiently approximated by an intertwining action of a braid on the functor’s state space. A computational model based on Chern–Simons theory at a fifth root of unity is defined and shown to be polynomially equivalent to the quantum circuit model. The chief technical advance: the density of the irreducible sectors of the Jones representation has topological implications which will be considered elsewhere. 1.
Anyons in an exactly solved model and beyond
, 2005
"... A spin 1/2 system on a honeycomb lattice is studied. The interactions between nearest neighbors are of XX, YY or ZZ type, depending on the direction of the link; different types of interactions may differ in strength. The model is solved exactly by a reduction to free fermions in a static Z2 gauge f ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
A spin 1/2 system on a honeycomb lattice is studied. The interactions between nearest neighbors are of XX, YY or ZZ type, depending on the direction of the link; different types of interactions may differ in strength. The model is solved exactly by a reduction to free fermions in a static Z2 gauge field. A phase diagram in the parameter space is obtained. One of the phases has an energy gap and carries excitations that are Abelian anyons. The other phase is gapless, but acquires a gap in the presence of magnetic field. In the latter case excitations are nonAbelian anyons whose braiding rules coincide with those of conformal blocks for the Ising model. We also consider a general theory of free fermions with a gapped spectrum, which is characterized by a spectral Chern number ν. The Abelian and nonAbelian phases of the original model correspond to ν = 0 and ν = ±1, respectively. The anyonic properties of excitation depend on ν mod 16, whereas ν itself governs edge thermal transport. The paper also provides mathematical background on anyons as well as an elementary theory of Chern number for quasidiagonal matrices.
CRYSTALLINE COMPUTATION
 CHAPTER 18 OF FEYNMAN AND COMPUTATION (A. HEY, ED.)
, 1999
"... Discrete lattice systems have had a long and productive history in physics. Examples range from exact theoretical models studied in statistical mechanics to approximate numerical treatments of continuum models. There has, however, been relatively little attention paid to exact lattice models which o ..."
Abstract

Cited by 28 (7 self)
 Add to MetaCart
Discrete lattice systems have had a long and productive history in physics. Examples range from exact theoretical models studied in statistical mechanics to approximate numerical treatments of continuum models. There has, however, been relatively little attention paid to exact lattice models which obey an invertible dynamics: from any state of the dynamical system you can infer the previous state. This kind of microscopic reversibility is an important property of all microscopic physical dynamics. Invertible lattice systems become even more physically realistic if we impose locality of interaction and exact conservation laws. In fact, some invertible and momentum conserving lattice dynamics—in which discrete particles hop between neighboring lattice sites at discrete times—accurately reproduce hydrodynamics in the macroscopic limit. These kinds of discrete systems not only provide an intriguing informationdynamics approach to modeling macroscopic physics, but they may also be supremely practical. Exactly the same properties that make these models physically realistic also make them efficiently realizable. Algorithms that incorporate constraints such as locality of interaction and invertibility can be run on microscopic physical hardware that shares these constraints. Such hardware can, in principle, achieve a higher density and rate of computation than any other kind of computer. Thus it is interesting to construct discrete lattice dynamics which are more physicslike both in order to capture more of the richness of physical dynamics in informational models, and in order to improve our ability to harness physics for computation. In this chapter, we discuss techniques for bringing discrete lattice dynamics closer to physics, and some of the interesting consequences of doing so.
On universal and faulttolerant quantum computing: a novel basis and a new constructive proof of universality for Shor’s basis
 In Proceedings of the 40th Annual Symposium on Foundations of Computer Science
, 1999
"... A novel universal and faulttolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two singlequbit gates 1 (Hadamard and σz 4), and one doublequbit gate (ControlledNOT). ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
A novel universal and faulttolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two singlequbit gates 1 (Hadamard and σz 4), and one doublequbit gate (ControlledNOT). Since the set consisting of ControlledNOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of π) singlequbit gate, and hence, is potentially the simplest universal basis that one can construct. We also provide an alternative proof of universality for the only other known class of universal and faulttolerant basis proposed in [25, 17]. 1
Building quantum wires: the long and the short of it
 In Proc. International Symposium on Computer Architecture (ISCA 2003
, 2003
"... As quantum computing moves closer to reality the need for basic architectural studies becomes more pressing. Quantum wires, which transport quantum data, will be a fundamental component in all anticipated silicon quantum architectures. In this paper, we introduce a quantum wire architecture based up ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
As quantum computing moves closer to reality the need for basic architectural studies becomes more pressing. Quantum wires, which transport quantum data, will be a fundamental component in all anticipated silicon quantum architectures. In this paper, we introduce a quantum wire architecture based upon quantum teleportation. We compare this teleportation channel with the traditional approach to transporting quantum data, which we refer to as the swapping channel. We characterize the latency and bandwidth of these two alternatives in a deviceindependent way and describe how the advanced architecture of the teleportation channel overcomes a basic limit to the maximum communication distance of the swapping channel. In addition, we discover a fundamental tension between the scale of quantum effects and the scale of the classical logic needed to control them. This “pitchmatching ” problem imposes constraints on minimum wire lengths and wire intersections, which in turn imply a sparsely connected architecture of coarsegrained quantum computational elements. This is in direct contrast to the “sea of gates ” architectures presently assumed by most quantum computing studies. 1
Efficient faulttolerant quantum computing
 Nature
, 1999
"... Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible quantum codes are obtained, and good candidates exhibited. This ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible quantum codes are obtained, and good candidates exhibited. This permits a new analysis of the permissible error rates and minimum overheads for robust quantum computing. It is found that, under the standard noise model of ubiquitous stochastic, uncorrelated errors, a quantum computer need be only an order of magnitude larger than the logical machine contained within it in order to be reliable. For example, a scaleup by a factor of 22, with gate error rate of order 10 −5, is sufficient to permit large quantum algorithms such as factorization of thousanddigit numbers.
Architectural implications of quantum computing technologies
 ACM Journal on Emerging Technologies in Computing Systems (JETC
, 2006
"... In this article we present a classification scheme for quantum computing technologies that is based on the characteristics most relevant to computer systems architecture. The engineering tradeoffs of execution speed, decoherence of the quantum states, and size of systems are described. Concurrency, ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
In this article we present a classification scheme for quantum computing technologies that is based on the characteristics most relevant to computer systems architecture. The engineering tradeoffs of execution speed, decoherence of the quantum states, and size of systems are described. Concurrency, storage capacity, and interconnection network topology influence algorithmic efficiency, while quantum error correction and necessary quantum state measurement are the ultimate drivers of logical clock speed. We discuss several proposed technologies. Finally, we use our taxonomy to explore architectural implications for common arithmetic circuits, examine the implementation of quantum error correction, and discuss clusterstate quantum computation.