Peter Høyer

Publication Activity (10 Years)

Years Active: 1995-2022
Publications (10 Years): 12

Top Topics

Key Establishment

Quantum Computation

Hadamard Transform

Complex Queries

Top Venues

Quantum Inf. Comput.

Quantum Inf. Process.

Publications

Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
Symmetry and Quantum Query-To-Communication Simulation. STACS (2022)
Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
Symmetry and Quantum Query-to-Communication Simulation. CoRR (2020)
Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix
Contextuality in multipartite pseudo-telepathy graph games. J. Comput. Syst. Sci. 107 (2020)
Peter Høyer, Zhan Yu
Analysis of lackadaisical quantum walks. Quantum Inf. Comput. 20 (13&14) (2020)
Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail
Key Establishment à la Merkle in a Quantum World. J. Cryptol. 32 (3) (2019)
Peter Høyer, Mojtaba Komeili
Efficient Quantum Walk on the Grid with Multiple Marked Elements. STACS (2017)
Catalin Dohotaru, Peter Høyer
Controlled Quantum Amplification. ICALP (2017)
Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix
Contextuality in Multipartite Pseudo-Telepathy Graph Games. FCT (2017)
Aleksandrs Belovs, Gilles Brassard, Peter Høyer, Marc Kaplan, Sophie Laplante, Louis Salvail
Provably Secure Key Establishment Against Quantum Adversaries. TQC (2017)
Peter Høyer, Mehdi Mhalla, Simon Perdrix
Contextuality in multipartie pseudo-telepathy graph games. CoRR (2016)
Peter Høyer, Mojtaba Komeili
Efficient quantum walk on the grid with multiple marked elements. CoRR (2016)
Mark Adcock, Peter Høyer, Barry C. Sanders
Quantum computation with coherent spin states and the close Hadamard problem. Quantum Inf. Process. 15 (4) (2016)
Thomas Decker, Peter Høyer, Gábor Ivanyos, Miklos Santha
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems. Quantum Inf. Comput. 14 (9-10) (2014)
Mark Adcock, Peter Høyer, Barry C. Sanders
Gaussian quantum computation with oracle-decision problems. Quantum Inf. Process. 12 (4) (2013)
Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail
Merkle Puzzles in a Quantum World. CRYPTO (2011)
Catalin Dohotaru, Peter Høyer
Exact quantum lower bound for grover's problem. Quantum Inf. Comput. 9 (5&6) (2009)
Peter Høyer, Troy Lee, Robert Spalek
Negative weights make adversaries stronger. STOC (2007)
Peter Høyer, Mehdi Mhalla, Simon Perdrix
Resources Required for Preparing Graph States. ISAAC (2006)
Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla
Quantum Query Complexity of Some Graph Problems. SIAM J. Comput. 35 (6) (2006)
Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
Quantum Algorithms for Element Distinctness. SIAM J. Comput. 34 (6) (2005)
Peter Høyer
The Phase Matrix. ISAAC (2005)
Peter Høyer, Robert Spalek
Lower Bounds on Quantum Query Complexity. Bull. EATCS 87 (2005)
Peter Høyer, Robert Spalek
Quantum Fan-out is Powerful. Theory Comput. 1 (1) (2005)
Mark Ettinger, Peter Høyer, Emanuel Knill
The quantum query complexity of the hidden subgroup problem is polynomial. Inf. Process. Lett. 91 (1) (2004)
Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla
Quantum Query Complexity of Some Graph Problems. ICALP (2004)
Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous
Consequences and Limits of Nonlocal Strategies. Computational Complexity Conference (2004)
Peter Høyer, Michele Mosca, Ronald de Wolf
Quantum Search on Bounded-Error Inputs CoRR (2003)
Peter Høyer, Robert Spalek
Quantum Circuits with Unbounded Fan-out. STACS (2003)
Peter Høyer, Michele Mosca, Ronald de Wolf
Quantum Search on Bounded-Error Inputs. ICALP (2003)
Peter Høyer, Ronald de Wolf
Improved Quantum Communication Complexity Bounds for Disjointness and Equality. STACS (2002)
Peter Høyer, Jan Neerbek, Yaoyun Shi
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Algorithmica 34 (4) (2002)
Peter Høyer, Robert Spalek
Quantum Circuits with Unbounded Fan-out CoRR (2002)
Peter Høyer, Jan Neerbek, Yaoyun Shi
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. ICALP (2001)
Peter Høyer, Ronald de Wolf
Improved Quantum Communication Complexity Bounds for Disjointness and Equality CoRR (2001)
Peter Høyer
Introduction to Recent Quantum Algorithms. MFCS (2001)
Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
Quantum Algorithms for Element Distinctness. Computational Complexity Conference (2001)
Mark Ettinger, Peter Høyer
On Quantum Algorithms for Noncommutative Hidden Subgroups. Adv. Appl. Math. 25 (3) (2000)
Peter Høyer
Simplified proof of the Fourier Sampling Theorem. Inf. Process. Lett. 75 (4) (2000)
Mark Ettinger, Peter Høyer
On Quantum Algorithms for Noncommutative Hidden Subgroups. STACS (1999)
Peter Høyer, Kim S. Larsen
Parametric Permutation Routing via Matchings. Nord. J. Comput. 5 (2) (1998)
Gilles Brassard, Peter Høyer, Alain Tapp
Quantum Counting. ICALP (1998)
Gilles Brassard, Peter Høyer, Alain Tapp
Quantum Cryptanalysis of Hash and Claw-Free Functions. LATIN (1998)
Gilles Brassard, Peter Høyer, Alain Tapp
Quantum cryptanalysis of hash and claw-free functions. SIGACT News 28 (2) (1997)
Gilles Brassard, Peter Høyer
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. ISTCS (1997)
Christoph Dürr, Peter Høyer
A Quantum Algorithm for Finding the Minimum CoRR (1996)
Peter Høyer
A General Technique for Implementation of Efficient Priority Queues. ISTCS (1995)