- arXiv:quant-ph/0011065 15 Nov 2000 QuantumFouriertransformsforextractinghidden
- VOLUME 87, NUMBER 16 P H Y S I C A L R E V I E W L E T T E R S 15 OCTOBER 2001 Quantum Fingerprinting
- Exact and approximate unitary 2-designs and their application to fidelity estimation Christoph Dankert,1
- Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive PIRs
- comput. complex. 17 (2008), 282299 1016-3328/08/020282-18, published online 2 May 2008
- Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems Richard Cleve
- arXiv:quant-ph/0608146v118Aug2006 Strong Parallel Repetition Theorem
- Digital Object Identifier (DOI) 10.1007/s00220-006-0150-x Commun. Math. Phys. 270, 359371 (2007)
- New Limits on Fault-Tolerant Quantum Computation Harry Buhrman
- Quantum Lower Bounds for the Goldreich-Levin Problem Mark Adcock1,
- arXiv:quantph/0608146 Strong Parallel Repetition Theorem
- Quantum Lower Bounds for the GoldreichLevin Problem Mark Adcock 1,# Richard Cleve 1,+ Kazuo Iwama 2,# Raymond Putra 2,4,
- arXiv:quant-ph/0508139v28Feb2006 Efficient quantum algorithms for simulating sparse Hamiltonians
- THEORY OF COMPUTING, Volume 5 (2009), pp. 119123 www.theoryofcomputing.org
- arXiv:quantph/0606161 Exact and Approximate Unitary 2Designs: Constructions and Applications
- arXiv:quantph/0508139 Ecient quantum algorithms for simulating sparse Hamiltonians
- arXiv:quant-ph/0604141v220Apr2006 New Limits on Fault-Tolerant Quantum Computation
- Quantum Algorithms for Evaluating Min-Max Trees
- Information Processing Letters 97 (2006) 208211 www.elsevier.com/locate/ipl
- arXiv:quantph/0604141 New Limits on Fault-Tolerant Quantum Computation
- Efficient Discrete-Time Simulations of Continuous-Time Quantum Query Algorithms
- arXiv:quant-ph/0606161v120Jun2006 Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Nonlocality and communication complexity Harry Buhrman
- arXiv:0907.3584v1[quant-ph]21Jul2009 Non-locality and Communication Complexity
