default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHirotada Kobayashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j14]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
:
Generalized Quantum Arthur-Merlin Games. SIAM J. Comput. 48(3): 865-902 (2019)- 2016
- [c22]Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani:
Power of Quantum Computation with Few Clean Qubits. ICALP 2016: 13:1-13:14 - [c21]Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura:
Space-Efficient Error Reduction for Unitary Quantum Computations. ICALP 2016: 14:1-14:14 - [i15]Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura:
Space-Efficient Error Reduction for Unitary Quantum Computations. CoRR abs/1604.08192 (2016) - 2015
- [j13]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. SIAM J. Comput. 44(2): 243-289 (2015) - [c20]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Generalized Quantum Arthur-Merlin Games. CCC 2015: 488-511 - [i14]Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani:
Power of Quantum Computation with Few Clean Qubits. CoRR abs/1509.07276 (2015) - 2014
- [j12]Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani:
Simpler Exact Leader Election via Quantum Reduction. Chic. J. Theor. Comput. Sci. 2014 (2014) - [i13]Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani:
Impossibility of Classically Simulating One-Clean-Qubit Computation. CoRR abs/1409.6777 (2014) - 2013
- [c19]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Stronger methods of making quantum interactive proofs perfectly complete. ITCS 2013: 329-352 - [i12]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Generalized Quantum Arthur-Merlin Games. CoRR abs/1312.4673 (2013) - 2012
- [j11]Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, Harumichi Nishimura:
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. Quantum Inf. Comput. 12(5-6): 461-471 (2012) - [j10]Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. ACM Trans. Comput. Theory 4(1): 1:1-1:24 (2012) - [c18]Tsuyoshi Ito, Hirotada Kobayashi, John Watrous:
Quantum interactive proofs with weak error bounds. ITCS 2012: 266-275 - [i11]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. CoRR abs/1210.1290 (2012) - 2011
- [j9]Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick:
Entangled Games Are Hard to Approximate. SIAM J. Comput. 40(3): 848-877 (2011) - [c17]Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler:
Constructing quantum network coding schemes from classical nonlinear protocols. ISIT 2011: 109-113 - 2010
- [c16]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
Perfect quantum network communication protocol based on classical network coding. ISIT 2010: 2686-2690 - [i10]Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani:
Computing on Anonymous Quantum Network. CoRR abs/1001.5307 (2010) - [i9]Tsuyoshi Ito, Hirotada Kobayashi, John Watrous:
Quantum interactive proofs with weak error bounds. CoRR abs/1012.4427 (2010) - [i8]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Roetteler:
Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols. CoRR abs/1012.4583 (2010)
2000 – 2009
- 2009
- [j8]Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick:
Using Entanglement in Quantum Multi-Prover Interactive Proofs. Comput. Complex. 18(2): 273-307 (2009) - [j7]Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami:
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? Chic. J. Theor. Comput. Sci. 2009 (2009) - [c15]Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto:
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. CCC 2009: 217-228 - [c14]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. ICALP (1) 2009: 622-633 - [c13]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: 334-335 - [i7]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
Perfect Quantum Network Communication Protocol Based on Classical Network Coding. CoRR abs/0902.1299 (2009) - [i6]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. CoRR abs/0908.1457 (2009) - 2008
- [j6]Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi:
Quantum measurements for hidden subgroup problems with optimal sample complexity. Quantum Inf. Comput. 8(3): 345-358 (2008) - [c12]Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao:
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. CCC 2008: 187-198 - [c11]Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick:
Using Entanglement in Quantum Multi-prover Interactive Proofs. CCC 2008: 211-222 - [c10]Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick:
Entangled Games are Hard to Approximate. FOCS 2008: 447-456 - [c9]Hirotada Kobayashi:
General Properties of Quantum Zero-Knowledge Proofs. TCC 2008: 107-124 - [i5]Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto:
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. CoRR abs/0810.0693 (2008) - 2007
- [i4]Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. CoRR abs/0712.4213 (2007) - 2006
- [j5]Hirotada Kobayashi, François Le Gall:
Dihedral Hidden Subgroup Problem: A Survey. Inf. Media Technol. 1(1): 178-185 (2006) - 2005
- [j4]Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:
Quantum versus deterministic counter automata. Theor. Comput. Sci. 334(1-3): 275-297 (2005) - [j3]Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra:
Universal test for quantum one-way permutations. Theor. Comput. Sci. 345(2-3): 370-385 (2005) - [c8]Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. STACS 2005: 581-592 - 2004
- [c7]Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra:
Universal Test for Quantum One-Way Permutations. MFCS 2004: 839-850 - 2003
- [j2]Hirotada Kobayashi, Keiji Matsumoto:
Quantum multi-prover interactive proof systems with limited prior entanglement. J. Comput. Syst. Sci. 66(3): 429-450 (2003) - [c6]Hirotada Kobayashi:
Non-interactive Quantum Perfect and Statistical Zero-Knowledge. ISAAC 2003: 178-188 - [c5]Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami:
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? ISAAC 2003: 189-198 - 2002
- [j1]Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai:
One-way probabilistic reversible and quantum one-counter automata. Theor. Comput. Sci. 289(2): 963-976 (2002) - [c4]Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:
Quantum versus Deterministic Counter Automata. COCOON 2002: 584-594 - [c3]Hirotada Kobayashi, Keiji Matsumoto:
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. ISAAC 2002: 115-127 - [c2]Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:
An Analysis of Absorbing Times of Quantum Walks. UMC 2002: 315-330 - 2001
- [i3]Hirotada Kobayashi, Keiji Matsumoto:
Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement. CoRR cs.CC/0102013 (2001) - [i2]Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:
Two-way Quantum One-counter Automata. CoRR cs.CC/0110005 (2001) - [i1]Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami:
Quantum Certificate Verification: Single versus Multiple Quantum Certificates. CoRR quant-ph/0110006 (2001) - 2000
- [c1]Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai:
One-Way Probabilistic Reversible and Quantum One-Counter Automata. COCOON 2000: 436-446
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
