Results 1  10
of
14
Quantum walks: a comprehensive review
, 2012
"... Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists and engineers. In this paper we review theoretical advances on the foundations of both discrete and continuoustime quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entanglement as well as a succinct review of experimental proposals and realizations of discretetime quantum walks. Furthermore, we have reviewed several algorithms based on both discrete and continuoustime quantum walks as well as a most important result: the computational universality of both continuous and discretetime quantum walks.
Why philosophers should care about computational complexity
 In Computability: Gödel, Turing, Church, and beyond (eds
, 2012
"... One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed casethat onewouldbe wrong. In particular, I arguethat computational complexity theory—the field that ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed casethat onewouldbe wrong. In particular, I arguethat computational complexity theory—the field that studies the resources (such as time, space, and randomness) needed to solve computational problems—leads to new perspectives on the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume’s problem of induction, Goodman’s grue riddle, the foundations of quantum mechanics, economic rationality, closed timelike curves, and several other topics of philosophical interest. I end by discussing
Copenhagen computation
"... This article is dedicated to the memory of Rob Clifton, with whom I had many pleasant and thoughtprovoking conversations and email exchanges over the past dozen years. I describe a pedagogical scheme devised to teach efficiently to computer scientists just enough quantum mechanics to permit them to ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This article is dedicated to the memory of Rob Clifton, with whom I had many pleasant and thoughtprovoking conversations and email exchanges over the past dozen years. I describe a pedagogical scheme devised to teach efficiently to computer scientists just enough quantum mechanics to permit them to understand the theoretical developments of the last decade going under the name of ‘‘quantum computation.’ ’ I then note that my offbeat approach to quantum mechanics, designed to be maximally efficacious for this specific educational purpose, is nothing other than the Copenhagen interpretation.
Quantum computation and quantum information
 International Journal of Parallel, Emergent and Distributed Systems
, 2006
"... The paper is intended to be a survey of all the important aspects and results that have shaped the eld of quantum computation and quantum information. The reader is rst familiarized with those features and principles of quantum mechanics providing a more e cient and secure information processing. Th ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
The paper is intended to be a survey of all the important aspects and results that have shaped the eld of quantum computation and quantum information. The reader is rst familiarized with those features and principles of quantum mechanics providing a more e cient and secure information processing. Their applications to the general theory of information, cryptography, algorithms, computational complexity and errorcorrection are then discussed. Prospects for building a practical quantum computer are also analyzed. 1 Introduction and
Universe creation on a computer
, 2008
"... The purpose of this paper is to provide an account of the epistemology and metaphysics of universe creation on a computer. The paper begins with F.J.Tipler’s argument that our experience is indistinguishable from the experience of someone embedded in a perfect computer simulation of our own universe ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The purpose of this paper is to provide an account of the epistemology and metaphysics of universe creation on a computer. The paper begins with F.J.Tipler’s argument that our experience is indistinguishable from the experience of someone embedded in a perfect computer simulation of our own universe, hence we cannot know whether or not we are part of such a computer program ourselves. Tipler’s argument is treated as a special case of epistemological scepticism, in a similar vein to ‘braininavat’ arguments. It is argued that Tipler’s hypothesis that our universe is a program running on a digital computer in another universe, generates empirical predictions, and is therefore a falsifiable hypothesis. The computer program hypothesis is also treated as a hypothesis about what exists beyond the physical world, and is compared with Kant’s metaphysics of noumena. It is argued that if our universe is a program running on a digital computer, then our universe must have compact spatial topology, and
Article Hybrid QuantumClassical Protocol for Storage and Retrieval of DiscreteValued Information
, 2014
"... entropy ..."
The diagonalization method in quantum recursion theory
, 2009
"... As quantum parallelism allows the effective corepresentation of classical mutually exclusive states, the diagonalization method of classical recursion theory has to be modified. Quantum diagonalization involves unitary operators whose eigenvalues are different from one. ..."
Abstract
 Add to MetaCart
As quantum parallelism allows the effective corepresentation of classical mutually exclusive states, the diagonalization method of classical recursion theory has to be modified. Quantum diagonalization involves unitary operators whose eigenvalues are different from one.
Quantum Computation: A Computer Science Perspective
, 2005
"... The theory of quantum computation is presented in a self contained way from a computer science perspective. The basics of classical computation and quantum mechanics is reviewed. The circuit model of quantum computation is presented aspects of computation and the interplay between them. This report ..."
Abstract
 Add to MetaCart
The theory of quantum computation is presented in a self contained way from a computer science perspective. The basics of classical computation and quantum mechanics is reviewed. The circuit model of quantum computation is presented aspects of computation and the interplay between them. This report is presented as a Master’s thesis at the department of Computer Science and Engineering at Göteborg University, Göteborg, Sweden. The text is part of a larger work that is planned to include chapters on quantum algorithms, the quantum Turing machine model and abstract approaches to quantum computation.