The following pages link to Robin Kothari (Q334913):
Displaying 30 items.
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- The Quantum Query Complexity of Read-Many Formulas (Q2912853) (← links)
- (Q2958409) (← links)
- (Q2958412) (← links)
- (Q2965510) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
- Simulating Sparse Hamiltonians with Star Decompositions (Q3070979) (← links)
- (Q3113728) (← links)
- (Q3172449) (← links)
- (Q4577913) (← links)
- (Q4598199) (← links)
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision (Q4602374) (← links)
- Quantum Query Complexity of Minor-Closed Graph Properties (Q4910570) (← links)
- (Q5089146) (← links)
- (Q5092454) (← links)
- (Q5111154) (← links)
- (Q5140844) (← links)
- Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians (Q5149753) (← links)
- Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits (Q5212793) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5230298) (← links)
- Quantum algorithms and approximating polynomials for composed functions with shared inputs (Q5236223) (← links)
- Time-Efficient Quantum Walks for 3-Distinctness (Q5326554) (← links)
- (Q5351943) (← links)
- Separations in query complexity using cheat sheets (Q5361886) (← links)
- (Q5368738) (← links)
- Nested Quantum Walks with Quantum Data Structures (Q5741815) (← links)
- (Q5874395) (← links)
- (Q6062152) (← links)
- Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians (Q6139830) (← links)
- Mean estimation when you have the source code; or, quantum Monte Carlo methods (Q6407965) (← links)
