首页/论文/quant-ph/0109068

arXiv quant-ph/01090682001-09-14quant-phcs.CC

Improved Quantum Communication Complexity Bounds for Disjointness and Equality

Peter Hoyer, Ronald de Wolf

备注：: 11 pages LaTeX
发表信息：: 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, LNCS 2285, pp. 299-310, 2002
DOI：: 10.1007/3-540-45841-7_24

英文摘要：

We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previous best lower bound being n/2. We show this by improving a general bound for non-deterministic protocols of de Wolf. We also give an O(sqrt{n}c^{log^* n})-qubit bounded-error protocol for disjointness, modifying and improving the earlier O(sqrt{n}log n) protocol of Buhrman, Cleve, and Wigderson, and prove an Omega(sqrt{n}) lower bound for a large class of protocols that includes the BCW-protocol as well as our new protocol.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Communication complexity of promise problems and their applications to finite automata

Equality and disjointness are two of the most studied problems in communication complexity. They have been studied for both classical and also quantum communication and for various models and modes of communication. Buhrman et al. [Buh98] proved that the exact quantum communication complexity for a promise version of the equality problem is ${\bf O}(\log {n})$ while the classical deterministic communication complexity is $n+1$ for two-way communication, which was the first impressively large (exponential) gap between quantum and classical (deterministic and probabilistic) communication complex…

2013-09-30cs.CCcs.FLquant-ph

Fooling One-Sided Quantum Protocols

We use the venerable "fooling set" method to prove new lower bounds on the quantum communication complexity of various functions. Let f:X x Y-->{0,1} be a Boolean function, fool^1(f) its maximal fooling set size among 1-inputs, Q_1^*(f) its one-sided error quantum communication complexity with prior entanglement, and NQ(f) its nondeterministic quantum communication complexity (without prior entanglement; this model is trivial with shared randomness or entanglement). Our main results are the following, where logs are to base 2: * If the maximal fooling set is "upper triangular" (which is for in…

2012-09-25cs.CCquant-ph

Nondeterministic Quantum Query and Quantum Communication Complexities

We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x)=1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a Boolean function is equal to its ``nondeterministic polynomial'' degree. We also prove a quantum-vs-classical gap of 1 vs n for nondeterministic query complexity for a total function. In the setting of communication complexity, we show that the nondeterministic quantum complexity of a two-party function is equal to the logarithm of the rank of a nondetermini…

2004-01-15cs.CCquant-ph

Quantum Advantage on Information Leakage for Equality

We prove a lower bound on the information leakage of any classical protocol computing the equality function in the simultaneous message passing (SMP) model. Our bound is valid in the finite length regime and is strong enough to demonstrate a quantum advantage in terms of information leakage for practical quantum protocols. We prove our bound by obtaining an improved finite size version of the communication bound due to Babai and Kimmel, relating randomized communication to deterministic communication in the SMP model. We then relate information leakage to randomized communication through a ser…

2016-07-26cs.CCquant-ph

An improved Landauer Principle with finite-size corrections

Landauer's Principle relates entropy decrease and heat dissipation during logically irreversible processes. Most theoretical justifications of Landauer's Principle either use thermodynamic reasoning or rely on specific models based on arguable assumptions. Here, we aim at a general and minimal setup to formulate Landauer's Principle in precise terms. We provide a simple and rigorous proof of an improved version of the Principle, which is formulated in terms of an equality rather than an inequality. The proof is based on quantum statistical mechanics concepts rather than on thermodynamic argume…

2014-10-11cond-mat.stat-mechmath-phmath.MP

Remainder Terms for Some Quantum Entropy Inequalities

We consider three von Neumann entropy inequalities: subadditivity; Pinsker's inequality for relative entropy; and the monotonicity of relative entropy. For these we state conditions for equality, and we prove some new error bounds away from equality, including an improved version of Pinsker's inequality.

2014-03-07math-phmath.MPmath.OA

更多相关论文收起更多论文

Holevo's bound from a general quantum fluctuation theorem

We give a novel derivation of Holevo's bound using an important result from nonequilibrium statistical physics, the fluctuation theorem. To do so we develop a general formalism of quantum fluctuation theorems for two-time measurements, which explicitly accounts for the back action of quantum measurements as well as possibly non-unitary time evolution. For a specific choice of observables this fluctuation theorem yields a measurement-dependent correction to the Holevo bound, leading to a tighter inequality. We conclude by analyzing equality conditions for the improved bound.

2012-10-05cond-mat.stat-mechquant-ph

一种量子-经典混合的分支定界算法

A quantum-classical hybrid branch & bound algorithm

University of Szeged（塞格德大学）；Hamburg University of Technology（汉堡工业大学）

本文提出了一种结合量子与经典方法的混合分支定界算法，用于高效求解带等式约束的二进制线性规划问题。

2026-02-01quant-ph

Cryptanalysis and improvement of a semi-quantum private comparison protocol based on Bell states

Semi-quantum private comparison (SQPC) allows two participants with limited quantum ability to securely compare the equality of their secrets with the help of a semi-dishonest third party (TP). Recently, Jiang proposed a SQPC protocol based on Bell states (Quantum Inf Process 19(6): 180, 2020) and claimed it is secure. In this paper, we present two types of attack on Jiang's SQPC protocol. In the first type of attack, an outside eavesdropper will make participants accept a wrong result. In the second type of attack, a malicious participant will not only make the other participant accept a wron…

2021-01-06quant-ph

Lower bounds of concurrence for $N$-qubit systems and the detection of $k$-nonseparability of multipartite quantum systems

Concurrence, as one of entanglement measures, is a useful tool to characterize quantum entanglement in various quantum systems. However, the computation of the concurrence involves difficult optimizations and only for the case of two qubits an exact formula was found. We investigate the concurrence of four-qubit quantum states and derive analytical lower bound of concurrence using the multiqubit monogamy inequality. It is shown that this lower bound is able to improve the existing bounds. This approach can be generalized to arbitrary qubit systems. We present an exact formula of concurrence fo…

2017-03-03quant-ph

量子度量学中不可逆Fisher信息矩阵的统一处理策略

Unified strategy for non-invertible Fisher information matrix in quantum metrology

针对量子多参数估计中FIM不可逆导致现有CRB精度表征失准的问题，提出基于等式约束与FIM的Moore-Penrose伪逆定义CRB的统一框架，可系统适配多类场景并提升估计精度。

2025-11-17quant-ph