Results 1  10
of
4,051
Quantum algorithms revisited
 Proceedings of the Royal Society of London A
, 1998
"... Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multiparticle interference. We use th ..."
Abstract

Cited by 188 (16 self)
 Add to MetaCart
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multiparticle interference. We use
Quantum Algorithms
"... The paper introduces the basic concepts and principles behind quantum computing and examines in detail Shor's quantum algorithm for factoring very large numbers. Some basic methodological principles and guidelines for constructing quantum algorithms are stated. The aim is not to provide a forma ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The paper introduces the basic concepts and principles behind quantum computing and examines in detail Shor's quantum algorithm for factoring very large numbers. Some basic methodological principles and guidelines for constructing quantum algorithms are stated. The aim is not to provide a
Quantum Algorithms
"... AbstractThis thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics 11143.3 Fermions i ..."
Abstract
 Add to MetaCart
AbstractThis thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics 11143.3 Fermions
Quantum Algorithms
, 2002
"... this paper, we have in looked into some theoritical problems and tried to see how quantum algorithms performs in those cases. We have shown that collisionfinding as well as elementdistinctness problem cannot be done better than N). Our algorithm for collision detection takes O(N log n) quer ..."
Abstract
 Add to MetaCart
this paper, we have in looked into some theoritical problems and tried to see how quantum algorithms performs in those cases. We have shown that collisionfinding as well as elementdistinctness problem cannot be done better than N). Our algorithm for collision detection takes O(N log n
Quantum algorithms for the triangle problem
 PROCEEDINGS OF SODA’05
, 2005
"... We present two new quantum algorithms that either find a triangle (a copy of K3) in an undirected graph G on n nodes, or reject if G is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes Õ(n10/7) queries. The second algorithm uses Õ(n13/10) queries, and it is b ..."
Abstract

Cited by 94 (10 self)
 Add to MetaCart
We present two new quantum algorithms that either find a triangle (a copy of K3) in an undirected graph G on n nodes, or reject if G is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes Õ(n10/7) queries. The second algorithm uses Õ(n13/10) queries
Quantum Algorithms Factoring Integers
"... There exist quantum algorithms that can solve certain problems substantially faster than any classical algorithm. ..."
Abstract
 Add to MetaCart
There exist quantum algorithms that can solve certain problems substantially faster than any classical algorithm.
Quantum Algorithms
, 2007
"... These lecture notes are based on a book chapter written by the author for ”Lectures in Quantum Information”, edited by D. Bruss and G. Leuchs and published by Birkhäuser ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
These lecture notes are based on a book chapter written by the author for ”Lectures in Quantum Information”, edited by D. Bruss and G. Leuchs and published by Birkhäuser
Introduction to Quantum Algorithms
, 2001
"... Abstract. These notes discuss the quantum algorithms we know of that can solve problems significantly faster than the corresponding classical algorithms. ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
Abstract. These notes discuss the quantum algorithms we know of that can solve problems significantly faster than the corresponding classical algorithms.
Results 1  10
of
4,051