default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarumichi Nishimura
Person information
- affiliation: Nagoya University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c34]Atsuya Hasegawa
, Srijita Kundu, Harumichi Nishimura:
On the Power of Quantum Distributed Proofs. PODC 2024: 220-230- [i41]Atsuya Hasegawa, Srijita Kundu, Harumichi Nishimura:
On the Power of Quantum Distributed Proofs. CoRR abs/2403.14108 (2024) - [i40]François Le Gall, Yupan Liu, Harumichi Nishimura, Qisheng Wang:
Space-bounded quantum interactive proof systems. Electron. Colloquium Comput. Complex. TR24: TR24-167 (2024) - 2023
- [c33]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. MFCS 2023: 63:1-63:15 - [c32]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Quantum Interactive Proofs. STACS 2023: 42:1-42:21 - 2022
- [c31]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Brief Announcement: Distributed Quantum Interactive Proofs. DISC 2022: 48:1-48:3 - [i39]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. CoRR abs/2210.01389 (2022) - [i38]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Quantum Interactive Proofs. CoRR abs/2210.01390 (2022) - 2021
- [c30]Akinori Kawachi, Harumichi Nishimura:
Communication Complexity of Private Simultaneous Quantum Messages Protocols. ITC 2021: 20:1-20:19 - [c29]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Distributed Quantum Proofs for Replicated Data. ITCS 2021: 28:1-28:20 - [c28]François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz:
Quantum Logarithmic Space and Post-Selection. TQC 2021: 10:1-10:17 - [i37]François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz:
Quantum Logarithmic Space and Post-selection. CoRR abs/2105.02681 (2021) - [i36]Akinori Kawachi, Harumichi Nishimura:
Communication Complexity of Private Simultaneous Quantum Messages Protocols. CoRR abs/2105.07120 (2021) - [i35]Akinori Kawachi, Harumichi Nishimura:
Communication Complexity of Private simultaneous Quantum Messages Protocols. IACR Cryptol. ePrint Arch. 2021: 636 (2021) - 2020
- [j28]Tomoyuki Morimae, Harumichi Nishimura:
Rational proofs for quantum computing. Quantum Inf. Comput. 20(3&4): 181-193 (2020) - [c27]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC 2020: 43:1-43:3 - [i34]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Distributed Quantum Proofs for Replicated Data. CoRR abs/2002.10018 (2020)
2010 – 2019
- 2019
- [j27]Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani:
Impossibility of blind quantum sampling for classical client. Quantum Inf. Comput. 19(9&10): 793-806 (2019) - [j26]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Generalized Quantum Arthur-Merlin Games. SIAM J. Comput. 48(3): 865-902 (2019) - [c26]François Le Gall, Harumichi Nishimura, Ansis Rosmanis:
Quantum Advantage for the LOCAL Model in Distributed Computing. STACS 2019: 49:1-49:14 - 2018
- [c25]François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi:
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. MFCS 2018: 26:1-26:13 - [i33]Tomoyuki Morimae, Harumichi Nishimura:
Rational proofs for quantum computing. CoRR abs/1804.08868 (2018) - [i32]François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi:
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. CoRR abs/1805.03385 (2018) - [i31]François Le Gall, Harumichi Nishimura, Ansis Rosmanis:
Quantum Advantage for the LOCAL Model in Distributed Computing. CoRR abs/1810.10838 (2018) - [i30]Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani:
Impossibility of blind quantum sampling for classical client. CoRR abs/1812.03703 (2018) - 2017
- [j25]François Le Gall, Harumichi Nishimura:
Quantum Algorithms for Matrix Products over Semirings. Chic. J. Theor. Comput. Sci. 2017 (2017) - [j24]Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall:
Modified Group Non-Membership is in Promise-AWPP relative to group oracles. Quantum Inf. Comput. 17(3&4): 242-250 (2017) - [j23]Tomoyuki Morimae, Harumichi Nishimura:
Merlinization of complexity classes above BQP. Quantum Inf. Comput. 17(11&12): 959-972 (2017) - [i29]Tomoyuki Morimae, Harumichi Nishimura:
Merlinization of complexity classes above BQP. CoRR abs/1704.01514 (2017) - [i28]Tomoyuki Morimae, Yuki Takeuchi, Harumichi Nishimura:
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy. CoRR abs/1711.10605 (2017) - 2016
- [j22]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Quantum Query Complexity of Almost All Functions with Fixed On-set Size. Comput. Complex. 25(4): 723-735 (2016) - [j21]Tomoyuki Morimae, Harumichi Nishimura:
Quantum interpretations of AWPP and APP. Quantum Inf. Comput. 16(5&6): 498-514 (2016) - [j20]François Le Gall, Harumichi Nishimura, Seiichiro Tani:
Quantum algorithms for finding constant-sized sub-hypergraphs. Theor. Comput. Sci. 609: 569-582 (2016) - [c24]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 - [c23]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 - [i27]Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall:
Modified group non-membership is in AWPP. CoRR abs/1602.06073 (2016) - [i26]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) - [i25]Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura:
Quantum Merlin-Arthur with noisy channel. CoRR abs/1608.04829 (2016) - [i24]Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura:
Power of one non-clean qubit. CoRR abs/1610.07244 (2016) - 2015
- [j19]Tomoyuki Morimae, Masahito Hayashi, Harumichi Nishimura, Keisuke Fujii:
Quantum Merlin-Arthur with Clifford Arthur. Quantum Inf. Comput. 15(15&16): 1420-1430 (2015) - [j18]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) - [j17]Harumichi Nishimura, Tomoyuki Yamakami:
Interactive proofs with quantum finite automata. Theor. Comput. Sci. 568: 1-18 (2015) - [c22]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Generalized Quantum Arthur-Merlin Games. CCC 2015: 488-511 - [i23]Tomoyuki Morimae, Harumichi Nishimura:
Power of quantum computing with restricted postselections. CoRR abs/1502.00067 (2015) - [i22]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
- [c21]François Le Gall, Harumichi Nishimura, Seiichiro Tani:
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. COCOON 2014: 429-440 - [c20]Harumichi Nishimura:
Quantum network coding and the current status of its studies. ISITA 2014: 331-334 - [c19]François Le Gall, Harumichi Nishimura:
Quantum Algorithms for Matrix Products over Semirings. SWAT 2014: 331-343 - [i21]Harumichi Nishimura, Tomoyuki Yamakami:
Interactive Proofs with Quantum Finite Automata. CoRR abs/1401.2929 (2014) - [i20]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
- [j16]Kazuo Iwama, Harumichi Nishimura:
Recovering Strings in Oracles: Quantum and Classic. Int. J. Found. Comput. Sci. 24(7): 979-994 (2013) - [c18]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Stronger methods of making quantum interactive proofs perfectly complete. ITCS 2013: 329-352 - [c17]Harumichi Nishimura:
Quantum network coding - How can network coding be applied to quantum information? NetCod 2013: 1-5 - [i19]François Le Gall, Harumichi Nishimura:
Quantum Algorithms for Matrix Products over Semirings. CoRR abs/1310.3898 (2013) - [i18]François Le Gall, Harumichi Nishimura, Seiichiro Tani:
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs. CoRR abs/1310.4127 (2013) - [i17]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Generalized Quantum Arthur-Merlin Games. CoRR abs/1312.4673 (2013) - 2012
- [j15]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. J. Cryptol. 25(3): 528-555 (2012) - [j14]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) - [j13]François Le Gall, Shota Nakagawa, Harumichi Nishimura:
On QMA protocols with two short quantum proofs. Quantum Inf. Comput. 12(7-8): 589-600 (2012) - [j12]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum counterfeit coin problems. Theor. Comput. Sci. 456: 51-64 (2012) - [c16]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. SWAT 2012: 388-397 - [i16]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. CoRR abs/1204.4691 (2012) - [i15]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. CoRR abs/1210.1290 (2012) - 2011
- [j11]Ashley Montanaro, Harumichi Nishimura, Rudy Raymond:
Unbounded-error quantum query complexity. Theor. Comput. Sci. 412(35): 4619-4628 (2011) - [c15]Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler:
Constructing quantum network coding schemes from classical nonlinear protocols. ISIT 2011: 109-113 - [i14]François Le Gall, Shota Nakagawa, Harumichi Nishimura:
On QMA Protocols with Two Short Quantum Proofs. CoRR abs/1108.4306 (2011) - 2010
- [c14]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. ISAAC (1) 2010: 85-96 - [c13]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 - [i13]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. CoRR abs/1009.0416 (2010) - [i12]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
- [j10]Harumichi Nishimura, Rudy Raymond:
Quantum Random Access Coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(5): 1268-1275 (2009) - [j9]Harumichi Nishimura, Tomoyuki Yamakami:
An application of quantum finite automata to interactive proof systems. J. Comput. Syst. Sci. 75(4): 255-269 (2009) - [j8]Harumichi Nishimura, Masanao Ozawa:
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families. Quantum Inf. Process. 8(1): 13-24 (2009) - [c12]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 - [i11]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) - [i10]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) - [i9]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size. CoRR abs/0908.2468 (2009) - 2008
- [c11]Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita:
Polynomial-Time Construction of Linear Network Coding. ICALP (1) 2008: 271-282 - [c10]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Quantum Query Complexity of Boolean Functions with Small On-Sets. ISAAC 2008: 907-918 - [c9]Ashley Montanaro, Harumichi Nishimura, Rudy Raymond:
Unbounded-Error Quantum Query Complexity. ISAAC 2008: 919-930 - 2007
- [c8]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Unbounded-Error One-Way Classical and Quantum Communication Complexity. ICALP 2007: 110-121 - [c7]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Unbounded-Error Classical and Quantum Communication Complexity. ISAAC 2007: 100-111 - [c6]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita:
Quantum Network Coding. STACS 2007: 610-621 - 2006
- [j7]Harumichi Nishimura:
Quantum Computation with Supplementary Information. Inf. Media Technol. 1(1): 147-154 (2006) - [c5]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
(4, 1)-Quantum Random Access Coding Does Not Exist. ISIT 2006: 446-450 - [i8]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Quantum Network Coding. Complexity of Boolean Functions 2006 - [i7]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami:
Computational Indistinguishability between Quantum States and Its Cryptographic Application. IACR Cryptol. ePrint Arch. 2006: 148 (2006) - 2005
- [j6]Harumichi Nishimura, Masanao Ozawa:
Uniformity of quantum circuit families for error-free algorithms. Theor. Comput. Sci. 332(1-3): 487-496 (2005) - [c4]Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT 2005: 268-284 - [i6]Harumichi Nishimura, Tomoyuki Yamakami:
Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks. CoRR abs/quant-ph/0507270 (2005) - 2004
- [j5]Harumichi Nishimura, Tomoyuki Yamakami:
Polynomial time quantum computation with advice. Inf. Process. Lett. 90(4): 195-204 (2004) - [c3]Harumichi Nishimura, Tomoyuki Yamakami:
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). MFCS 2004: 827-838 - [c2]Harumichi Nishimura, Tomoyuki Yamakami:
An Application of Quantum Finite Automata to Interactive Proof Systems. CIAA 2004: 225-236 - [i5]Harumichi Nishimura, Tomoyuki Yamakami:
An Application of Quantum Finite Automata to Interactive Proof Systems. CoRR quant-ph/0410040 (2004) - [i4]Tomoyuki Yamakami, Harumichi Nishimura:
An Application of Quantum Finite Automata to Interactive Proof Systems. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j4]Harumichi Nishimura:
Quantum Computation With Restricted Amplitudes. Int. J. Found. Comput. Sci. 14(5): 853-870 (2003) - [i3]Harumichi Nishimura, Tomoyuki Yamakami:
Polynomial time quantum computation with advice. CoRR quant-ph/0305100 (2003) - [i2]Harumichi Nishimura, Tomoyuki Yamakami:
An Algorithmic Argument for Query Complexity Lower Bounds of Advised Quantum Computation. CoRR quant-ph/0312003 (2003) - [i1]Harumichi Nishimura, Tomoyuki Yamakami:
Polynomial time quantum computation with advice. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j3]Elham Kashefi, Harumichi Nishimura, Vlatko Vedral:
On quantum one-way permutations. Quantum Inf. Comput. 2(5): 379-398 (2002) - [j2]Harumichi Nishimura, Masanao Ozawa:
Computational complexity of uniform quantum circuit families and quantum Turing machines. Theor. Comput. Sci. 276(1-2): 147-181 (2002) - [c1]Harumichi Nishimura:
On Quantum Computation with Some Restricted Amplitudes. STACS 2002: 311-322 - 2000
- [j1]Masanao Ozawa, Harumichi Nishimura:
Local transition functions of quantum Turing machines. RAIRO Theor. Informatics Appl. 34(5): 379-402 (2000)
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-11-25 23:42 CET 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:
