English
Related papers

Related papers: Probabilistic Cutoffs in Homogeneous Quantum Repea…

200 papers

A novel secure communication protocol is presented, based on an entangled pair of qubits and allowing asymptotically secure key distribution and quasi-secure direct communication. Since the information is transferred in a deterministic…

Quantum Physics · Physics 2009-11-07 Kim Bostroem , Timo Felbinger

Remote quantum entanglement can enable numerous applications including distributed quantum computation, secure communication, and precision sensing. In this paper, we consider how a quantum network-nodes equipped with limited quantum…

Quantum entanglement is a key resource for quantum computation and quantum communication \cite{Nielsen2010}. Scaling to large quantum communication or computation networks further requires the deterministic generation of multi-qubit…

We investigate deterministic identification over arbitrary memoryless channels under the constraint that the error probabilities of first and second kind are exponentially small in the block length $\mathbf{n}$, controlled by reliability…

Information Theory · Computer Science 2025-07-29 Pau Colomer , Christian Deppe , Holger Boche , Andreas Winter

The coherence transformation is pivotal for quantum technologies, which cannot always be accomplished deterministically. We investigate the probabilistic coherence transformation under strictly incoherent operations. To this end, by virtue…

Quantum Physics · Physics 2025-06-16 Ao-Xiang Liu , Cong-Feng Qiao

Long-distance quantum communication in quantum networks faces significant challenges due to the constraints imposed by the no-cloning theorem. Most existing quantum communication protocols rely on the a priori distribution of entanglement…

Quantum Physics · Physics 2024-05-14 Ranjani G Sundaram , Himanshu Gupta

We study entanglement percolation in qubit-based planar quantum network models of arbitrary topology, where neighboring nodes are initially connected by pure states with quenched disorder in their entanglement. To address this, we develop a…

Quantum Physics · Physics 2025-06-27 Andrea De Girolamo , Giuseppe Magnifico , Cosmo Lupo

In a quantum network that successfully creates links, shared Bell states between neighboring repeater nodes, with probability $p$ in each time slot, and performs Bell State Measurements at nodes with success probability $q<1$, the end to…

Quantum Physics · Physics 2022-04-15 Ashlesha Patil , Joshua I. Jacobson , Emily van Milligen , Don Towsley , Saikat Guha

A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…

Quantum Physics · Physics 2017-04-19 Johannes Borregaard , Anders S. Sørensen , Ignacio Cirac , Mikhail D. Lukin

We study cutoff results for parameterized verification and synthesis of guarded protocols, as introduced by Emerson and Kahlon (2000). Guarded protocols describe systems of processes whose transitions are enabled or disabled depending on…

Logic in Computer Science · Computer Science 2017-07-06 Swen Jacobs , Mouhammad Sakr

Quantum entanglement is a building block of the entangled quantum networks of the quantum Internet. A fundamental problem of the quantum Internet is entanglement distribution. Since quantum entanglement will be fundamental to any future…

Quantum Physics · Physics 2019-05-02 Laszlo Gyongyosi , Sandor Imre

In our previous paper [Phys. Rev. A 84, 042303 (2011)], we proposed an efficient scheme to purify dynamically a bipartite entangled state using short chains of atoms coupled to high-finesse optical cavities. In contrast to conventional…

Quantum Physics · Physics 2013-05-30 Denis Gonta , Peter van Loock

We investigate quantum repeaters in the context of quantum key distribution. We optimize the secret key rate per memory per second with respect to different distillation protocols and distillation strategies. For this purpose, we also…

Quantum Physics · Physics 2013-06-27 Sylvia Bratzik , Silvestre Abruzzo , Hermann Kampermann , Dagmar Bruß

We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement…

A noteworthy discovery is that the minimal evolution time is smaller for parity-time ($\mathcal{PT}$) symmetric systems compared to Hermitian setups. Moreover, there is a significant acceleration of two-qubit quantum entanglement…

Quantum Physics · Physics 2024-10-02 B. -B. Liu , Shi-Lei Su , Y. -L. Zuo , Qiongyi He , Gang Chen , F. Nori , H. Jing

Quantum network communication is challenging, as the No-cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable communication approach is teleportation of quantum…

Quantum Physics · Physics 2024-04-08 Mohammad Ghaderibaneh , Caitao Zhan , Himanshu Gupta , C. R. Ramakrishnan

The goal of entanglement distillation is to turn a large number of weakly entangled states into a smaller number of highly entangled ones. Practical entanglement distillation schemes offer a tradeoff between the fidelity to the target…

We analyze how the performance of a quantum-repeater network depends on the protocol employed to distribute entanglement, and we find that the choice of repeater-to-repeater link protocol has a profound impact on communication rate as a…

Quantum Physics · Physics 2016-08-24 Cody Jones , Danny Kim , Matthew T. Rakher , Paul G. Kwiat , Thaddeus D. Ladd

We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider consist of tensor product channels and of channels with commuting Liouvillians. We…

Quantum Physics · Physics 2012-02-03 Michael J. Kastoryano , David Reeb , Michael M. Wolf

Guarded protocols were introduced in a seminal paper by Emerson and Kahlon (2000), and describe systems of processes whose transitions are enabled or disabled depending on the existence of other processes in certain local states. We study…

Logic in Computer Science · Computer Science 2016-09-05 Simon Außerlechner , Swen Jacobs , Ayrat Khalimov