| Publication | Date of Publication | Type |
|---|
| Distributed Merlin-Arthur synthesis of quantum states and its applications | 2024-12-03 | Paper |
| Distributed quantum interactive proofs | 2024-10-08 | Paper |
| Brief announcement: Distributed quantum proofs for replicated data | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6107273 | 2023-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161152 | 2023-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090500 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005126 | 2021-08-04 | Paper |
| Generalized Quantum Arthur--Merlin Games | 2019-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601844 | 2018-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598147 | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598146 | 2017-12-19 | 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 |
| Quantum query complexity of almost all functions with fixed on-set size | 2016-11-30 | Paper |
| Quantum algorithms for finding constant-sized sub-hypergraphs | 2015-12-11 | Paper |
| Interactive proofs with quantum finite automata | 2015-01-28 | Paper |
| Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs | 2014-09-26 | Paper |
| Quantum Algorithms for Matrix Products over Semirings | 2014-09-02 | Paper |
| RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC | 2014-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3166032 | 2012-10-21 | Paper |
| Quantum counterfeit coin problems | 2012-10-11 | Paper |
| On QMA protocols with two short quantum proofs | 2012-09-05 | Paper |
| Reconstructing Strings from Substrings with Quantum Queries | 2012-08-14 | Paper |
| Computational indistinguishability between quantum states and its cryptographic application | 2012-07-10 | Paper |
| Unbounded-error quantum query complexity | 2011-09-12 | Paper |
| Quantum Counterfeit Coin Problems | 2010-12-09 | Paper |
| Polynomial time quantum computation with advice | 2009-07-21 | Paper |
| General Scheme for Perfect Quantum Network Coding with Free Classical Communication | 2009-07-14 | Paper |
| An application of quantum finite automata to interactive proof systems | 2009-04-30 | Paper |
| Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families | 2009-03-31 | Paper |
| Unbounded-Error Quantum Query Complexity | 2009-01-29 | Paper |
| Quantum Query Complexity of Boolean Functions with Small On-Sets | 2009-01-29 | Paper |
| The efficiency of quantum identity testing of multiple states | 2008-10-21 | Paper |
| Polynomial-Time Construction of Linear Network Coding | 2008-08-28 | Paper |
| Unbounded-Error Classical and Quantum Communication Complexity | 2008-05-27 | Paper |
| Computational Indistinguishability Between Quantum States and Its Cryptographic Application | 2008-05-06 | Paper |
| Unbounded-Error One-Way Classical and Quantum Communication Complexity | 2007-11-28 | Paper |
| Quantum Network Coding | 2007-09-03 | Paper |
| QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES | 2005-10-19 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| Uniformity of quantum circuit families for error-free algorithms | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736849 | 2004-08-11 | Paper |
| Computational complexity of uniform quantum circuit families and quantum Turing machines | 2002-07-15 | Paper |
| Local transition functions of quantum Turing machines | 2002-06-18 | Paper |
| Quantum oracles and computational complexity | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505574 | 2000-09-27 | Paper |
