- A General Technique for Implementation of Efficient Priority Queues
- Quantum Counting Gilles Brassard 1? , Peter Hyer 2?? , and Alain Tapp 1? ? ?
- Quantum Search on Bounded-Error Inputs Peter Hyer1,
- A General Technique for Implementation of Efficient Priority Queues \Lambda
- Quantum Search on Bounded-Error Inputs Peter H yer 1;? , Michele Mosca 2 , and Ronald de Wolf 3;??
- Multipartite nonlocal quantum correlations resistant to imperfections Harry Buhrman
- Quantum complexities of ordered searching, sorting, and element distinctness
- Improved Quantum Communication Complexity Bounds for Disjointness and Equality
- The quantum query complexity of the hidden subgroup problem is polynomial
- Quantum Circuits with Unbounded Fanout Peter Hyer 1,# and Robert Spalek 2,##
- Multiparty Quantum Communication Complexity Harry Buhrman1
- Combinatorics and Quantum Nonlocality Harry Buhrman
- Improved Quantum Communication Complexity Bounds for Disjointness and Equality
- On Arbitrary Phases in Quantum Amplitude Ampli cation
- Lower Bounds on Quantum Query Complexity Peter Hyer #
- Quantum Algorithms for Element Distinctness Harry Buhrman Christoph Durr z Mark Heiligman x Peter Hyer {
- Simplified Proof of the Fourier Sampling Theorem
- Lower Bounds on Quantum Query Complexity Peter Hyer
- The Phase Matrix Peter Hyer #
- QUANTUM QUERY COMPLEXITY OF SOME GRAPH PROBLEMS # CHRISTOPH D
- arXiv:quantph/9702028 Efficient Quantum Transforms
- An Exact Quantum Polynomial-Time Algorithm for Simon's Problem Gilles Brassard
- QUANTUM QUERY COMPLEXITY OF SOME GRAPH PROBLEMS CHRISTOPH DURR, MARK HEILIGMAN, PETER HYER, AND MEHDI MHALLA
- The Phase Matrix Peter Hyer
- Quantum Circuits with Unbounded Fan-out Peter Hyer1,
- Quantum Amplitude Amplification and Estimation
- Quantum complexities of ordered searching, sorting, and element distinctness
- On Arbitrary Phases in Quantum Amplitude Amplification
- On Quantum Algorithms for Noncommutative Hidden Subgroups
- Parametric Permutation Routing via Matchings Peter Hyer
- Simplified Proof of the Fourier Sampling Theorem
- arXiv:quantph/9705002 Quantum Algorithm for the Collision Problem
- Conjugated operators in quantum algorithms Peter H yer
- The quantum query complexity of the hidden subgroup problem is polynomial
- An Exact Quantum PolynomialTime Algorithm for Simon's Problem Gilles Brassard
- Tight Bounds on Quantum Searching Michel Boyer
- On Quantum Algorithms for Noncommutative Hidden Subgroups
- Quantum Amplitude Ampli cation and Estimation
- Conjugated operators in quantum algorithms Peter Hyer
- Combinatorics and Quantum Nonlocality Harry Buhrman
- Tight Bounds on Quantum Searching \Lambda Michel Boyer
- Multiparty Quantum Communication Complexity Harry Buhrman 1 , Wim van Dam 2;1y , Peter H yer 3z , Alain Tapp 4x
- Multipartite nonlocal quantum correlations resistant imperfections Harry Buhrman
- Quantum Algorithms for Element Distinctness Harry Buhrman
- Parametric Permutation Routing via Matchings Peter H yer and Kim S. Larsen
