| 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 |
| https://portal.mardi4nfdi.de/entity/Q6126262 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126342 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147429 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147575 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187826 | 2024-01-15 | Paper |
| Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture | 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 | 2023-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168476 | 2023-08-08 | Paper |
| Bounds on oblivious multiparty quantum communication complexity | 2023-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161152 | 2023-06-26 | Paper |
| Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems | 2023-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874294 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091772 | 2022-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089222 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090500 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005126 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002644 | 2021-07-28 | Paper |
| Quantum speedup for the minimum Steiner tree problem | 2021-04-21 | Paper |
| On Distributed Listing of Cliques | 2021-03-15 | Paper |
| Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model | 2021-01-20 | Paper |
| Barriers for rectangular matrix multiplication | 2020-03-05 | Paper |
| Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks | 2019-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743491 | 2019-05-10 | Paper |
| Generalized Quantum Arthur--Merlin Games | 2019-05-07 | Paper |
| Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems | 2018-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4637980 | 2018-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608617 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607951 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601844 | 2018-01-24 | Paper |
| Quantum algorithm for triangle finding in sparse graphs | 2017-11-09 | Paper |
| Quantum query complexity of unitary operator discrimination | 2017-10-23 | Paper |
| Triangle Finding and Listing in CONGEST Networks | 2017-10-11 | Paper |
| Quantum Algorithms for Matrix Products over Semirings | 2017-09-26 | Paper |
| Stronger methods of making quantum interactive proofs perfectly complete | 2017-05-16 | Paper |
| Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete | 2017-01-13 | Paper |
| Improving quantum query complexity of Boolean matrix multiplication using graph collision | 2016-11-01 | Paper |
| On the Group and Color Isomorphism Problems | 2016-09-27 | Paper |
| Quantum algorithm for triangle finding in sparse graphs | 2016-01-11 | Paper |
| Quantum algorithms for finding constant-sized sub-hypergraphs | 2015-12-11 | Paper |
| Powers of tensors and fast matrix multiplication | 2015-11-11 | Paper |
| Quantum Complexity of Boolean Matrix Multiplication and Related Problems | 2015-09-08 | Paper |
| Fast Matrix Multiplication | 2015-08-21 | Paper |
| Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs | 2014-09-26 | Paper |
| Quantum Algorithms for Matrix Products over Semirings | 2014-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414595 | 2014-05-06 | Paper |
| Quantum weakly nondeterministic communication complexity | 2013-12-11 | Paper |
| Property testing for cyclic groups and beyond | 2013-12-09 | Paper |
| Improving quantum query complexity of Boolean matrix multiplication using graph collision | 2013-08-12 | Paper |
| A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication | 2013-03-21 | Paper |
| Quantum private information retrieval with sublinear communication complexity | 2012-09-27 | Paper |
| On QMA protocols with two short quantum proofs | 2012-09-05 | Paper |
| Reconstructing Strings from Substrings with Quantum Queries | 2012-08-14 | Paper |
| On the distance between non-isomorphic groups. | 2012-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5390013 | 2012-04-24 | Paper |
| An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172424 | 2011-10-05 | Paper |
| Property testing for cyclic groups and beyond | 2011-08-17 | Paper |
| Quantum property testing of group solvability | 2011-03-02 | Paper |
| Exponential separation of quantum and classical online space complexity | 2009-10-19 | Paper |
| General Scheme for Perfect Quantum Network Coding with Free Classical Communication | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522641 | 2008-09-03 | Paper |
| Quantum property testing of group solvability | 2008-04-15 | Paper |
| Quantum Weakly Nondeterministic Communication Complexity | 2007-09-05 | Paper |
| Online Locality Meets Distributed Quantum Computing | N/A | Paper |
