Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1507.01936 · Physical Review A

Quantum communication complexity using the quantum Zeno effect

Armin Tavakoli, Hammad Anwer, Alley Hameedi, Mohamed Bourennane

Published Jul 1, 2015• 10 citations
arXivHTMLPDF

Abstract

The quantum Zeno effect (QZE) is the phenomenon in which the unitary evolution of a quantum state is suppressed, e.g., due to frequent measurements. Here, we investigate the use of the QZE in a class of communication complexity problems (CCPs). Quantum entanglement is known to solve certain CCPs beyond classical constraints. However, recent developments have yielded CCPs for which superclassical results can be obtained using only communication of a single $d$-level quantum state (qudit) as a resource. In the class of CCPs considered here, we show quantum reduction of complexity in three ways: using (i) entanglement and the QZE, (ii) a single qudit and the QZE, and (iii) a single qudit. We have performed a proof of concept experimental demonstrations of three party CCP protocol based on single-qubit communication with and without QZE.

DOI
10.1103/physreva.92.012303

Related papers

Quantum Zeno repeaters

Veysel Bayrakci, Fatih Özaydin

Quantum repeaters pave the way for long-distance quantum communications and quantum Internet, and the idea of quantum repeaters is based on entanglement swapping which requires the implementation of controlled quantum gates. Frequently measuring a quantum system affects its dynamics which is known as the quantum Zeno effect (QZE). Beyond slowing down its evolution, QZE can be used to control the dynamics of a quantum system by introducing a carefully designed set of operations between measurements. Here, we propose an entanglement swapping protocol based on QZE, which achieves almost unit fidelity. Implementation of our protocol requires only simple frequent threshold measurements and single particle rotations. We extend the proposed entanglement swapping protocol to a series of repeater stations for constructing quantum Zeno repeaters which also achieve almost unit fidelity regardless of the number of repeaters. Requiring no controlled gates, our proposal reduces the quantum circuit complexity of quantum repeaters. Our work has potential to contribute to long distance quantum communications and quantum computing via quantum Zeno effect.

arXiv:2206.08785•Scientific Reports•Sep 12, 2022•14 citations

The Quantum Zeno Capacity and Dynamic Evolution Mode of a Quantum System

Zhenbo Ni, Yonggang Peng, Yujun Zheng

The quantum Zeno effect (QZE) is widely employed in quantum engineering due to the issue of frequent measurements freezing a quantum system. In this study, the quantum Zeno factor is introduced to characterize the quantum Zeno capacity of a quantum system. The quantum Zeno factor reveals that the quantum Zeno effect is dependent on the evolution mode of quantum states, which is semi-irrelevant to conventional energy uncertainty and extends the QZE domain. The Zeno factor provides a new consideration to qualify the (anti-)Zeno capacity of a quantum system for its applications: a large quantum Zeno factor value indicates that a quantum system is of a QZE quality. The numerical results of the quantum Zeno capacity are shown using two typical examples: tailing the dynamic evolution modes using the quantum Zeno factor in a three-level system, and quantifying the message exchange between qubits in a coupled qubit system using a quantum Zeno factor.

Entropy•Dec 11, 2024•2 citations

Entanglement-based quantum communication complexity beyond Bell nonlocality

Joseph Ho, George Moreno, Samuraí Brito +8 more

Abstract Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks, such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be minimised—a key motivation behind the communication complexity problem (CCP). Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. Furthermore, the connection between quantum CCPs and non-locality provides an information-theoretic insight into fundamental quantum mechanics. Here we connect quantum CCPs with a generalised non-locality framework—beyond Bell’s paradigmatic theorem—by incorporating the underlying causal structure, which governs the distributed task, into a so-called non-local hidden-variable model. We prove that a new class of communication complexity tasks can be associated with Bell-like inequalities, whose violation is both necessary and sufficient for a quantum gain. We experimentally implement a multipartite CCP akin to the guess-your-neighbour-input scenario, and demonstrate a quantum advantage when multipartite Greenberger-Horne-Zeilinger (GHZ) states are shared among three users.

arXiv:2106.06552•npj Quantum Information•Feb 3, 2022•23 citations

Higher-dimensional communication complexity problems: Classical protocols versus quantum ones based on Bell's theorem or prepare-transmit-measure schemes

Armin Tavakoli, Marek Żukowski

Communication complexity problems (CCPs) are tasks in which separated parties attempt to compute a function whose inputs are distributed among the parties. Their communication is limited so that not all inputs can be sent. We show that broad classes of Bell inequalities can be mapped to CCPs and that a quantum violation of a Bell inequality is a necessary and sufficient condition for an enhancement of the related CCP beyond its classical limitation. However, one can implement CCPs by transmitting a quantum system, encoding no more information than is allowed in the CCP, and extracting information by performing measurements. We show that for a large class of Bell inequalities, the improvement of the CCP associated with a quantum violation of a Bell inequality can be no greater than the improvement obtained from quantum prepare-transmit-measure strategies.

arXiv:1611.00977•Physical Review A•Apr 4, 2017•17 citations

Zeno or Anti-Zeno : which is more useful?

Gershon Kurizki

The quantum Zeno effect (QZE) introduced by Misra and Sudarshan consists in the ability of repeated measurements to inhibit or slow down unitary evolution. Its fundamental status in quantum mechanics has long been firmly established, but its much broader context, in-depth understanding and its applications are growing at a faster pace than ever before. Over the years, there have been several pivotal developments that have made the QZE and related effects the basic paradigms underlying the control of evolution in quantum systems:

•Jan 1, 2011•0 citations

Quantum Entanglement and Communication Complexity

Harry Buhrman, Richard Cleve, Wim van Dam

We consider a variation of the communication complexity scenario, where the parties are supplied with an extra resource: particles in an entangled quantum state. We note that "quantum nonlocality" can be naturally expressed in the language of communication complexity. These are communication complexity problems where the "output" is embodied in the correlations between the outputs of the individual parties. Without entanglement, the parties must communicate to produce the required correlations; whereas, with entanglement, no communication is necessary to produce the correlations. In this sense, nonlocality proofs can also be viewed as communication complexity problems where the presence of quantum entanglement reduces the amount of necessary communication. We show how to transform examples of nonlocality into more traditional communication complexity problems, where the output is explicitly determined by each individual party. The resulting problems require communication with or without entanglement, but the required communication is less when entanglement is available. All these results are a noteworthy contrast to the well-known fact that entanglement cannot be used to actually simulate or compress classical communication between remote parties.

arXiv:quant-ph/9705033•SIAM Journal on Computing•Jan 1, 2001•142 citations
The quantum Zeno effect (QZE) is the phenomenon in which the unitary evolution of a quantum state is suppressed, e.g., due to frequent measurements. Here, we investigate the use of the QZE in a class of communication complexity problems (CCPs). Quantum entanglement is known to solve certain CCPs beyond classical constraints. However, recent developments have yielded CCPs for which superclassical results can be obtained using only communication of a single ddd-level quantum state (qudit) as a resource. In the class of CCPs considered here, we show quantum reduction of complexity in three ways: using (i) entanglement and the QZE, (ii) a single qudit and the QZE, and (iii) a single qudit. We have performed a proof of concept experimental demonstrations of three party CCP protocol based on single-qubit communication with and without QZE.
Quantum repeaters pave the way for long-distance quantum communications and quantum Internet, and the idea of quantum repeaters is based on entanglement swapping which requires the implementation of controlled quantum gates. Frequently measuring a quantum system affects its dynamics which is known as the quantum Zeno effect (QZE). Beyond slowing down its evolution, QZE can be used to control the dynamics of a quantum system by introducing a carefully designed set of operations between measurements. Here, we propose an entanglement swapping protocol based on QZE, which achieves almost unit fidelity. Implementation of our protocol requires only simple frequent threshold measurements and single particle rotations. We extend the proposed entanglement swapping protocol to a series of repeater stations for constructing quantum Zeno repeaters which also achieve almost unit fidelity regardless of the number of repeaters. Requiring no controlled gates, our proposal reduces the quantum circuit complexity of quantum repeaters. Our work has potential to contribute to long distance quantum communications and quantum computing via quantum Zeno effect.
The quantum Zeno effect (QZE) is widely employed in quantum engineering due to the issue of frequent measurements freezing a quantum system. In this study, the quantum Zeno factor is introduced to characterize the quantum Zeno capacity of a quantum system. The quantum Zeno factor reveals that the quantum Zeno effect is dependent on the evolution mode of quantum states, which is semi-irrelevant to conventional energy uncertainty and extends the QZE domain. The Zeno factor provides a new consideration to qualify the (anti-)Zeno capacity of a quantum system for its applications: a large quantum Zeno factor value indicates that a quantum system is of a QZE quality. The numerical results of the quantum Zeno capacity are shown using two typical examples: tailing the dynamic evolution modes using the quantum Zeno factor in a three-level system, and quantifying the message exchange between qubits in a coupled qubit system using a quantum Zeno factor.
Abstract Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks, such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be minimised—a key motivation behind the communication complexity problem (CCP). Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. Furthermore, the connection between quantum CCPs and non-locality provides an information-theoretic insight into fundamental quantum mechanics. Here we connect quantum CCPs with a generalised non-locality framework—beyond Bell’s paradigmatic theorem—by incorporating the underlying causal structure, which governs the distributed task, into a so-called non-local hidden-variable model. We prove that a new class of communication complexity tasks can be associated with Bell-like inequalities, whose violation is both necessary and sufficient for a quantum gain. We experimentally implement a multipartite CCP akin to the guess-your-neighbour-input scenario, and demonstrate a quantum advantage when multipartite Greenberger-Horne-Zeilinger (GHZ) states are shared among three users.
Communication complexity problems (CCPs) are tasks in which separated parties attempt to compute a function whose inputs are distributed among the parties. Their communication is limited so that not all inputs can be sent. We show that broad classes of Bell inequalities can be mapped to CCPs and that a quantum violation of a Bell inequality is a necessary and sufficient condition for an enhancement of the related CCP beyond its classical limitation. However, one can implement CCPs by transmitting a quantum system, encoding no more information than is allowed in the CCP, and extracting information by performing measurements. We show that for a large class of Bell inequalities, the improvement of the CCP associated with a quantum violation of a Bell inequality can be no greater than the improvement obtained from quantum prepare-transmit-measure strategies.
The quantum Zeno effect (QZE) introduced by Misra and Sudarshan consists in the ability of repeated measurements to inhibit or slow down unitary evolution. Its fundamental status in quantum mechanics has long been firmly established, but its much broader context, in-depth understanding and its applications are growing at a faster pace than ever before. Over the years, there have been several pivotal developments that have made the QZE and related effects the basic paradigms underlying the control of evolution in quantum systems:
We consider a variation of the communication complexity scenario, where the parties are supplied with an extra resource: particles in an entangled quantum state. We note that "quantum nonlocality" can be naturally expressed in the language of communication complexity. These are communication complexity problems where the "output" is embodied in the correlations between the outputs of the individual parties. Without entanglement, the parties must communicate to produce the required correlations; whereas, with entanglement, no communication is necessary to produce the correlations. In this sense, nonlocality proofs can also be viewed as communication complexity problems where the presence of quantum entanglement reduces the amount of necessary communication. We show how to transform examples of nonlocality into more traditional communication complexity problems, where the output is explicitly determined by each individual party. The resulting problems require communication with or without entanglement, but the required communication is less when entanglement is available. All these results are a noteworthy contrast to the well-known fact that entanglement cannot be used to actually simulate or compress classical communication between remote parties.