COCO 2007 - PDF Preprint Papers

COCO 2007 Annual IEEE Conference on Computational Complexity

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCO-2007 Paper

click to vote

COCO
2007
Springer

142views Algorithms» more COCO 2007»

Quantum t-designs: t-wise Independence in the Quantum World

14 years 5 months ago

Download www.math.uwaterloo.ca

A t-design for quantum states is a ﬁnite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...

Andris Ambainis, Joseph Emerson

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	142	Quantum t-designs: t-wise Independence in the Quantum World	claim
2	126	On Derandomizing Probabilistic Sublinear-Time Algorithms	claim
3	114	Directed Planar Reachability is in Unambiguous Log-Space	claim
4	111	Efficient Arguments without Short PCPs	claim
5	109	Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems	claim
6	108	The Communication Complexity of Correlation	claim
7	107	A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover	claim
8	106	The Complexity of Polynomials and Their Coefficient Functions	claim
9	106	On Parameterized Path and Chordless Path Problems	claim
10	103	Bases Collapse in Holographic Algorithms	claim
11	102	Time-Space Tradeoffs for Counting NP Solutions Modulo Integers	claim
12	101	On Heuristic Time Hierarchies	claim
13	96	Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes	claim
14	94	Bounded Queries and the NP Machine Hypothesis	claim
15	94	Low-Depth Witnesses are Easy to Find	claim
16	94	On Approximate Majority and Probabilistic Time	claim
17	93	S-T Connectivity on Digraphs with a Known Stationary Distribution	claim
18	92	Halfspace Matrices	claim
19	91	Lower Bounds for Multi-Player Pointer Jumping	claim
20	90	Quantum versus Classical Proofs and Advice	claim
21	89	Testing Properties of Constraint-Graphs	claim
22	88	A New Interactive Hashing Theorem	claim
23	87	Parity Problems in Planar Graphs	claim
24	85	Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols	claim
25	84	Understanding Parallel Repetition Requires Understanding Foams	claim
26	75	On the Theory of Matchgate Computations	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers