|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 7 keywords
|
|
|
|
|
Results
Found 36 publication records. Showing 36 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto |
Exact Quantum Algorithms for the Leader Election Problem.  |
TOCT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsuyoshi Ito, Hirotada Kobayashi, John Watrous |
Quantum interactive proofs with weak error bounds. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick |
Entangled Games Are Hard to Approximate. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler |
Constructing quantum network coding schemes from classical nonlinear protocols. |
ISIT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Roetteler |
Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tsuyoshi Ito, Hirotada Kobayashi, John Watrous |
Quantum interactive proofs with weak error bounds |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani |
Computing on Anonymous Quantum Network |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler |
Perfect quantum network communication protocol based on classical network coding. |
ISIT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami |
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? |
Chicago J. Theor. Comput. Sci. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick |
Using Entanglement in Quantum Multi-Prover Interactive Proofs. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 03D15, 81P68, 68Q15, 68Q10 |
| 1 | Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler |
General Scheme for Perfect Quantum Network Coding with Free Classical Communication |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler |
Perfect Quantum Network Communication Protocol Based on Classical Network Coding |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler |
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani |
Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
quantum computing, leader election, anonymous networks |
| 1 | Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto |
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi |
Quantum measurements for hidden subgroup problems with optimal sample complexity. |
Quantum Information & Computation |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto |
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hirotada Kobayashi |
General Properties of Quantum Zero-Knowledge Proofs. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick |
Entangled Games are Hard to Approximate. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao |
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
multi-prover interactive proof systems, quantum nonlocality, Tsirelson inequality, entanglement |
| 1 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick |
Using Entanglement in Quantum Multi-prover Interactive Proofs. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
quantum interactive proofs, public-coin, parallelization, entanglement |
| 1 | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai |
Quantum versus deterministic counter automata. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra |
Universal test for quantum one-way permutations. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto |
Exact Quantum Algorithms for the Leader Election Problem. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra |
Universal Test for Quantum One-Way Permutations. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto |
Quantum multi-prover interactive proof systems with limited prior entanglement. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami |
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotada Kobayashi |
Non-interactive Quantum Perfect and Statistical Zero-Knowledge. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai |
One-way probabilistic reversible and quantum one-counter automata. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai |
An Analysis of Absorbing Times of Quantum Walks. |
UMC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai |
Quantum versus Deterministic Counter Automata. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto |
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto |
Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai |
Two-way Quantum One-counter Automata |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami |
Quantum Certificate Verification: Single versus Multiple Quantum Certificates |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai |
One-Way Probabilistic Reversible and Quantum One-Counter Automata. |
COCOON |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #36 of 36 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")