PQ/QP

PQ/QP

PQ/QP denotes a pair of related complexity-theoretic classes studied in the theory of computation and quantum information. In contemporary literature the pair appears in discussions that juxtapose probabilistic, quantum, and counting paradigms developed across work by figures such as Stephen Cook, Leonid Levin, Richard Karp, Michael Sipser, and later researchers at institutions including Bell Labs, MIT, Princeton University, Harvard University, and University of California, Berkeley. The topic intersects with major questions involving reductions, completeness, and separations that have been central to conferences like STOC, FOCS, and ICALP.

Definition and Nomenclature

The formal definition of the classes uses machine models introduced by pioneers such as Alan Turing and extended by researchers including John von Neumann and Alonzo Church. One class is defined via polynomial-time nondeterministic or probabilistic machines, and the counterpart via quantum circuits or amplitude-based machines developed in the wake of work by Peter Shor and Lov Grover. Nomenclature varies across texts by authors like Eugene Wigner, David Deutsch, Richard Feynman, and modern surveys by Scott Aaronson and John Preskill, producing multiple synonyms and related labels appearing in textbooks from Cambridge University Press and Springer Science+Business Media. Standard references articulate acceptance, completeness, and promise variants influenced by reductions used by Kurt Gödel and structural frameworks from Emil Post.

Mathematical Properties and Relations

Mathematical relations for these classes rely on reductions and separations that trace back to central theorems by Stephen Cook and Leonid Levin on NP-completeness and by Richard Karp on polynomial reducibility. Closure properties under union, intersection, and complement are compared using techniques from algebraic complexity initiated by Leslie Valiant and analytic tools used by Claude Shannon and Norbert Wiener. Relationships to counting classes and hierarchies are expressed in terms used by Valiant and Leslie Valiant for #P and contrasted with hierarchies studied by Andrei Kolmogorov in descriptive complexity. Reductions to circuit classes evoke work by Sanjeev Arora and Boaz Barak on PCP theorems and hardness amplification originally motivated by Eli Ben-Sasson and Madhu Sudan. Completeness results draw on diagonalization techniques attributed to Alan Turing and recursion-theoretic ideas revisited by Stephen Cole Kleene.

Algorithms and Computational Complexity

Algorithmic aspects explore decision procedures, verification, and sampling algorithms influenced by algorithmic paradigms from Donald Knuth, Ronald Rivest, Adi Shamir, and Leonard Adleman. Quantum algorithmic impacts cite breakthroughs by Peter Shor and Lov Grover and subsequent improvements from researchers at IBM Research and Google's quantum teams. Complexity bounds and oracle separations use methods developed by Bennett and Gill and complexity-theoretic separations proposed in seminars at Institute for Advanced Study and workshops involving Oded Goldreich and Lance Fortnow. Practical algorithmic frameworks leverage derandomization tools from Noam Nisan and Nisan and Wigderson and hardness versus randomness paradigms connected to conjectures advanced by Impagliazzo and Russell Impagliazzo.

Applications and Examples

Instances where the classes appear include analyses of cryptographic primitives designed by Ronald Rivest, Adi Shamir, and Leonard Adleman; quantum-resistant constructions debated by researchers at NSA and in literature by Shai Halevi and Dan Boneh; and complexity assessments of combinatorial optimization problems studied by William Cook and Vladimir Kolmogorov. Experimental demonstrations on architectures by IBM, Google, and Rigetti Computing have motivated empirical studies connecting theoretical bounds to noisy intermediate-scale quantum devices similar to prototypes developed at Los Alamos National Laboratory and Lawrence Berkeley National Laboratory. Examples in proof complexity and interactive proofs trace lineage through the IP = PSPACE result and the PCP theorem, with links to authors like László Babai, Shafi Goldwasser, and Silvio Micali.

Historical Development and Key Contributors

The lineage begins with foundational work on decidability and algorithmic models by Alan Turing and Alonzo Church, later formalized into complexity by Stephen Cook and Richard Karp. The probabilistic and quantum strands were advanced by Michael Rabin, Andrew Yao, David Deutsch, and Peter Shor, while structural complexity and counting perspectives emerged from Leslie Valiant and Valentin F. Kolmogorov-inspired lines. Key contributors include theoreticians from academic centers such as Stanford University, Massachusetts Institute of Technology, Princeton University, and industrial labs like Bell Labs, IBM Research, and Microsoft Research. Seminal conferences and awards tied to the development include Gödel Prize-winning work, presentations at STOC and FOCS, and monographs published by MIT Press and Oxford University Press.

Category:Computational complexity theory