Results 1  10
of
18
An evaluation framework and instruction set architecture for iontrap based quantum microarchitectures
 In Proc. 32nd Annual International Symposium on Computer Architecture
, 2005
"... The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical implementation technology has progressed steadily. However, almost no work has yet been done which explores the architectu ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
(Show Context)
The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical implementation technology has progressed steadily. However, almost no work has yet been done which explores the architecture design space of large scale quantum computing systems. In this paper, we present a set of tools that enable the quantitative evaluation of architectures for quantum computers. The infrastructure we created comprises a complete compilation and simulation system for computers containing thousands of quantum bits. We begin by compiling complete algorithms into a quantum instruction set. This ISA enables the simple manipulation of quantum state. Another tool we developed automatically transforms quantum software into an equivalent, faulttolerant version required to operate on real quantum devices. Next, our infrastructure transforms the ISA into a set of lowlevel micro architecture specific control operations. In the future, these operations can be used to directly control a quantum computer. For now, our simulation framework quickly uses them to determine the reliability of the application for the target micro architecture. Finally, we propose a simple, regular architecture for iontrap based quantum computers. Using our software infrastructure, we evaluate the design trade offs of this micro architecture. 1
Quantum computing and the Jones polynomial
 math.QA/0105255, in Quantum Computation and Information
"... This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss the evaluati ..."
Abstract

Cited by 18 (11 self)
 Add to MetaCart
(Show Context)
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the evaluation can be construed as a quantum computation when the braiding representation is unitary. The question of an efficient quantum algorithm for computing the whole polynomial remains open. 1
Quantum Topology and Quantum Computing
"... This paper is a quick introduction to key relationships between the theories of knots,links, threemanifold invariants and the structure of quantum mechanics. In section 2 we review the basic ideas and principles of quantum mechanics. Section 3 shows how the idea of a quantum amplitude is applied to ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
This paper is a quick introduction to key relationships between the theories of knots,links, threemanifold invariants and the structure of quantum mechanics. In section 2 we review the basic ideas and principles of quantum mechanics. Section 3 shows how the idea of a quantum amplitude is applied to the construction of invariants of knots and links. Section 4 explains how the generalisation of the Feynman integral to quantum fields leads to invariants of knots, links and threemanifolds. Section 5 is a discussion of a general categorical approach to these issues. Section 6 is a brief discussion of the relationships of quantum topology to quantum computing. This paper is intended as an introduction that can serve as a springboard for working on the interface between quantum topology and quantum computing. Section 7 summarizes the paper.
Microsoft Visual Studio. Version DotNet. http://msdn.microsoft.com/vstudio
 Computing in Science and Engineering
, 2002
"... The theory of computational complexity has some interesting links to physics, in particular to quantum computing and statistical mechanics. This article contains an informal introduction to this theory and its links to physics. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The theory of computational complexity has some interesting links to physics, in particular to quantum computing and statistical mechanics. This article contains an informal introduction to this theory and its links to physics.
Quantum speedup of Monte Carlo methods
, 2015
"... Monte Carlo methods use random sampling to estimate numerical quantities which are hard to compute deterministically. One important example is the use in statistical physics of rapidly mixing Markov chains to approximately compute partition functions. In this work we describe a quantum algorithm whi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Monte Carlo methods use random sampling to estimate numerical quantities which are hard to compute deterministically. One important example is the use in statistical physics of rapidly mixing Markov chains to approximately compute partition functions. In this work we describe a quantum algorithm which can accelerate Monte Carlo methods in a very general setting. The algorithm estimates the expected output value of an arbitrary randomised or quantum subroutine with bounded variance, achieving a nearquadratic speedup over the best possible classical algorithm. Combining the algorithm with the use of quantum walks gives a quantum speedup of the fastest known classical algorithms with rigorous performance bounds for computing partition functions, which use multiplestage Markov chain Monte Carlo techniques. The quantum algorithm can also be used to estimate the total variation distance between probability distributions efficiently. 1
Geophysical Prospecting, 2006, 54, 491503
, 2005
"... A new type of seismic imaging, based on Feynman path integrals for waveform modelling, is capable of producing accurate subsurface images without any need for a reference velocity model. Instead of the usual optimization for traveltime curves with maximal signal semblance, a weighted summation over ..."
Abstract
 Add to MetaCart
A new type of seismic imaging, based on Feynman path integrals for waveform modelling, is capable of producing accurate subsurface images without any need for a reference velocity model. Instead of the usual optimization for traveltime curves with maximal signal semblance, a weighted summation over all representative curves avoids the need for velocity analysis, with its common difficulties of subjective and timeconsuming manual picking. The summation over all curves includes the stationary one that plays a preferential role in classical imaging schemes, but also multiple stationary curves when they exist. Moreover, the weighted summation over all curves also accounts for nonuniqueness and uncertainty in the stacking/migration velocities. The pathintegral imaging can be applied to stacking to zerooffset and to time and depth migration. In all these cases, a properly defined weighting function plays a vital role: to emphasize contributions from traveltime curves close to the optimal one and to suppress contributions from unrealistic curves. The pathintegral method is an authentic macromodelindependent technique in the sense that there is strictly no parameter optimization or estimation involved. Development is still in its initial stage, and several conceptual and implementation issues are yet to be solved. However, application to synthetic and real data examples shows that it has the potential for becoming a fully automatic imaging technique.
When Abandoned Bits Bite Back  Reversibility and Quantum Computing
, 2002
"... Reversible logic was originally proposed as a way to build classical computers with very low energy requirements. Its greatest impact so far has in fact been on the field of quantum computing, where it is used pervasively  but for an entirely different purpose. Quantum interference effects offe ..."
Abstract
 Add to MetaCart
Reversible logic was originally proposed as a way to build classical computers with very low energy requirements. Its greatest impact so far has in fact been on the field of quantum computing, where it is used pervasively  but for an entirely different purpose. Quantum interference effects offer the potential for speeding up certain classical calculations. But if state information is expelled from a quantum computer into the unmodeled environment  as happens whenever an irreversible operation is performed  then it becomes impossible to predict or control when interference will occur. Reversibility is necessary because it allows bits to be erased by uncomputing them rather than simply expelling them, preserving control over interference effects.
Contemporary Mathematics Quantum Computing and the Jones Polynomial
"... Abstract. This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss th ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the evaluation can be construed as a quantum computation when the braiding representation is unitary. The question of an efficient quantum algorithm for computing the whole polynomial remains