Peter Høyer
Artificial Intelligence · 2000–2008
A researcher in the Science corpus: 4 papers; trusts 4 researchers and is trusted by 12 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 6 citations into it; #14,058 of 35,345 by trust here, #14,181 by citations
Whom Peter Høyer trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Peter Høyer overall
- Jerome R. Busemeyer
- Peter D. Bruza
- Andris Ambainis
- Ying Li
- Guang Hao Low
- Andrew M. Childs
- Dominic W. Berry
- Nathan Wiebe
- Daniel J. Egger
- Stefan Woerner
Papers from Peter Høyer's perspective
Ordered by how strongly the researchers Peter Høyer trusts endorse each paper. Same corpus, a different order for every researcher.
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Some optimal inapproximability results
- Multi-prover interactive proofs: how to remove intractability assumptions
- Quantum Computation and Quantum Information: Bibliography
- Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
- Notes on the history of reversible computation (IBM Journal of Research and Development)
- An Introduction to Quantum Computing (Quantum information & computation)
- Non-deterministic exponential time has two-prover interactive protocols (Computational Complexity)
- Approximating the cut-norm via Grothendieck's inequality (Symposium on the Theory of Computing)
- On the Power of Multi-Prover Interactive Protocols
Their papers
- Quantum Amplitude Amplification and Estimation (2000) — 2,053 citations
- Higher order decompositions of ordered operator exponentials (2008) — 188 citations
- Arbitrary phases in quantum amplitude amplification (2000) — 161 citations
- Consequences and limits of nonlocal strategies (2004) — 494 citations