Results 1  10
of
64
Quantum circuits with mixed states
 in Proc. 30th STOC
, 1998
"... Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally with several central issues: measurements in the middle of the computation; decoherence and noise, using probabilistic subrout ..."
Abstract

Cited by 111 (11 self)
 Add to MetaCart
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally with several central issues: measurements in the middle of the computation; decoherence and noise, using probabilistic subroutines, and more. It turns out, that the restriction to unitary gates and pure states is unnecessary. In this paper we generalize the formal model of quantum circuits to a model in which the state can be a general quantum state, namely a mixed state, or a “density matrix”, and the gates can be general quantum operations, not necessarily unitary. The new model is shown to be equivalent in computational power to the standard one, and the problems mentioned above essentially disappear. The main result in this paper is a solution for the subroutine problem. The general function that a quantum circuit outputs is a probabilistic function. However, the question of using probabilistic functions as subroutines was not previously dealt with, the reason being that in the language of pure states, this simply can not be done. We define a natural notion of using general subroutines, and show that using general subroutines does not strengthen the model. As an example of the advantages of analyzing quantum complexity using density matrices, we prove a simple lower bound on depth of circuits that compute probabilistic functions. Finally, we deal with the question of inaccurate quantum computation with mixed states. Using the so called “trace metric ” on density matrices, we show how to keep track of errors in the new model.
Toward An Architecture For Quantum Programming
, 2003
"... It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of classical and quantum computation. This paper investigates ..."
Abstract

Cited by 41 (0 self)
 Add to MetaCart
It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of classical and quantum computation. This paper investigates a possible approach to the problem of programming such machines: a template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives.
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 21 (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
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 18 (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
Quantum Computation
 In Annual Review of Computational Physics VI, D. Stauffer, Ed., World Scientific
, 1999
"... In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically powerful computational tool, capable of performing tasks which seem ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically powerful computational tool, capable of performing tasks which seem intractable for classical computers. This review is about to tell the story of theoretical quantum computation. I left out the developing topic of experimental realizations of the model, and neglected other closely related topics which are quantum information and quantum communication. As a result of narrowing the scope of this paper, I hope it has gained the benefit of being an almost self contained introduction to the exciting field of quantum computation. The review begins with background on theoretical computer science, Turing machines and Boolean circuits. In light of these models, I define quantum computers, and discuss the issue of universal quantum gates. Quantum algorithms, including Shor’s factorization algorithm and Grover’s algorithm for searching databases, are explained. I will devote much attention to understanding what the origins of the quantum computational power are, and what the limits of this power are. Finally, I describe the recent theoretical results which show that quantum computers maintain their complexity power even in the presence of noise, inaccuracies and finite precision. This question cannot be separated from that of quantum complexity, because any realistic model will inevitably be subject to such inaccuracies. I tried to put all results in their context, asking what the implications to other issues in computer science and physics are. In the end of this review I make these connections explicit, discussing the possible implications of quantum computation on fundamental physical questions, such as the transition from quantum to classical physics. 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.
Faulttolerant quantum computation for local nonmarkovian noise
 Phys. Rev. A
, 2005
"... We derive a threshold result for faulttolerant quantum computation for local nonMarkovian noise models. The role of error amplitude in our analysis is played by the product of the elementary gate time t0 and the spectral width of the interaction Hamiltonian between system and bath. We discuss exte ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We derive a threshold result for faulttolerant quantum computation for local nonMarkovian noise models. The role of error amplitude in our analysis is played by the product of the elementary gate time t0 and the spectral width of the interaction Hamiltonian between system and bath. We discuss extensions of our model and the applicability of our analysis for several physical decoherence processes. 1
A simple proof that Toffoli and Hadamard are quantum universal
 IN QUANTPH/0301040
, 2003
"... Recently Shi [15] proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a ’classical ’ set of gates quantum universal. In this note ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Recently Shi [15] proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a ’classical ’ set of gates quantum universal. In this note we give a few lines proof of this fact relying on Kitaev’s universal set of gates [11], and discuss the meaning of the result.