Multi-Party Quantum Communication Complexity with Routed Messages

This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths, which may be shared with other parties, on a network of any topology. The technique can also be employed to obtain a low...

Full description

Saved in:
Bibliographic Details
Published inIEICE Transactions on Information and Systems Vol. E92.D; no. 2; pp. 191 - 199
Main Authors TANI, Seiichiro, NAKANISHI, Masaki, YAMASHITA, Shigeru
Format Journal Article
LanguageEnglish
Published The Institute of Electronics, Information and Communication Engineers 2009
Subjects
Complexity
distributed computing
Matching
Messages
network topology
Networks
quantum communication complexity
Topology
Upper bounds
Online AccessGet full text

Cover

Abstract This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths, which may be shared with other parties, on a network of any topology. The technique can also be employed to obtain a lower-bound of the quantum communication complexity of some functions that depend on the inputs distributed over all parties on the network. As a typical application, we apply our technique to the distinctness problem of deciding whether there are a pair of parties with identical inputs, on a k-party ring; almost matching upper bounds are also given.
AbstractList This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths, which may be shared with other parties, on a network of any topology. The technique can also be employed to obtain a lower-bound of the quantum communication complexity of some functions that depend on the inputs distributed over all parties on the network. As a typical application, we apply our technique to the distinctness problem of deciding whether there are a pair of parties with identical inputs, on a k-party ring; almost matching upper bounds are also given.
Author NAKANISHI, Masaki
TANI, Seiichiro
YAMASHITA, Shigeru
Author_xml – sequence: 1
  fullname: TANI, Seiichiro
  organization: NTT Communication Science Laboratories, NTT Corporation
– sequence: 2
  fullname: NAKANISHI, Masaki
  organization: Graduate School of Information Science, Nara Institute of Science and Technology
– sequence: 3
  fullname: YAMASHITA, Shigeru
  organization: Graduate School of Information Science, Nara Institute of Science and Technology
BookMark eNpdkMtOwzAQAC0EEm3hBzjlxinBG9uJc6za8lIrHoKz5TgOdZU4JXYE_XtcFXrgtFppZqWdMTq1ndUIXQFOgPH8xvfSOmPrZFGkyTyBAk7QCHLKYiAZnKIRLiCLOSPpORo7t8EYeApshKarofEmfpa930Uvg7R-aKNZ17aDNUp609n9tm30twnAl_Hr6LUbvK6ilXZOfmh3gc5q2Th9-Tsn6P128Ta7j5dPdw-z6TJWlGU-riitgOIiJ6CrMq15rSqoSQ6sqmpecKCS8hJKRjAmMpeSE60qTksKWZGzjEzQ9eHutu8-B-28aI1Tummk1d3gBOcFBcCUBTI9kKrvnOt1Lba9aWW_E4DFPpf4yyVCLjEXIVeQHg_Sxvnw1lEJYYxq9H8lPc4gHyG1lr3QlvwAfql9wA
CitedBy_id crossref_primary_10_1587_bplus_14_102
crossref_primary_10_1587_essfr_14_1_15
Cites_doi 10.1103/PhysRevLett.87.167902
10.1145/1007352.1007379
10.1090/S0002-9947-1987-0871675-6
10.1070/IM2003v067n01ABEH000422
10.1145/1250790.1250866
10.1145/237814.237866
10.1017/CBO9780511574948
10.1090/conm/305/05215
10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P
10.1137/0405044
10.1007/s00224-003-1113-7
10.1145/301250.301343
10.1145/276698.276713
10.1145/31846.32978
10.1016/0020-0190(91)90157-D
ContentType Journal Article
Copyright 2009 The Institute of Electronics, Information and Communication Engineers
Copyright_xml – notice: 2009 The Institute of Electronics, Information and Communication Engineers
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1587/transinf.E92.D.191
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1745-1361
EndPage 199
ExternalDocumentID 10_1587_transinf_E92_D_191
article_transinf_E92_D_2_E92_D_2_191_article_char_en
GroupedDBID -~X
5GY
ABQTQ
ABZEH
ACGFS
ADNWM
AENEX
AFFNX
ALMA_UNASSIGNED_HOLDINGS
CS3
DU5
EBS
EJD
F5P
ICE
JSF
JSH
KQ8
OK1
P2P
RJT
RZJ
TN5
TQK
ZKX
1TH
AAYXX
ABTAH
C1A
CITATION
CKLRP
H13
RIG
RYL
VOH
ZE2
ZY4
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c456t-d44d1409731edb2f8fcd1f3715ddf89814a48b1b53003a7aa83ecd84b41697563
ISSN 0916-8532
1745-1361
IngestDate Fri Aug 16 21:05:35 EDT 2024
Fri Aug 23 02:38:51 EDT 2024
Wed Apr 05 04:59:50 EDT 2023
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c456t-d44d1409731edb2f8fcd1f3715ddf89814a48b1b53003a7aa83ecd84b41697563
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://www.jstage.jst.go.jp/article/transinf/E92.D/2/E92.D_2_191/_article/-char/en
PQID 889411045
PQPubID 23500
PageCount 9
ParticipantIDs proquest_miscellaneous_889411045
crossref_primary_10_1587_transinf_E92_D_191
jstage_primary_article_transinf_E92_D_2_E92_D_2_191_article_char_en
PublicationCentury 2000
PublicationDate 2009-00-00
PublicationDateYYYYMMDD 2009-01-01
PublicationDate_xml – year: 2009
  text: 2009-00-00
PublicationDecade 2000
PublicationTitle IEICE Transactions on Information and Systems
PublicationTitleAlternate IEICE Trans. Inf. & Syst.
PublicationYear 2009
Publisher The Institute of Electronics, Information and Communication Engineers
Publisher_xml – name: The Institute of Electronics, Information and Communication Engineers
References [14] C.E. Leiserson, R.L. Rivest, C. Stein, and T.H. Cormen, Introduction to Algorithms, MIT Press, 2001.
[7] P. Frankl and V. Rödl, “Forbidden intersections, ” Trans. Amer. Math. Soc., vol.300, no.1, pp.259-286, 1987.
[1] S. Aaronson and A. Ambainis, “Quantum search of spatial regions, ” Proc. 44th Annual IEEE Symposium on Foundations of Computer Science, pp.200-209, 2003. (Journal version Theory of Computing, vol.1, pp.47-79, 2005.)
[12] I. Kremer, Quantum communication, Master's Thesis, Hebrew University, Computer Science Department, 1995.
[15] I. Newman, “Private vs. common random bits in communication complexity, ” Inf. Process. Lett., vol.39, pp.67-71, 1991.
[18] P. Tiwari, “Lower bounds on communication complexity in distributed computer networks, ” J. ACM, vol.34, no.4, pp.921-938, 1987.
[16] R. Raz, “Exponential separation of quantum and classical communication complexity, ” Proc. 31st Annual ACM Symposium on Theory of Computing, pp.358-367, 1999.
[3] M. Boyer, G. Brassard, P. Høyer, and A. Tapp, “Tight bounds on quantum searching, ” Fortschritte Der Physik, vol.46, no.4-5, pp.493-505, 1998.
[6] H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf, “Quantum fingerprinting, ” Phys. Rev. Lett., vol.87, no.16, 167902, 2001.
[11] H. Klauck, “On quantum and approximate privacy, ” Theory of Computing Systems, vol.37, pp.221-246, 2004.
[17] A.A. Razborov, “Quantum communication complexity of symmetric predicates, ” Izvestiya Mathematics, vol.67, no.1, pp.145-159, 2003.
[2] Z. Bar-Yossef, T.S. Jayram, and I. Kerenidis, “Exponential separation of quantum and classical one-way communication complexity, ” Proc. 36th Annual ACM Symposium on Theory of Computing, pp.128-137, 2004.
[19] A.C.-C. Yao, “Some complexity questions related to distributed computing, ” Proc. 11th Annual ACM Symposium on Theory of Computing, pp.209-213, 1979.
[10] B. Kalyanasundaram and G. Schnitger, “The probabilistic communication complexity of set intersection, ” SIAM J. Discrete Math., vol.5, no.4, pp.545-557, 1992.
[4] G. Brassard, P. Høoyer, M. Mosca, and A. Tapp, “Quantum amplitude amplification and estimation, ” in Quantum Computation and Quantum Information: A Millenium Volume, ed. S.J. Lomonaco, Jr. and H.E. Brandt, vol.305 of AMS Contemporary Math. Series, pp.53-74, American Mathematical Society, 2003.
[5] H. Buhrman, R. Cleve, and A. Wigderson, “Quantum vs. classical communication and computation, ” Proc. 30th Annual ACM Symposium on Theory of Computing, pp.63-68, 1998.
[8] D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf, “Exponential separations for one-way quantum communication complexity, with applications to cryptography, ” Proc. 39th Annual ACM Symposium on Theory of Computing, pp.516-525, 2007.
[20] A.C.-C. Yao, “Quantum circuit complexity, ” Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, pp.352-361, 1993.
[13] E. Kushilevitz and N. Nisan, Communication Complexity, Cambridge University Press, 1997.
[9] L.K. Grover, “A fast quantum mechanical algorithm for database search, ” Proc. 28th Annual ACM Symposium on Theory of Computing, pp.212-219, 1996.
11
12
13
14
15
16
17
18
19
1
2
3
4
5
6
7
8
9
20
10
References_xml – ident: 6
  doi: 10.1103/PhysRevLett.87.167902
– ident: 2
  doi: 10.1145/1007352.1007379
– ident: 7
  doi: 10.1090/S0002-9947-1987-0871675-6
– ident: 17
  doi: 10.1070/IM2003v067n01ABEH000422
– ident: 1
– ident: 8
  doi: 10.1145/1250790.1250866
– ident: 12
– ident: 9
  doi: 10.1145/237814.237866
– ident: 13
  doi: 10.1017/CBO9780511574948
– ident: 4
  doi: 10.1090/conm/305/05215
– ident: 19
– ident: 14
– ident: 3
  doi: 10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P
– ident: 10
  doi: 10.1137/0405044
– ident: 11
  doi: 10.1007/s00224-003-1113-7
– ident: 16
  doi: 10.1145/301250.301343
– ident: 5
  doi: 10.1145/276698.276713
– ident: 18
  doi: 10.1145/31846.32978
– ident: 20
– ident: 15
  doi: 10.1016/0020-0190(91)90157-D
SSID ssj0018215
Score 1.8339037
Snippet This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties...
SourceID proquest
crossref
jstage
SourceType Aggregation Database
Publisher
StartPage 191
SubjectTerms Complexity
distributed computing
Matching
Messages
network topology
Networks
quantum communication complexity
Topology
Upper bounds
Title Multi-Party Quantum Communication Complexity with Routed Messages
URI https://www.jstage.jst.go.jp/article/transinf/E92.D/2/E92.D_2_191/_article/-char/en
https://search.proquest.com/docview/889411045
Volume E92.D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
ispartofPNX IEICE Transactions on Information and Systems, 2009/02/01, Vol.E92.D(2), pp.191-199
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lj9MwELbKwoE98FhAlJdy4Fa5YMdunAvSqptqF7YLiFbqzXLspFvQtqs2PcCvZ_xINqVIPC5pZTtJOzOe-WzPA6HXYGEBtb81mIJ5wwwwPc414ZhzrrRJNTHGnuiOLwanU_Z-xmedzruW19K2yvv6x2_jSv6Hq9AGfLVRsv_A2eah0ADfgb9wBQ7D9a947KJn8Sfo-W69M8F8XPV2Ij7cdLcpL2GA23G1DkAAMce28Mk8uA8GaHqWnQ0zWzKirh_uDhJCYtWq9lretDKcuwW_KwkFKmex0JeL9arZXFbfoGvjSgb3xmoDQLVRMOrKVnDysPXL5WJerLc7mw9pS1MmjGMS-0zqtSrNUto_aUkNbalG4qtyBStLfFmkPQXO7RbIyP1XaO-7B_abW9vZsi8-ytH0_FxOstnkFrpNQdFYDffh880pkqCugkXzU0PQFLzjzf4bdoDJna-Azef7BtqhjskDdC8sF6Jjz_uHqFMsj9D9uhRHFDTzETps5ZV8hI5bghEFwYh2BCO6EYzICkbkBSOqBeMxmo6yyfAUh1oZWAMErrBhzLjcZTEpTE5LUWpDyjgh3JhSpIIwxUROch6DGleJUiIutBEsB0CeJnwQP0EHy9WyeGqd3QaJASQuYhGzUuucaUUpYClioKukXdSrCSWvfUoUaZeSQFZZk1UCWeWJBLJ20dDTshkbpsuvY2nzCXc1g2zsIUz1LopqRkjQf_ZQSy2L1XYjhUgZQFjGn_15yHN01x8G2h20F-igWm-Ll4Apq_yVE5yfyvp_Ng
link.rule.ids 315,783,787,4032,27936,27937,27938
linkProvider Colorado Alliance of Research Libraries
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multi-Party+Quantum+Communication+Complexity+with+Routed+Messages&rft.jtitle=IEICE+transactions+on+information+and+systems&rft.au=Tani%2C+Seiichiro&rft.au=Nakanishi%2C+Masaki&rft.au=Yamashita%2C+Shigeru&rft.date=2009&rft.issn=1745-1361&rft.volume=E92.D&rft.issue=2&rft.spage=191&rft.epage=199&rft_id=info:doi/10.1587%2Ftransinf.E92.D.191&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0916-8532&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0916-8532&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0916-8532&client=summon