Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy

Details Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy

1998-12-18

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

Physics

Quantum Physics

Scientific paper

It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP of Adleman, Demarrais, and Huang, a quantum analog of NP, is equal to the counting class coC$_=$P.

Affiliated with

Also associated with

No associations

Rating

Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy 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 Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-444335