| Publication | Date of Publication | Type |
|---|
| Distributed quantum proofs for replicated data | 2026-04-15 | Paper |
| On the power of quantum distributed proofs | 2025-06-13 | Paper |
| 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 |
Communication complexity of private simultaneous quantum messages protocols
(available as arXiv preprint) | 2023-07-03 | Paper |
Quantum logarithmic space and post-selection
(available as arXiv preprint) | 2023-06-26 | Paper |
Quantum advantage for the LOCAL model in distributed computing
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7378343 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Generalized quantum Arthur-Merlin games
SIAM Journal on Computing | 2019-05-07 | Paper |
Generalized quantum Arthur-Merlin games
(available as arXiv preprint) | 2018-01-24 | Paper |
Power of quantum computation with few clean qubits
(available as arXiv preprint) | 2017-12-19 | Paper |
scientific article; zbMATH DE number 6820203 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | 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 |
Quantum query complexity of almost all functions with fixed on-set size
Computational Complexity | 2016-11-30 | Paper |
Quantum algorithms for finding constant-sized sub-hypergraphs
Theoretical Computer Science | 2015-12-11 | Paper |
Interactive proofs with quantum finite automata
Theoretical Computer Science | 2015-01-28 | 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 |
RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
(available as arXiv preprint) | 2012-10-21 | Paper |
Quantum counterfeit coin problems
Theoretical Computer Science | 2012-10-11 | 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 |
Computational indistinguishability between quantum states and its cryptographic application
Journal of Cryptology | 2012-07-10 | Paper |
Unbounded-error quantum query complexity
Theoretical Computer Science | 2011-09-12 | Paper |
Quantum counterfeit coin problems
Algorithms and Computation | 2010-12-09 | Paper |
Polynomial time quantum computation with advice
Information Processing Letters | 2009-07-21 | Paper |
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
Automata, Languages and Programming | 2009-07-14 | Paper |
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences | 2009-04-30 | Paper |
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
Quantum Information Processing | 2009-03-31 | Paper |
Quantum Query Complexity of Boolean Functions with Small On-Sets
Algorithms and Computation | 2009-01-29 | Paper |
Unbounded-Error Quantum Query Complexity
Algorithms and Computation | 2009-01-29 | Paper |
The efficiency of quantum identity testing of multiple states
Journal of Physics A: Mathematical and Theoretical | 2008-10-21 | Paper |
Polynomial-Time Construction of Linear Network Coding
Automata, Languages and Programming | 2008-08-28 | Paper |
Unbounded-Error Classical and Quantum Communication Complexity
Algorithms and Computation | 2008-05-27 | Paper |
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Unbounded-Error One-Way Classical and Quantum Communication Complexity
Automata, Languages and Programming | 2007-11-28 | Paper |
Quantum Network Coding
STACS 2007 | 2007-09-03 | Paper |
QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Uniformity of quantum circuit families for error-free algorithms
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 2086395 (Why is no real title available?) | 2004-08-11 | Paper |
Computational complexity of uniform quantum circuit families and quantum Turing machines
Theoretical Computer Science | 2002-07-15 | Paper |
Local transition functions of quantum Turing machines
RAIRO. Theoretical Informatics and Applications | 2002-06-18 | Paper |
Local transition functions of quantum Turing machines
RAIRO. Theoretical Informatics and Applications | 2002-06-18 | Paper |
Quantum oracles and computational complexity
RIMS Kokyuroku | 2001-09-23 | Paper |
| scientific article; zbMATH DE number 1511885 (Why is no real title available?) | 2000-09-27 | Paper |
