Complexity Limitations on Quantum Computation

13 years 9 months ago

Download people.cs.uchicago.edu

We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP.

Lance Fortnow, John D. Rogers

Real-time Traffic

Algorithms | COCO 1998 | Probabilistic Quantum Class | Relativized World | There Exists |

claim paper

» Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simu...

» The effect of communication costs in solidstate quantum computing architectures

» Nonadaptive quantum query complexity

» Quantum computing beyond the limits of conventional computation

» Limitations of Quantum Advice and OneWay Communication

» Fault Tolerant Computation on Ensemble Quantum Computers

» One Complexity Theorists View of Quantum Computing

» Polynomial Degree vs Quantum Query Complexity

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	COCO
Authors	Lance Fortnow, John D. Rogers

Comments (0)

Sciweavers

Complexity Limitations on Quantum Computation

Algorithms | COCO 1998 | Probabilistic Quantum Class | Relativized World | There Exists |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers