- Colin P. Williams and Scott H. Clearwater, Explorations in Quantum Computing. Springer-Verlag (The Electronic Library of Science), 1998.
- Quantum Computing Exercises # 6 Ronald de Wolf
- Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
- Uniform Approximation by (Quantum) Polynomials Andrew Drucker
- Private Quantum Channels Andris Ambainis Michele Moscay
- Main Quantum Algorithms: Shor and Grover
- Some More Quantum Communication Complexity Quantum Computing Course, November 10, 2000
- A Brief Introduction to Communication Complexity Ronald de Wolf, rdewolf@cwi.nl
- Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
- 1 The Yao Principle (from Minimax) In classical computing, the Yao principle (Yao, 77) gives an equivalence between two kinds of randomness
- A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs
- Quantum Computing Exercises # 4 Ronald de Wolf
- Quantum Computing, Final exam December 14, 2000
- BOUNDED-ERROR QUANTUM STATE IDENTIFICATION AND EXPONENTIAL SEPARATIONS IN COMMUNICATION
- Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org
- A note on quantum algorithms and the minimal degree of -error polynomials for symmetric functions
- Quantum Computing Exercises, September 29, 2000 1. Simon's algorithm (+ solution)
- Quantum Computing Exercises, October 20, 2000 A short summary of Monday's lecture: we can use degrees of polynomials to obtain strong lower bounds
- Quantum Random Walk Algorithms Ronald de Wolf
- The classical and quantum Fourier transform Ronald de Wolf
- Bounds for Small-Error and Zero-Error Quantum Algorithms Harry Buhrman
- Quantum Computation and Shor's Factoring Algorithm Ronald de Wolf
- Philosophical Applications of Computational Learning Theory
- CURRICULUM VITAE Ronald Michiel de Wolf
- Quantum Computing and Communication Complexity
- Quantum Lower Bounds by Polynomials Robert Beals
- A Lower Bound for Quantum Search of an Ordered List Harry Buhrman Ronald de Wolfy
- A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
- Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing
- New Results on Quantum Property Testing
- Communication Complexity Lower Bounds by Polynomials Harry Buhrman Ronald de Wolf
- Lower Bounds on Matrix Rigidity via a Quantum Argument
- Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity
- Strengths and Weaknesses of Quantum Fingerprinting Dmitry Gavinsky
- Exponential Separations for One-Way Quantum Communi-cation Complexity, with Applications to Cryptography
- Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument
- Submitted to the Symposium on Theoretical Aspects of Computer Science www.stacs-conf.org
- Quantum Computation and Shor's Factoring Algorithm Ronald de Wolf
- The Subsumption Theorem in Inductive Logic Programming
- Quantum Computing: Lecture Notes
- Quantum Computation: Introduction
- Quantum Computing Exercises # 2 Ronald de Wolf
- Quantum Computing Exercises # 8 Ronald de Wolf
- Quantum Computing Exercises # 10 Ronald de Wolf
- Quantum Computing Exercises # 14 Ronald de Wolf
- 1 Vector spaces C is the set of all complex numbers, i.e. numbers of the form a + ib, where a and b are real numbers and
- Prof. Ronald L. Rivest MIT Laboratory for Computer Science
- Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing
- Robust Polynomials and Quantum Algorithms Harry Buhrman1,2
- Quantum Computing Exercises, October 13, 2000 Recall that Grover's algorithm searches for an i such that f(i) = 1, where f : f0; 1g n ! f0; 1g. We will call
- A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
- The Equivalence of the Subsumption Theorem and the Refutation-completeness for
- Least Generalizations under Implication Shan-Hwei Nienhuys-Cheng and Ronald de Wolf
- Quantum Computing Exercises September 15, 2000
- Quantum Computing Exercises # 9 Ronald de Wolf
- Quantum Computing Exercises # 13 Ronald de Wolf
- Journal of Arti cial Intelligence Research 4 (1996) 341-363 Submitted 11/95; published 5/96 Least Generalizations and Greatest Specializations
- SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 36, No. 5, pp. 14721493
- Better Non-Local Games from Hidden Matching Harry Buhrman
- Marked PCP is Decidable Vesa Halava
- Quantum Computing Exercises # 12 Ronald de Wolf
- Quantum Computing Exercises # 1 Ronald de Wolf
- Quantum Proofs for Classical Theorems Andrew Drucker
- Tidying up the Mess around the Subsumption Theorem
- Quantum Computing Exercises # 11 Ronald de Wolf
- Algorithmic Clustering of Music Rudi Cilibrasi Paul Vitanyi Ronald de Wolf
- Quantum Computing Exercises # 5 Ronald de Wolf
- Quantum Communication Ronald de Wolf
- Quantum Computing Exercises # 3 Ronald de Wolf
- Average-Case Quantum Query Complexity Andris Ambainis1? and Ronald de Wolf2;3
- Quantum Computing Exercises, November 24, 2000 1. Suppose Alice and Bob want to establish n = 3 shared random bits using the BB84 protocol
- Quantum Computing Exercises # 7 Ronald de Wolf
- Quantum Algorithms for Element Distinctness Harry Buhrman
- Contributions to Inductive Logic Programming
- Robust Polynomials and Quantum Algorithms Harry Buhrman
- Submitted to the Symposium on Theoretical Aspects of Computer Science www.stacs-conf.org
- Decidability and Undecidability of Marked PCP Vesa Halava1
- Near-Optimal and Explicit Bell Inequality Violations Harry Buhrman
- Non-locality and Communication Complexity Harry Buhrman
- Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds
- Efficient Data Structures from Union-Free Families of Sets Ronald de Wolf