Peter Høyer

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Tight bound for estimating expectation values from a system of linear equations	2022	Abhijeet Alase Robert R. Nerem Mohsen Bagherimehrab Peter Høyer Barry C. Sanders
+	Spatial Search via Memoryless Walk with Selfloop	2022	Peter Høyer Janet Leahy
+	Tight Bound for Estimating Expectation Values from a System of Linear Equations	2021	Abhijeet Alase Robert R. Nerem Mohsen Bagherimehrab Peter Høyer Barry C. Sanders
+	Symmetry and Quantum Query-to-Communication Simulation.	2020	Sourav Chakraborty Arkadev Chattopadhyay Peter Høyer Nikhil S. Mande Manaswi Paraashar Ronald de Wolf
+ PDF Chat	Symmetry and Quantum Query-to-Communication Simulation	2020	Sourav Chakraborty Arkadev Chattopadhyay Peter Høyer Nikhil S. Mande Manaswi Paraashar Ronald de Wolf
+	Analysis of Lackadaisical Quantum Walks	2020	Peter Høyer Zhan Yu
+	The Role of Symmetry in Quantum Query-to-Communication Simulation	2020	Sourav Chakraborty Arkadev Chattopadhyay Peter Høyer Nikhil S. Mande Manaswi Paraashar Ronald de Wolf
+ PDF Chat	Contextuality in multipartite pseudo-telepathy graph games	2019	Anurag Anshu Peter Høyer Mehdi Mhalla Simon Perdrix
+	Provably secure key establishment against quantum adversaries	2017	Aleksandrs Belovs Gilles Brassard Peter Høyer Marc Kaplan Sophie Laplante Louis Salvail
+ PDF Chat	Contextuality in Multipartite Pseudo-Telepathy Graph Games	2017	Anurag Anshu Peter Høyer Mehdi Mhalla Simon Perdrix
+	Provably secure key establishment against quantum adversaries	2017	Aleksandrs Belovs Gilles Brassard Peter Høyer Marc Kaplan Sophie Laplante Louis Salvail
+	Efficient quantum walk on the grid with multiple marked elements	2016	Peter Høyer Mojtaba Komeili
+	Contextuality in multipartite pseudo-telepathy graph games	2016	Anurag Anshu Peter Høyer Mehdi Mhalla Simon Perdrix
+ PDF Chat	Quantum computation with coherent spin states and the close Hadamard problem	2016	Mark Adcock Peter Høyer Barry C. Sanders
+ PDF Chat	Polynomial time quantum algorithms for certain bivariate hidden polynomial problems	2014	Thomas Decker Peter Høyer Gábor Ivanyos Miklós Sántha
+ PDF Chat	QUANTUM NONLOCAL BOXES EXHIBIT STRONGER DISTILLABILITY	2013	Peter Høyer Jibran Rashid
+	Polynomial time quantum algorithms for certain bivariate hidden polynomial problems	2013	Thomas Decker Peter Høyer Gábor Ivanyos Miklós Sántha
+ PDF Chat	Gaussian quantum computation with oracle-decision problems	2012	Mark Adcock Peter Høyer Barry C. Sanders
+ PDF Chat	Simulating quantum dynamics on a quantum computer	2011	Nathan Wiebe Dominic W. Berry Peter Høyer Barry C. Sanders
+ PDF Chat	Improved error bounds for the adiabatic approximation	2011	Donny Cheung Peter Høyer Nathan Wiebe
+	Key establishment \`a la Merkle in a quantum world	2011	Gilles Brassard Peter Høyer Kassem Kalach Marc Kaplan Sophie Laplante Louis Salvail
+ PDF Chat	Optimal protocols for nonlocality distillation	2010	Peter Høyer Jibran Rashid
+ PDF Chat	Higher order decompositions of ordered operator exponentials	2010	Nathan Wiebe Dominic W. Berry Peter Høyer Barry C. Sanders
+ PDF Chat	Limitations on continuous variable quantum algorithms with Fourier transforms	2009	Mark Adcock Peter Høyer Barry C. Sanders
+ PDF Chat	Exact quantum lower bound for Grover's problem	2009	Catalin Dohotaru Peter Høyer
+ PDF Chat	Exact quantum lower bound for Grover's problem	2009	Catalin Dohotaru Peter Høyer
+ PDF Chat	Negative weights make adversaries stronger	2007	Peter Høyer Troy Lee Robert Špalek
+ PDF Chat	Multipartite nonlocal quantum correlations resistant to imperfections	2006	Harry Buhrman Peter Høyer Hein Röhrig Serge Massar
+ PDF Chat	Quantum Query Complexity of Some Graph Problems	2006	Christoph Dürr Mark Heiligman Peter Høyer Mehdi Mhalla
+ PDF Chat	Quantum Fan-out is Powerful	2005	Peter Høyer Robert Špalek
+	Tight adversary bounds for composite functions	2005	Peter Høyer Robert Špalek
+	Lower Bounds on Quantum Query Complexity	2005	Peter Høyer Robert Špalek
+	Lower Bounds on Quantum Query Complexity	2005	Peter Høyer Robert Špalek
+ PDF Chat	Quantum Circuits with Unbounded Fan-out	2005	Peter Høyer Robert Špalek
+ PDF Chat	Quantum Algorithms for Element Distinctness	2005	Harry Buhrman Christoph Dürr Mark Heiligman Peter Høyer Frédéric Magniez Miklós Sántha Ronald de Wolf
+ PDF Chat	Consequences and limits of nonlocal strategies	2004	Richard Cleve Peter Høyer Ben Toner John Watrous
+ PDF Chat	The quantum query complexity of the hidden subgroup problem is polynomial	2004	Mark Ettinger Peter Høyer Emanuel Knill
+ PDF Chat	Quantum Query Complexity of Some Graph Problems	2004	Christoph Dürr Mark Heiligman Peter Høyer Mehdi Mhalla
+ PDF Chat	Combinatorics and Quantum Nonlocality	2003	Harry Buhrman Peter Høyer Serge Massar Hein Röhrig
+ PDF Chat	Quantum Search on Bounded-Error Inputs	2003	Peter Høyer Michele Mosca Ronald de Wolf
+ PDF Chat	Quantum Circuits with Unbounded Fan-out	2003	Peter Høyer Robert Špalek
+ PDF Chat	An exact quantum polynomial-time algorithm for Simon's problem	2002	Gilles Brassard Peter Høyer
+ PDF Chat	Quantum algorithms for element distinctness	2002	Harry Buhrman Christoph Dürr Mark Heiligman Peter Høyer Frédéric Magniez Miklós Sántha Ronald de Wolf
+ PDF Chat	Improved Quantum Communication Complexity Bounds for Disjointness and Equality	2002	Peter Høyer Ronald de Wolf
+	Quantum amplitude amplification and estimation	2002	Gilles Brassard Peter Høyer Michele Mosca Alain Tapp
+	Quantum bounds for ordered searching and sorting	2001	Peter Høyer Jan Neerbek Yaoyun Shi
+ PDF Chat	Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness	2001	Peter Høyer Jan Neerbek Yaoyun Shi
+ PDF Chat	Arbitrary phases in quantum amplitude amplification	2000	Peter Høyer
+	On Quantum Algorithms for Noncommutative Hidden Subgroups	2000	Mark Ettinger Peter Høyer
+	Quantum Amplitude Amplification and Estimation	2000	Gilles Brassard Peter Høyer Michele Mosca Alain Tapp
+	Bounds on quantum ordered searching	2000	Peter Høyer Jan Neerbek
+ PDF Chat	Tight Bounds on Quantum Searching	1999	Michel Boyer Gilles Brassard Peter Høyer Alain Tappa
+ PDF Chat	Multiparty quantum communication complexity	1999	Harry Buhrman Wim van Dam Peter Høyer Alain Tapp
+	A Quantum Observable for the Graph Isomorphism Problem	1999	Mark Ettinger Peter Høyer
+ PDF Chat	On Quantum Algorithms for Noncommutative Hidden Subgroups	1999	Mark Ettinger Peter Høyer
+	Quantum State Detection Via Elimination	1999	Jean Ettinger Peter Høyer
+	Hidden Subgroup States are Almost Orthogonal	1999	Mark Ettinger Peter Høyer Emanuel Knill
+	Parametric permutation routing via matchings	1998	Peter Høyer Kim S. Larsen
+ PDF Chat	Tight Bounds on Quantum Searching	1998	Michel Boyer Gilles Brassard Peter Høyer Alain Tapp
+ PDF Chat	Quantum cryptanalysis of hash and claw-free functions	1998	Gilles Brassard Peter Høyer Alain Tapp
+ PDF Chat	Quantum counting	1998	Gilles Brassard Peter Høyer Alain Tapp
+	Efficient Quantum Transforms	1997	Peter Høyer
+	On The Power of Exact Quantum Polynomial Time	1996	Gilles Brassard Peter Høyer
+	A Quantum Algorithm for Finding the Minimum	1996	Christoph Dürr Peter Høyer

Common Coauthors

Coauthor	Papers Together
Gilles Brassard	11
Robert Špalek	7
Ronald de Wolf	7
Barry C. Sanders	7
Alain Tapp	6
Mehdi Mhalla	5
Christoph Dürr	5
Mark Ettinger	5
Harry Buhrman	5
Miklós Sántha	4
Mark Heiligman	4
Sourav Chakraborty	3
Marc Kaplan	3
Michele Mosca	3
Sophie Laplante	3
Jan Neerbek	3
Arkadev Chattopadhyay	3
Anurag Anshu	3
Nikhil S. Mande	3
Simon Perdrix	3
Louis Salvail	3
Mark Adcock	3
Manaswi Paraashar	3
Robert R. Nerem	2
Serge Massar	2
Aleksandrs Belovs	2
Hein Röhrig	2
Jibran Rashid	2
Emanuel Knill	2
Thomas Decker	2
Frédéric Magniez	2
Abhijeet Alase	2
Gábor Ivanyos	2
Catalin Dohotaru	2
Dominic W. Berry	2
Mohsen Bagherimehrab	2
Nathan Wiebe	2
Yaoyun Shi	2
Donny Cheung	1
Zhan Yu	1
Kassem Kalach	1
Troy Lee	1
John Watrous	1
Mojtaba Komeili	1
Wim van Dam	1
Janet Leahy	1
Nathan Wiebe	1
Jean Ettinger	1
Richard Cleve	1
Ben Toner	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Strengths and Weaknesses of Quantum Computing	1997	Charles H. Bennett Ethan Bernstein Gilles Brassard Umesh Vazirani	17
+ PDF Chat	Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer	1997	Peter W. Shor	15
+ PDF Chat	Tight Bounds on Quantum Searching	1998	Michel Boyer Gilles Brassard Peter Høyer Alain Tapp	13
+ PDF Chat	An exact quantum polynomial-time algorithm for Simon's problem	2002	Gilles Brassard Peter Høyer	13
+ PDF Chat	Quantum Mechanics Helps in Searching for a Needle in a Haystack	1997	Lov K. Grover	12
+	Quantum Amplitude Amplification and Estimation	2000	Gilles Brassard Peter Høyer Michele Mosca Alain Tapp	10
+ PDF Chat	Quantum lower bounds by polynomials	2001	Robert Beals Harry Buhrman Richard Cleve Michele Mosca Ronald de Wolf	10
+	Quantum vs. classical communication and computation	1998	Harry Buhrman Richard Cleve Avi Wigderson	9
+	The quantum query complexity of approximating the median and related statistics	1999	Ashwin Nayak Felix Wu	8
+	Quantum amplitude amplification and estimation	2002	Gilles Brassard Peter Høyer Michele Mosca Alain Tapp	8
+ PDF Chat	Elementary gates for quantum computation	1995	Adriano Barenco Charles H. Bennett Richard Cleve David P. DiVincenzo Norman Margolus Peter W. Shor Tycho Sleator John A. Smolin Harald Weinfurter	6
+	Invariant Quantum Algorithms for Insertion into an Ordered List	1999	Edward Farhi Michael Sipser Sam Gutmann Jeffrey Goldstone	6
+ PDF Chat	Tight Bounds on Quantum Searching	1999	Michel Boyer Gilles Brassard Peter Høyer Alain Tappa	6
+	Quantum Lower Bounds by Polynomials	1998	Robert Beals Harry Buhrman Richard Cleve Michele Mosca Ronald de Wolf	6
+	Quantum measurements and the Abelian Stabilizer Problem	1995	Alexei Kitaev	5
+ PDF Chat	Substituting quantum entanglement for communication	1997	Richard Cleve Harry Buhrman	5
+ PDF Chat	Quantum algorithms revisited	1998	Richard Cleve Artur Ekert Chiara Macchiavello Michele Mosca	5
+ PDF Chat	Grover’s quantum searching algorithm is optimal	1999	Christof Zalka	5
+ PDF Chat	Quantum Search on Bounded-Error Inputs	2003	Peter Høyer Michele Mosca Ronald de Wolf	5
+	Quantum lower bounds by quantum arguments	2000	Andris Ambainis	5
+	Quantum measurements and the Abelian Stabilizer Problem	1995	Alexei Kitaev	5
+ PDF Chat	Quantum lower bounds for the collision and the element distinctness problems	2003	Yaoyun Shi	4
+	Lower Bounds on Quantum Query Complexity	2005	Peter Høyer Robert Špalek	4
+	An approximate Fourier transform useful in quantum factoring	2002	Don Coppersmith	4
+ PDF Chat	Limit on the Speed of Quantum Computation in Determining Parity	1998	Edward Farhi Jeffrey Goldstone Sam Gutmann Michael Sipser	4
+	Quantum lower bound for the collision problem	2002	Scott Aaronson	4
+ PDF Chat	Popescu-Rohrlich Correlations as a Unit of Nonlocality	2005	Jonathan Barrett Stefano Pironio	3
+	Efficient Classical Simulation of Continuous Variable Quantum Information Processes	2002	Stephen D. Bartlett Barry C. Sanders Samuel L. Braunstein Kae Nemoto	3
+ PDF Chat	Multiparticle Entanglement of Hot Trapped Ions	1999	Klaus Mølmer Anders S. Sørensen	3
+ PDF Chat	Contextuality supplies the ‘magic’ for quantum computation	2014	Mark Howard Joel J. Wallman Victor Veitch Joseph Emerson	3
+ PDF Chat	Multiparty quantum communication complexity	1999	Harry Buhrman Wim van Dam Peter Høyer Alain Tapp	3
+ PDF Chat	Error Correction for Continuous Quantum Variables	1998	Samuel L. Braunstein	3
+ PDF Chat	Quantum information with continuous variables	2005	Samuel L. Braunstein Peter van Loock	3
+	Generalized FFTs–A survey of some recent results	1997	David K. Maslen Daniel N. Rockmore	3
+ PDF Chat	Local orthogonality as a multipartite principle for quantum correlations	2013	T. A. Fritz Ana Belén Sainz Remigiusz Augusiak Jonatan Bohr Brask Rafael Chaves Anthony Leverrier Antonio Acín	3
+ PDF Chat	Counting, fanout and the complexity of quantum ACC	2002	F. Green Steven Homer Cristopher Moore Chris Pollett	3
+ PDF Chat	Classical simulation of quantum entanglement without local hidden variables	2001	Serge Massar Dave Bacon Nicolas J. Cerf Richard Cleve	3
+ PDF Chat	Quantum Memory for Squeezed Light	2008	J. Appel Eden Figueroa Dmitry Korystov Mirko Lobino A. I. Lvovsky	3
+ PDF Chat	On the power of non-local boxes	2005	Anne Broadbent André Allan Méthot	3
+ PDF Chat	A better lower bound for quantum algorithms searching an ordered list	2003	Andris Ambainis	3
+	On The Power of Exact Quantum Polynomial Time	1996	Gilles Brassard Peter Høyer	3
+	A lower bound on the quantum query complexity of read-once functions	2004	Howard Barnum Michael Saks	3
+ PDF Chat	Distilling Gaussian States with Gaussian Operations is Impossible	2002	Jens Eisert Stefan Scheel Martin B. Plenio	3
+ PDF Chat	Continuous Variable Quantum Cryptography Using Coherent States	2002	Frédéric Grosshans Philippe Grangier	3
+ PDF Chat	Cost of Exactly Simulating Quantum Entanglement with Classical Communication	1999	Gilles Brassard Richard Cleve Alain Tapp	3
+ PDF Chat	Family of Bell-like Inequalities as Device-Independent Witnesses for Entanglement Depth	2015	Yeong-Cherng Liang Denis Rosset Jean-Daniel Bancal Gilles Pütz Tomer Jack Barnea Nicolas Gisin	3
+ PDF Chat	Efficient Classical Simulation of Optical Quantum Information Circuits	2002	Stephen D. Bartlett Barry C. Sanders	3
+ PDF Chat	Ultraslow Propagation of Squeezed Vacuum Pulses with Electromagnetically Induced Transparency	2007	Daisuke Akamatsu Yoshihiko Yokoi Manabu Arikawa Satoshi Nagatsuka Takahito Tanimura Akira Furusawa Mikio Kozuma	3
+ PDF Chat	Parallel Quantum Computation and Quantum Codes	2001	Cristopher Moore Martin Nilsson	3
+ PDF Chat	On the Power of Ambainis’s Lower Bounds	2004	Shengyu Zhang	3