See this document in CiteSeerX!

Quantum Automata With Mixed States; Functions and Languages Recognition (2002)  (Make Corrections)  
Andrej Dubrovsky, Oksana Soegulnaja



  Home/Search   Context   Related

 
View or download:
ima.mdh.se/personal/rbr/course...09.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ima.mdh.se/personal/...riga02proc (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this work we consider the aspect of computational complexity called oracle query complexity, that is number of queries one needs to ask oracle to compute Boolean function We show two computational models: pure states quantum automata and quantum automata with mixed states. We present a function, that can be computed by quantum automata with mixed states with fewer queries than by pure states quantum automata. As another result we present quantum automata with mixed states which can... (Update)

Active bibliography (related documents):   More   All
0.5:   Size of Finite Probabilistic and Quantum Automata - Bonner, Freivalds, Rasscevskis (2002)   (Correct)
0.2:   Quantum Lower Bounds by Quantum Arguments - Ambainis (2000)   (Correct)
0.2:   Complexity Measures and Decision Tree Complexity: A Survey - Buhrman, de Wolf (1999)   (Correct)

Similar documents based on text:   More   All
0.4:   On Quantum Coding for Ensembles of Mixed States - Barnum, Caves, Fuchs, Jozsa, .. (2000)   (Correct)
0.4:   Exact Results for Accepting Probabilities of Quantum Automata - Ambainis, Kikusts (2001)   (Correct)
0.4:   Quantum Circuits with Mixed States - Aharonov, Kitaev, Nisan (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ dubrovsky-quantum,
  author = "Andrej Dubrovsky and Oksana Soegulnaja",
  title = "Quantum Automata With Mixed States; Functions and Languages Recognition",
  url = "citeseer.ist.psu.edu/dubrovsky02quantum.html" }
Citations (may not include all citations):
210   A fast quantum mechanical algorithm for database search - Grover - 1996
144   the power of quantum computation - Simon - 1994
126   Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
102   Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997
49   Quantum lower bounds by polynomials - Beals, Buhrman et al. - 1998
19   Quantum computing (context) - Gruska - 1999
13   way Quantum finite automata: strengths (context) - Ambainis, Freivalds
5   Lower bounds of quantum black - box complexity and degree of.. (context) - Shi - 2000
2   Exact results for accepting probabilities of quantum automat.. - Ambainis, Kikusts
1   Optimal lower bounds for quantum automata and random access .. (context) - Najak
1   the power of Quantum State Finite Automata (context) - Kondacs, Watrous - 1999

Documents on the same site (http://www.ima.mdh.se/personal/rbr/courses/riga02proc.html):   More
Size of Finite Probabilistic and Quantum Automata - Bonner, Freivalds, Rasscevskis (2002)   (Correct)
Capabilities of Finite Standardization - Tervits   (Correct)
Boolean Function Computation by Probabilistic and Quantum.. - Kravcevs   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC