Author Description

Login to generate an author description

Ask a Question About This Mathematician

All published works (64)

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

Commonly Cited References

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