Search Sciweavers | Sciweavers

33

FOCS
1997
IEEE

83views Theoretical Computer Science» more FOCS 1997»

On the Power of Quantum Finite State Automata

14 years 3 months ago

In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...

Attila Kondacs, John Watrous

claim paper

Read More »

32

click to vote

ISAAC
2003
Springer

91views Algorithms» more ISAAC 2003»

Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?

14 years 4 months ago

Download cjtcs.cs.uchicago.edu

This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...

Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...

claim paper

Read More »

32

click to vote

ICPR
2008
IEEE

137views Computer Vision» more ICPR 2008»

Graph drawing using quantum commute time

14 years 5 months ago

Download figment.cse.usf.edu

In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...

David Emms, Edwin R. Hancock, Richard C. Wilson

claim paper

Read More »

58

click to vote

ISTCS
1997
Springer

289views Applied Computing» more ISTCS 1997»

An Exact Quantum Polynomial-Time Algorithm for Simon's Problem

14 years 3 months ago

Download pages.cpsc.ucalgary.ca

We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...

Gilles Brassard, Peter Høyer

claim paper

Read More »

25

click to vote

PAAPP
2006

48views more PAAPP 2006»

Quantum computation and quantum information

13 years 10 months ago