Polynomial time quantum computation with advice

Authors:
Harumichi Nishimura;Tomoyuki Yamakami
Affiliations:
Department of Computer Science, Trent University, Peterborough, Ontario, Canada K9J 7B8 and School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada KIN 6N5;School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada KIN 6N5
Venue:
Information Processing Letters
Year:
2004

Citing 11
Cited 9

On helping by robust oracle machines

Theoretical Computer Science
Quantum Complexity Theory

SIAM Journal on Computing
Quantum Computability

SIAM Journal on Computing
The structure of logarithmic advice complexity classes

Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
Computational Work and Time on Finite Machines

Journal of the ACM (JACM)
NQPC &equal;co-C&equal;P

Information Processing Letters
Quantum computation and quantum information

Quantum computation and quantum information
Computational complexity of uniform quantum circuit families and quantum Turing machines

Theoretical Computer Science
Dense quantum coding and quantum finite automata

Journal of the ACM (JACM)
Characterizations of Logarithmic Advice Complexity Classes

Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Cryptocomplexity and NP-Completeness

Proceedings of the 7th Colloquium on Automata, Languages and Programming

An application of quantum finite automata to interactive proof systems

Journal of Computer and System Sciences
New applications of quantum algorithms to computer graphics: the quantum random sample consensus algorithm

Proceedings of the 6th ACM conference on Computing frontiers
Amount of Nonconstructivity in Finite Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
A full characterization of quantum advice

Proceedings of the forty-second ACM symposium on Theory of computing
Amount of nonconstructivity in deterministic finite automata

Theoretical Computer Science
Finite state transducers with intuition

UC'10 Proceedings of the 9th international conference on Unconventional computation
An application of quantum finite automata to interactive proof systems (extended abstract)

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
One-Way reversible and quantum finite automata with advice

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Multiple usage of random bits in finite automata

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state and examines the influence of such advice on the behaviors of an underlying polynomial-time quantum computation with bounded-error probability.