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 2008-03-10 09:55
Unbounded-Error Quantum Query Complexity
Ashley Montanaro (Univ. of Bristol), Harumichi Nishimura (Osaka Prefecture Univ.), Rudy Raymond (IBM) COMP2007-56
Abstract (in Japanese) (See Japanese page) 
(in English) This work studies the quantum query complexity of Boolean functions in an unbounded-error scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We show that, just as in the communication complexity model, the unbounded-error quantum query complexity is exactly half of its classical counterpart
for any (partial or total) Boolean function. Connecting the query and communication complexity results, we show that the ``black-box'' approach
to convert quantum query algorithms into communication protocols by Buhrman-Cleve-Wigderson [STOC'98] is optimal even in the unbounded-error setting.

We also study a related setting, called the weakly unbounded-error
setting. In contrast to the case of communication complexity, we show a tight Theta(log n) separation between quantum and classical query complexity in this setting for a partial Boolean function, and the asymptotic equivalence between them for some well-studied total Boolean functions.
Keyword (in Japanese) (See Japanese page) 
(in English) query complexity / communication complexity / unbounded-error / quantum computation / / / /  
Reference Info. IEICE Tech. Rep., vol. 107, no. 537, COMP2007-56, pp. 9-14, March 2008.
Paper # COMP2007-56 
Date of Issue 2008-03-03 (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 COMP2007-56

Conference Information
Committee COMP  
Conference Date 2008-03-10 - 2008-03-10 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2008-03-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Unbounded-Error Quantum Query Complexity 
Sub Title (in English)  
Keyword(1) query complexity  
Keyword(2) communication complexity  
Keyword(3) unbounded-error  
Keyword(4) quantum computation  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Ashley Montanaro  
1st Author's Affiliation University of Bristol (Univ. of Bristol)
2nd Author's Name Harumichi Nishimura  
2nd Author's Affiliation Osaka Prefecture University (Osaka Prefecture Univ.)
3rd Author's Name Rudy Raymond  
3rd Author's Affiliation Tokyo Research Laboratory (IBM)
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 2008-03-10 09:55:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2007-56 
Volume (vol) vol.107 
Number (no) no.537 
Page pp.9-14 
#Pages 6 
Date of Issue 2008-03-03 (COMP) 

[Return to Top Page]

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