Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2013-06-24 15:45
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
Hirotada Kobayashi (NII), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.) COMP2013-24
Abstract (in Japanese) (See Japanese page) 
(in English) This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is proved that any problem in $mathrm{QMA}$ has a two-message quantum interactive proof system of perfect completeness with constant soundness error, where the verifier has only to send a constant number of halves of EPR pairs. This in particular implies that the class $mathrm{QMA}$ is necessarily included by the class $mathrm{QIP}_1(2)$ of problems having two-message quantum interactive proofs of perfect completeness, which gives the first nontrivial upper bound for $mathrm{QMA}$ in terms of quantum interactive proofs. It is also proved that any problem having an $m$-message quantum interactive proof system necessarily has an $(m+1)$-message quantum interactive proof system of perfect completeness. This improves the previous result due to Kitaev and Watrous, where the resulting system of perfect completeness requires $m+2$ messages if not using the parallelization result.
Keyword (in Japanese) (See Japanese page) 
(in English) quantum computing / interactive proof systems / / / / / /  
Reference Info. IEICE Tech. Rep., vol. 113, no. 108, COMP2013-24, pp. 31-38, June 2013.
Paper # COMP2013-24 
Date of Issue 2013-06-17 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2013-24

Conference Information
Committee COMP  
Conference Date 2013-06-24 - 2013-06-24 
Place (in Japanese) (See Japanese page) 
Place (in English) Nara Women's University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2013-06-COMP 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete 
Sub Title (in English)  
Keyword(1) quantum computing  
Keyword(2) interactive proof systems  
Keyword(3)  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Hirotada Kobayashi  
1st Author's Affiliation National Institute of Informatics (NII)
2nd Author's Name Francois Le Gall  
2nd Author's Affiliation The University of Tokyo (Univ. of Tokyo)
3rd Author's Name Harumichi Nishimura  
3rd Author's Affiliation Nagoya University (Nagoya Univ.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-3 
Date Time 2013-06-24 15:45:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2013-24 
Volume (vol) vol.113 
Number (no) no.108 
Page pp.31-38 
#Pages 8 
Date of Issue 2013-06-17 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan