Results 1  10
of
37
A practical architecture for reliable quantum computers
 IEEE Computer
, 2002
"... Quantum computers offer the prospect of computation that scales exponentially with data size. Unfortunately, a single bit error can corrupt an exponential amount of data. Quantum mechanics can seem more suited to science fiction than system engineering, yet small quantum devices of 5 to 7 bits have ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
Quantum computers offer the prospect of computation that scales exponentially with data size. Unfortunately, a single bit error can corrupt an exponential amount of data. Quantum mechanics can seem more suited to science fiction than system engineering, yet small quantum devices of 5 to 7 bits have nevertheless been built in the laboratory, 1,2 100bit devices are on the drawing table now, and emerging quantum technologies promise even greater scalability. 3,4 More importantly, improvements in quantum errorcorrection codes have established a threshold theorem, 5 according to which scalable quantum computers can be built from faulty components as
An introduction to measurement based quantum computation, ArXiv: quantph/0508124
, 2005
"... In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement o ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the socalled cluster model or oneway quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms. 1
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 17 (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.
TemperleyLieb Algebra: From Knot Theory to . . .
"... Our aim in this paper is to trace some of the surprising and beautiful connections which are beginning to emerge between a number of apparently disparate topics. ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Our aim in this paper is to trace some of the surprising and beautiful connections which are beginning to emerge between a number of apparently disparate topics.
Quantum informationflow, concretely, abstractly
 PROC. QPL 2004
, 2004
"... These ‘lecture notes ’ are based on joint work with Samson Abramsky. I will survey and informally discuss the results of [3, 4, 5, 12, 13] in a pedestrian not too technical way. These include: • ‘The logic of entanglement’, that is, the identification and abstract axiomatization of the ‘quantum info ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
These ‘lecture notes ’ are based on joint work with Samson Abramsky. I will survey and informally discuss the results of [3, 4, 5, 12, 13] in a pedestrian not too technical way. These include: • ‘The logic of entanglement’, that is, the identification and abstract axiomatization of the ‘quantum informationflow ’ which enables protocols such as quantum teleportation. 1 To this means we defined strongly compact closed categories which abstractly capture the behavioral properties of quantum entanglement. • ‘Postulates for an abstract quantum formalism ’ in which classical informationflow (e.g. token exchange) is part of the formalism. As an example, we provided a purely formal description of quantum teleportation and proved correctness in abstract generality. 2 In this formalism types reflect kinds, contra the essentially typeless von Neumann formalism [25]. Hence even concretely this formalism manifestly improves on the usual one. • ‘A highlevel approach to quantum informatics’. 3 Indeed, the above discussed work can be conceived as aiming to solve: von Neumann quantum formalism � highlevel language lowlevel language. I also provide a brief discussion on how classical and quantum uncertainty can be mixed in the above formalism (cf. density matrices). 4
Generalized Flow and Determinism in Measurementbased Quantum Computation
 New J. Physics
, 2007
"... Abstract. We extend the notion of quantum information flow defined by Danos and Kashefi [1] for the oneway model [2] and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the (X, ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Abstract. We extend the notion of quantum information flow defined by Danos and Kashefi [1] for the oneway model [2] and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the (X, Y), (X, Z) and (Y, Z) planes. We apply both measurement calculus and the stabiliser formalism to derive our main theorem which for the first time gives a full characterization of the deterministic computation in the oneway model. We present several examples to show how our result improves over the traditional notion of flow, such as geometries (entanglement graph with input and output) with no flow but having generalized flow and we discuss how they lead to an optimal implementation of the unitaries. More importantly one can also obtain a better quantum computation depth with the generalized flow rather than with flow. We believe our characterization result is particularly essential for the study of the algorithms and complexity in the oneway model. Generalized Flow and Determinism 2 1.
Kindergarten quantum mechanics — lecture notes
 In: Quantum Theory: Reconsiderations of the Foundations III
, 2005
"... Abstract. These lecture notes survey some joint work with Samson Abramsky as it was presented by me at several conferences in the summer of 2005. It concerns ‘doing quantum mechanics using only pictures of lines, squares, triangles and diamonds’. This picture calculus can be seen as a very substanti ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Abstract. These lecture notes survey some joint work with Samson Abramsky as it was presented by me at several conferences in the summer of 2005. It concerns ‘doing quantum mechanics using only pictures of lines, squares, triangles and diamonds’. This picture calculus can be seen as a very substantial extension of Dirac’s notation, and has a purely algebraic counterpart in terms of socalled Strongly Compact Closed Categories (introduced by Abramsky and I in [3, 4]) which subsumes my Logic of Entanglement [11]. For a survey on the ‘what’, the ‘why ’ and the ‘hows ’ I refer to a previous set of lecture notes [12, 13]. In a last section we provide some pointers to the body of technical literature on the subject.
Teleportation topology
 Optics and Spectroscopy
, 2005
"... The paper discusses teleportation in the context of comparing quantum and topological points of view. 1 ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
The paper discusses teleportation in the context of comparing quantum and topological points of view. 1