Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

ECCC
2008

favoriteEmaildiscussreport

107views more ECCC 2008»

A Quantum Time-Space Lower Bound for the Counting Hierarchy

13 years 4 months ago

A Quantum Time-Space Lower Bound for the Counting Hierarchy

Download www.cs.wisc.edu

We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are complete problems for the first and second levels of the counting hierarchy, respectively. We prove that for every real d and every positive real there exists a real c > 1 such that either:

Dieter van Melkebeek, Thomas Watson

Real-time Traffic

ECCC 2008 | Quantum | Quantum Algorithm | Two-sided Error |

claim paper

Related Content

» TimeSpace Lower Bounds for the PolynomialTime Hierarchy on Randomized Machines

» Inductive TimeSpace Lower Bounds for Sat and Related Problems

» Quantum TimeSpace Tradeoffs for Sorting

» Impossibility of Succinct Quantum Proofs for CollisionFreeness

» TimeSpace Tradeoffs for Satisfiability

» Smaller TwoQubit Circuits for Quantum Communication and Computation

» The Permanent Requires Large Uniform Threshold Circuits

» Dimension Entropy Rates and Compression

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ECCC
Authors	Dieter van Melkebeek, Thomas Watson

Comments (0)