Results 1  10
of
17
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 24 (1 self)
 Add to MetaCart
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 10 (7 self)
 Add to MetaCart
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 6 (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 2 (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 Grammars
, 2008
"... We consider quantum (unitary) continuous time evolution of spins on a lattice together with quantum evolution of the lattice itself. In physics such evolution was discussed in connection with quantum gravity. It is also related to what is called quantum circuits, one of the incarnations of a quantum ..."
Abstract
 Add to MetaCart
We consider quantum (unitary) continuous time evolution of spins on a lattice together with quantum evolution of the lattice itself. In physics such evolution was discussed in connection with quantum gravity. It is also related to what is called quantum circuits, one of the incarnations of a quantum computer. We consider simpler models for which one can obtain exact mathematical results. We prove existence of the dynamics in both Schroedinger and Heisenberg pictures, construct KMS states on appropriate C ∗algebras. We show (for high temperatures) that for each system where the lattice undergoes quantum evolution, there is a natural scaling leading to a quantum spin system on a fixed lattice Z, defined by a renormalized
Brain neurons as quantum computers: in vivo support of background physics
, 2008
"... The question: whether quantum coherent states can sustain decoherence, heating and dissipation over time scales comparable to the dynamical timescales of the brain neurons, is actively discussed in the last years. Positive answer on this question is crucial, in particular, for consideration of brain ..."
Abstract
 Add to MetaCart
The question: whether quantum coherent states can sustain decoherence, heating and dissipation over time scales comparable to the dynamical timescales of the brain neurons, is actively discussed in the last years. Positive answer on this question is crucial, in particular, for consideration of brain neurons as quantum computers. This discussion was mainly based on theoretical arguments. In present paper nonlinear statistical properties of the Ventral Tegmental Area (VTA) of genetically depressive limbic brain are studied in vivo on the Flinders Sensitive Line of rats (FSL). VTA plays a key role in generation of pleasure and in development of psychological drug addiction. We found that the FSL VTA (dopaminergic) neuron signals exhibit multifractal properties for interspike frequencies on the scales where healthy VTA dopaminergic neurons exhibit bursting activity. For high moments the observed multifractal (generalized dimensions) spectrum coincides with the generalized dimensions spectrum calculated for a spectral measure of a quantum system (socalled kicked Harper model, actively used as a model of quantum chaos). This observation can be considered as a first experimental (in vivo) indication in the favour of the quantum (at least partially) nature of the brain neurons activity. PACS. 87.19.La Neuroscience 87.18.Sn Neural networks 87.17.d Cellular structure and processes
The Search for the Quantum ‘SpeedUp’—Between the
, 2006
"... In 1981 Richard Feynman conjectured that any classical simulation of quantum dynamical evolution could only be done inefficiently, incurring an exponential slowdown in the simulation time. This pessimism marked the dawn of quantum computing, a research field which a generation later has become one o ..."
Abstract
 Add to MetaCart
In 1981 Richard Feynman conjectured that any classical simulation of quantum dynamical evolution could only be done inefficiently, incurring an exponential slowdown in the simulation time. This pessimism marked the dawn of quantum computing, a research field which a generation later has become one of the most fascinating domains of quantum mechanics. Today, while experimentalists are struggling with the technologies needed for the construction of a scalable quantum computer, theoreticians are still looking for algorithms that can establish the superiority of quantum computers over their classical counterparts. Embarrassingly, so far only one algorithm has been discovered that is provably more efficient than any known classical algorithm. In this paper I shall offer a possible reason for the lack of efficient quantum algorithms, which stems from the features of quantum mechanics itself. Inconclusive as it is, the skepticism I raise with respect to the putative power of quantum computers serves to elucidate a major interpretative issue in the foundations of quantum mechanics, and may also have constructive implications for the future of quantum algorithms design.
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.