| Publication | Date of Publication | Type |
|---|
Quantum majority vote
| 2024-09-25 | Paper |
Quantum algorithms for learning a hidden graph
| 2024-06-27 | Paper |
The quantum complexity of computing Schatten \(p\)-norms
| 2023-04-26 | Paper |
scientific article; zbMATH DE number 7651028 (Why is no real title available?)
| 2023-02-07 | Paper |
Quantum majority vote
| 2022-11-21 | Paper |
Quantum vs. classical algorithms for solving the heat equation
Communications in Mathematical Physics | 2022-09-27 | Paper |
Universal qudit Hamiltonians
Communications in Mathematical Physics | 2021-04-15 | Paper |
Computational complexity, step by step
Science | 2020-03-04 | Paper |
Universal quantum Hamiltonians
Proceedings of the National Academy of Sciences | 2019-07-03 | Paper |
Quantum-walk speedup of backtracking algorithms
Theory of Computing | 2019-01-31 | Paper |
Sequential measurements, disturbance and property testing
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Quantum key search with side channel advice
| 2018-04-26 | Paper |
Nonadaptive quantum query complexity
Information Processing Letters | 2017-11-03 | Paper |
Quantum speedup of Monte Carlo methods
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-09-29 | Paper |
Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
Journal of Physics A: Mathematical and Theoretical | 2017-03-23 | Paper |
Quantum pattern matching fast on average
Algorithmica | 2017-03-06 | Paper |
Complexity classification of local Hamiltonian problems
SIAM Journal on Computing | 2016-04-11 | Paper |
Quantum reverse hypercontractivity
Journal of Mathematical Physics | 2015-11-06 | Paper |
Limitations on quantum dimensionality reduction
| 2015-10-09 | Paper |
On exact quantum query complexity
Algorithmica | 2015-06-25 | Paper |
A composition theorem for decision tree complexity
Chicago Journal of Theoretical Computer Science | 2014-09-24 | Paper |
Quantum Boolean functions
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Almost all decision trees do not allow significant quantum speed-up
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Testing product states, quantum Merlin-Arthur games and tensor optimization
Journal of the ACM | 2014-02-17 | Paper |
Some applications of hypercontractive inequalities in quantum information theory
Journal of Mathematical Physics | 2014-01-14 | Paper |
Weak multiplicativity for random quantum channels
Communications in Mathematical Physics | 2013-06-26 | Paper |
The complexity of flood filling games
Theory of Computing Systems | 2012-12-06 | Paper |
The quantum query complexity of learning multilinear polynomials
Information Processing Letters | 2012-07-25 | Paper |
A new exponential separation between quantum and classical one-way communication complexity
| 2011-12-19 | Paper |
Unbounded-error quantum query complexity
Theoretical Computer Science | 2011-09-12 | Paper |
Limitations on quantum dimensionality reduction
Automata, Languages and Programming | 2011-07-06 | Paper |
Quantum search with advice
Theory of Quantum Computation, Communication, and Cryptography | 2011-01-28 | Paper |
Quantum search of partially ordered sets
| 2009-10-12 | Paper |
Quantum algorithms for shifted subset problems
| 2009-06-23 | Paper |
On the quantum chromatic number of a graph
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Unbounded-Error Quantum Query Complexity
Algorithms and Computation | 2009-01-29 | Paper |
Counterexamples to additivity of minimum output \(p\)-Rényi entropy for \(p\) close to 0
Communications in Mathematical Physics | 2009-01-12 | Paper |
On the dimension of subspaces with bounded Schmidt rank
Journal of Mathematical Physics | 2008-12-08 | Paper |
On the distinguishability of random quantum states
Communications in Mathematical Physics | 2008-09-23 | Paper |
Quantum walks on directed graphs
| 2008-09-03 | Paper |
A Lower Bound on Entanglement-Assisted Quantum Communication Complexity
Automata, Languages and Programming | 2007-11-28 | Paper |
