2661 search results - page 9 / 533 » Quantum Complexity Classes |
109
click to vote
AIEDAM
2008
15 years 22 days ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
DAGSTUHL
2007
15 years 2 months ago
2007
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
CORR
2010
Springer
15 years 21 days ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
126
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
62
Voted
CORR
2006
Springer
15 years 18 days ago
2006
Springer
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider th...