Relativized separation of EQP from PNP

Information Processing Letters

Volumn 80, Issue 5, 2001, Pages 257-260

  Green, Frederic ^a   Pruim, Randall ^b  

^a CLARK UNIVERSITY   (United States)

^b CALVIN COLLEGE   (United States)

Author keywords

Computational complexity; Quantum computation; Theory of computation

Indexed keywords

ALGORITHMIC LANGUAGES; COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; INFORMATION RETRIEVAL; POLYNOMIALS; RELATIONAL DATABASE SYSTEMS; TURING MACHINES;

EXACT QUANTUM POLYNOMIALS (EQP); QUANTUM POLYNOMIAL TIME;

QUANTUM ELECTRONICS;

EID: 0035892393     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00176-4     Document Type: Article

References (8)

1. Structural Complexity I
2. Quantum computation
3. Oracle quantum computing
4. Tight bounds on quantum searching
5. Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
6. A fast quantum mechanical algorithm for database search
7. Polynomial-time algorithms for prime number factorization and discrete logarithms on a quantum computer
8. On approximation algorithms for #P