The following pages link to Peter Høyer (Q166942):
Displayed 33 items.
- Quantum computation with coherent spin states and the close Hadamard problem (Q291464) (← links)
- Gaussian quantum computation with oracle-decision problems (Q352994) (← links)
- Simplified proof of the Fourier sampling theorem (Q1607051) (← links)
- Quantum complexities of ordered searching, sorting, and element distinctness (Q1871829) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- The quantum query complexity of the hidden subgroup problem is polynomial (Q2390280) (← links)
- QUANTUM NONLOCAL BOXES EXHIBIT STRONGER DISTILLABILITY (Q2840598) (← links)
- Quantum Circuits with Unbounded Fan-out (Q3002758) (← links)
- Improved error bounds for the adiabatic approximation (Q3095454) (← links)
- Simulating quantum dynamics on a quantum computer (Q3102253) (← links)
- (Q3396568) (← links)
- (Q3549652) (← links)
- (Q4209362) (← links)
- (Q4251065) (← links)
- (Q4418653) (← links)
- (Q4449183) (← links)
- (Q4535800) (← links)
- (Q4636641) (← links)
- (Q4637977) (← links)
- (Q4736848) (← links)
- (Q4779135) (← links)
- (Q4819589) (← links)
- (Q5111348) (← links)
- Merkle Puzzles in a Quantum World (Q5199203) (← links)
- Higher order decompositions of ordered operator exponentials (Q5305414) (← links)
- Quantum Algorithms for Element Distinctness (Q5317198) (← links)
- Resources Required for Preparing Graph States (Q5459158) (← links)
- Automata, Languages and Programming (Q5466487) (← links)
- Quantum Query Complexity of Some Graph Problems (Q5470736) (← links)
- Quantum cryptanalysis of hash and claw-free functions (Q5887414) (← links)
- Algorithms and Computation (Q5897864) (← links)
- Contextuality in multipartite pseudo-telepathy graph games (Q5915755) (← links)
- On quantum algorithms for noncommutative hidden subgroups (Q5927942) (← links)