On the Complexity of Quantum Languages

Details On the Complexity of Quantum Languages On the Complexity of Quantum Languages

2004-04-12

arxiv.org/abs/quant-ph/0404062v1

Physics

Quantum Physics

12 pages, 3 figures

Scientific paper

The standard inputs given to a quantum machine are classical binary strings. In this view, any quantum complexity class is a collection of subsets of $\{0,1\}^{*}$. However, a quantum machine can also accept quantum states as its input. T. Yamakami has introduced a general framework for quantum operators and inputs \cite{Yam02}. In this paper we present several quantum languages within this model and by generalizing the complexity classes QMA and QCMA we analyze the complexity of the introduced languages. We also discuss how to derive a classical language from a given quantum language and as a result we introduce new QCMA and QMA languages.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of Quantum Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of Quantum Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Quantum Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-608992