| Publication | Date of Publication | Type |
|---|
Distributed Merlin-Arthur synthesis of quantum states and its applications
| 2024-12-03 | Paper |
Faster rectangular matrix multiplication by combination loss analysis
| 2024-11-28 | Paper |
Improved hardness results for the guided local Hamiltonian problem
| 2024-11-14 | Paper |
Distributed quantum interactive proofs
| 2024-10-08 | Paper |
An optimal oracle separation of classical and quantum hybrid schemes
| 2024-09-11 | Paper |
scientific article; zbMATH DE number 7829267 (Why is no real title available?)
| 2024-04-09 | Paper |
Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
| 2024-04-09 | Paper |
scientific article; zbMATH DE number 7788509 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788647 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788631 (Why is no real title available?)
| 2024-01-15 | Paper |
Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Fast distributed algorithms for girth, cycles and small subgraphs
| 2023-11-02 | Paper |
Brief announcement: Distributed quantum proofs for replicated data
| 2023-11-02 | Paper |
Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture
SIAM Journal on Computing | 2023-09-06 | Paper |
scientific article; zbMATH DE number 7724232 (Why is no real title available?)
| 2023-08-08 | Paper |
Bounds on oblivious multiparty quantum communication complexity
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Quantum logarithmic space and post-selection
| 2023-06-26 | Paper |
Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
Algorithmica | 2023-04-28 | Paper |
scientific article; zbMATH DE number 7650908 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7564421 (Why is no real title available?)
| 2022-07-27 | Paper |
scientific article; zbMATH DE number 7559424 (Why is no real title available?)
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559158 (Why is no real title available?)
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7378343 (Why is no real title available?)
| 2021-08-04 | Paper |
Probabilistic logarithmic-space algorithms for Laplacian solvers
| 2021-07-28 | Paper |
Quantum speedup for the minimum Steiner tree problem
| 2021-04-21 | Paper |
On Distributed Listing of Cliques
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Barriers for rectangular matrix multiplication
| 2020-03-05 | Paper |
Sublinear-time quantum computation of the diameter in CONGEST networks
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
| 2019-05-10 | Paper |
Generalized quantum Arthur-Merlin games
SIAM Journal on Computing | 2019-05-07 | Paper |
Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
| 2018-08-16 | Paper |
Multiparty quantum communication complexity of triangle finding
| 2018-05-03 | Paper |
scientific article; zbMATH DE number 6851887 (Why is no real title available?)
| 2018-03-21 | Paper |
Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
| 2018-03-15 | Paper |
Generalized quantum Arthur-Merlin games
| 2018-01-24 | Paper |
Quantum algorithm for triangle finding in sparse graphs
Algorithmica | 2017-11-09 | Paper |
Quantum query complexity of unitary operator discrimination
| 2017-10-23 | Paper |
Triangle Finding and Listing in CONGEST Networks
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Quantum algorithms for matrix products over semirings
Chicago Journal of Theoretical Computer Science | 2017-09-26 | Paper |
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Stronger methods of making quantum interactive proofs perfectly complete
SIAM Journal on Computing | 2017-01-13 | Paper |
Improving quantum query complexity of Boolean matrix multiplication using graph collision
Algorithmica | 2016-11-01 | Paper |
On the Group and Color Isomorphism Problems
| 2016-09-27 | Paper |
Quantum algorithm for triangle finding in sparse graphs
Lecture Notes in Computer Science | 2016-01-11 | Paper |
Quantum algorithms for finding constant-sized sub-hypergraphs
Theoretical Computer Science | 2015-12-11 | Paper |
Powers of tensors and fast matrix multiplication
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Quantum complexity of Boolean matrix multiplication and related problems
Computing with New Resources | 2015-09-08 | Paper |
Fast matrix multiplication: limitations of the Coppersmith-Winograd method (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Quantum algorithms for matrix products over semirings
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
The one-way communication complexity of subgroup membership
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science | 2013-12-11 | Paper |
Property testing for cyclic groups and beyond
Journal of Combinatorial Optimization | 2013-12-09 | Paper |
A time-efficient output-sensitive quantum algorithm for Boolean matrix multiplication
Algorithms and Computation | 2013-03-21 | Paper |
Quantum private information retrieval with sublinear communication complexity
Theory of Computing | 2012-09-27 | Paper |
On QMA protocols with two short quantum proofs
Quantum Information & Computation | 2012-09-05 | Paper |
Reconstructing strings from substrings with quantum queries
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
On the distance between non-isomorphic groups.
European Journal of Combinatorics | 2012-05-04 | Paper |
Efficient isomorphism testing for a class of group extensions
| 2012-04-24 | Paper |
An efficient quantum algorithm for some instances of the group isomorphism problem
| 2012-01-23 | Paper |
The quantum query complexity of certification
| 2011-10-05 | Paper |
Property testing for cyclic groups and beyond
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Quantum property testing of group solvability
Algorithmica | 2011-03-02 | Paper |
Exponential separation of quantum and classical online space complexity
Theory of Computing Systems | 2009-10-19 | Paper |
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
Automata, Languages and Programming | 2009-07-14 | Paper |
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
| 2008-09-03 | Paper |
Quantum property testing of group solvability
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Quantum Weakly Nondeterministic Communication Complexity
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Online Locality Meets Distributed Quantum Computing
| N/A | Paper |
