| Publication | Date of Publication | Type |
|---|
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 |
scientific article; zbMATH DE number 6820203 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | Paper |
Power of quantum computation with few clean qubits
(available as arXiv preprint) | 2017-12-19 | 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 interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Simpler exact leader election via quantum reduction
Chicago Journal of Theoretical Computer Science | 2015-02-09 | Paper |
Quantum Merlin-Arthur proof systems: are multiple Merlins more helpful to Arthur?
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
(available as arXiv preprint) | 2012-10-21 | Paper |
Entangled games are hard to approximate
SIAM Journal on Computing | 2011-10-18 | Paper |
Entangled games are hard to approximate
SIAM Journal on Computing | 2011-10-18 | Paper |
Using entanglement in quantum multi-prover interactive proofs
Computational Complexity | 2011-02-18 | Paper |
Using entanglement in quantum multi-prover interactive proofs
Computational Complexity | 2011-02-18 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
Automata, Languages and Programming | 2009-07-14 | Paper |
Quantum measurements for hidden subgroup problems with optimal sample complexity
(available as arXiv preprint) | 2008-11-03 | Paper |
General Properties of Quantum Zero-Knowledge Proofs
Theory of Cryptography | 2008-03-05 | Paper |
Universal test for quantum one-way permutations
Theoretical Computer Science | 2005-12-06 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Quantum versus deterministic counter automata
Theoretical Computer Science | 2005-06-01 | Paper |
| scientific article; zbMATH DE number 2090014 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2013818 (Why is no real title available?) | 2003-12-07 | Paper |
scientific article; zbMATH DE number 2013818 (Why is no real title available?)
(available as arXiv preprint) | 2003-12-07 | Paper |
| scientific article; zbMATH DE number 1979492 (Why is no real title available?) | 2003-09-14 | Paper |
Quantum multi-prover interactive proof systems with limited prior entanglement.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
One-way probabilistic reversible and quantum one-counter automata.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1696659 (Why is no real title available?) | 2002-07-22 | Paper |
One-way probabilistic reversible and quantum one-counter automata
RIMS Kokyuroku | 2001-09-23 | Paper |
