Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy
Stephen Fenner, Frederic Green, Steven Homer, Randall Pruim
Abstract
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.
Create a lesson
Related papers
An entangling Hubbard quasiparticle collider on a digital quantum processor
Chan Bin Bark, Hanbyul Kim, Yoonil Koo et al.
A Warped Born Rule Turns an Observer into a Maxwell's Demon
Olumakinde Ogunnaike
A scalable sample-based quantum diagonalization solver for general Pauli-sum Hamiltonians
Yutaro Iiyama
Quantum Query Complexity of Maximum Degree and its Generalizations
Amin Shiraz Gilani, Nikhil S. Mande, Subhasree Patro et al.
Maximally antiflat fixed-particle-number fermionic states
Rahul Gupta, Arya Haghighian, James D. Whitfield
An Annealing-based Quantum Neural Network with Discrete Wavelet Transforms for Enhanced Air Pollution Nowcasting
Otto Menegasso Pires, André Saimon, Daniela Herrmann et al.