Limitations on Quantum Dimensionality Reduction
暂无分享,去创建一个
[1] Andris Ambainis,et al. Quantum t-designs: t-wise Independence in the Quantum World , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[2] Amit Sahai,et al. Dimension reduction in the /spl lscr//sub 1/ norm , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[3] Piotr Indyk,et al. Algorithmic applications of low-distortion geometric embeddings , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[4] Guillaume Aubrun,et al. Hastings’s Additivity Counterexample via Dvoretzky’s Theorem , 2010, 1003.4925.
[5] R. Goodman,et al. Symmetry, Representations, and Invariants , 2009 .
[6] Scott Aaronson,et al. Limitations of quantum advice and one-way communication , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[7] CharikarMoses,et al. On the impossibility of dimension reduction in l1 , 2005 .
[8] R. Cleve,et al. Consequences and limits of nonlocal strategies , 2004 .
[9] Ronald de Wolf,et al. Strengths and weaknesses of quantum fingerprinting , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[10] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[11] R. Cleve,et al. Quantum fingerprinting. , 2001, Physical review letters.
[12] Bonnie Berger,et al. The fourth moment method , 1991, SODA '91.
[13] Andreas J. Winter,et al. Weak Decoupling Duality and Quantum Identification , 2010, IEEE Transactions on Information Theory.
[14] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[15] Rafail Ostrovsky,et al. Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.
[16] Andreas J. Winter. Quantum and classical message identification via quantum channels , 2005, Quantum Inf. Comput..
[17] Jaikumar Radhakrishnan,et al. Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem , 2005, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[18] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[19] Guillaume Aubrun,et al. ENYI ENTROPY AND DVORETZKY'S THEOREM , 2010 .
[20] Pranab Sen,et al. From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking , 2010, JACM.
[21] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[22] A. Winter,et al. Distinguishability of Quantum States Under Restricted Families of Measurements with an Application to Quantum Data Hiding , 2008, 0810.2327.
[23] Andreas J. Winter,et al. The Fidelity Alternative and Quantum Measurement Simulation , 2010, ArXiv.
[24] Debbie W. Leung,et al. Remote preparation of quantum states , 2005, IEEE Transactions on Information Theory.
[25] E. Kushilevitz,et al. Communication Complexity: Basics , 1996 .
[26] Kenneth Ward Church,et al. Nonlinear Estimators and Tail Bounds for Dimension Reduction in l1 Using Cauchy Random Projections , 2006, J. Mach. Learn. Res..
[27] A. Sahai,et al. Dimension Reduction in the l 1 norm , 2002 .
[28] T. Rudolph,et al. Classical and quantum communication without a shared reference frame. , 2003, Physical review letters.