森前智行

J-GLOBALへ         更新日: 18/06/06 17:34
 
アバター
研究者氏名
森前智行
 
モリマエ トモユキ
ハンドル
morimae
URL
https://kaken.nii.ac.jp/d/r/50708302.ja.html
所属
京都大学
部署
基礎物理学研究所
職名
講師
科研費研究者番号
50708302

研究分野

 
 

経歴

 
 
   
 
京都大学 基礎物理学研究所 講師
 
2014年
 - 
2015年
群馬大学 助教
 

論文

 
Fitzsimons Joseph F., Hajdusek Michal, Morimae Tomoyuki
PHYSICAL REVIEW LETTERS   120(4)    2018年1月   [査読有り]
Morimae Tomoyuki
PHYSICAL REVIEW A   94(4)    2016年10月   [査読有り]
QUANTUM INTERPRETATIONS OF AWPP AND APP
Morimae Tomoyuki, Nishimura Harumichi
QUANTUM INFORMATION & COMPUTATION   16(5-6) 498-514   2016年4月   [査読有り]
Basics and applications of measurement-based quantum computing
2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA)   327-330   2014年   [査読有り]

Misc

 
Tomoyuki Morimae, Joseph F. Fitzsimons
   2016年3月
We propose a simple protocol for the verification of quantum computation
after the computation has been performed. Our construction can be seen as an
improvement on previous results in that it requires only a single prover, who
is restricted to me...
Tomoyuki Morimae
   2016年2月
We show that the class QAM does not change even if the verifier's ability is
restricted to only single-qubit measurements. To show the result, we use the
idea of the measurement-based quantum computing: the verifier, who can do only
single-qubit m...
Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall
   2016年2月
It is known that the group non-membership problem is in QMA relative to any
group oracle and in Tex relative to group oracles for
solvable groups. We consider a modified version of the group non-membership
problem where the or...
Chiara Greganti, Marie-Christine Roehsner, Stefanie Barz, Tomoyuki Morimae, Philip Walther
New J. Phys. 18 013020 (2016)      2016年1月
Blind quantum computing allows for secure cloud networks of quasi-classical
clients and a fully fledged quantum server. Recently, a new protocol has been
proposed, which requires a client to perform only measurements. We demonstrate
a proof-of-pri...
Tomoyuki Morimae, Daniel Nagaj, Norbert Schuch
Phys. Rev. A 93, 022326 (2016)      2015年10月
QMA (Quantum Merlin Arthur) is the class of problems which, though
potentially hard to solve, have a quantum solution which can be verified
efficiently using a quantum computer. It thus forms a natural quantum version
of the classical complexity c...