The following pages link to Richard Cleve (Q387017):
Displaying 20 items.
- Quantum entanglement and the communication complexity of the inner product function (Q387020) (← links)
- The query complexity of order-finding (Q596296) (← links)
- Towards optimal simulations of formulas by bounded-width programs (Q685723) (← links)
- Efficient quantum algorithms for simulating sparse Hamiltonians (Q883042) (← links)
- Perfect parallel repetition theorem for quantum XOR proof systems (Q937205) (← links)
- Quantum lower bounds for the Goldreich-Levin problem (Q1045938) (← links)
- A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\) (Q1204480) (← links)
- Teleportation as a quantum computation. (Q1586918) (← links)
- Sharp quantum versus classical query complexity separations (Q1871634) (← links)
- Oracles and queries that are sufficient for exact learning (Q1924380) (← links)
- Quantum Entanglement and Communication Complexity (Q2706137) (← links)
- Reconstructing Strings from Substrings with Quantum Queries (Q2904573) (← links)
- Perfect commuting-operator strategies for linear system games (Q2963285) (← links)
- Perfect embezzlement of entanglement (Q2963287) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
- Discrete-query quantum algorithm for NAND trees (Q3002804) (← links)
- (Q3181590) (← links)
- (Q3210165) (← links)
- Efficient Quantum Algorithms for Simulating Lindblad Evolution (Q5111346) (← links)
- Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement (Q6310465) (← links)
