Hirotada Kobayashi

According to our database1, Hirotada Kobayashi authored at least 29 papers between 2001 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Generalized Quantum Arthur-Merlin Games.
SIAM J. Comput., 2019

2016
Power of Quantum Computation with Few Clean Qubits.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Space-Efficient Error Reduction for Unitary Quantum Computations.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete.
SIAM J. Comput., 2015

2014
Impossibility of Classically Simulating One-Clean-Qubit Computation.
CoRR, 2014

Simpler Exact Leader Election via Quantum Reduction.
Chic. J. Theor. Comput. Sci., 2014

2012
Exact Quantum Algorithms for the Leader Election Problem.
ACM Trans. Comput. Theory, 2012

Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems.
Quantum Inf. Comput., 2012

Quantum interactive proofs with weak error bounds.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Entangled Games Are Hard to Approximate.
SIAM J. Comput., 2011

Constructing quantum network coding schemes from classical nonlinear protocols.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Computing on Anonymous Quantum Network
CoRR, 2010

Perfect quantum network communication protocol based on classical network coding.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
Chic. J. Theor. Comput. Sci., 2009

Using Entanglement in Quantum Multi-Prover Interactive Proofs.
Comput. Complex., 2009

Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

General Scheme for Perfect Quantum Network Coding with Free Classical Communication.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008
Quantum measurements for hidden subgroup problems with optimal sample complexity.
Quantum Inf. Comput., 2008

General Properties of Quantum Zero-Knowledge Proofs.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2005
Quantum versus deterministic counter automata.
Theor. Comput. Sci., 2005

Universal test for quantum one-way permutations.
Theor. Comput. Sci., 2005

2003
Quantum multi-prover interactive proof systems with limited prior entanglement.
J. Comput. Syst. Sci., 2003

Non-interactive Quantum Perfect and Statistical Zero-Knowledge.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
One-way probabilistic reversible and quantum one-counter automata.
Theor. Comput. Sci., 2002

An Analysis of Absorbing Times of Quantum Walks.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

2001
Quantum Certificate Verification: Single versus Multiple Quantum Certificates
CoRR, 2001

Two-way Quantum One-counter Automata
CoRR, 2001


  Loading...