1.4k citations · 4.4k across the 43 of their papers we have counts for
44 papers
Nonlocality distillation can outperform entanglement distillation
Peter Høyer, Jibran Rashid, Razeen ud Din
Given the goal of maximizing CHSH violation, we compare the optimal strategies of entanglement and nonlocality distillation. In the limit of the number of copies of the shared stat…
Spatial Search via Memoryless Walk with Selfloop
Peter Høyer, Janet Leahy
The defining feature of memoryless quantum walks is that they operate on the vertex space of a graph, and therefore can be used to produce search algorithms with minimal memory. We…
Tight Bound for Estimating Expectation Values from a System of Linear Equations
Abhijeet Alase, Robert R. Nerem, Mohsen Bagherimehrab +2
The System of Linear Equations Problem (SLEP) is specified by a complex invertible matrix , the condition number of , a vector , a Hermitian matrix and an accuracy…
The Role of Symmetry in Quantum Query-to-Communication Simulation
Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer +3
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of…
Analysis of Lackadaisical Quantum Walks
Peter Høyer, Zhan Yu
The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical qu…
Provably secure key establishment against quantum adversaries
Aleksandrs Belovs, Gilles Brassard, Peter Hoyer +3
At Crypto 2011, some of us had proposed a family of cryptographic protocols for key establishment capable of protecting quantum and classical legitimate parties unconditionally aga…