English
Related papers

Related papers: On the Stochastic Analysis of a Quantum Entangleme…

200 papers

The ability to selectively measure, initialize, and reuse qubits during a quantum circuit enables a mapping of the spatial structure of certain tensor-network states onto the dynamics of quantum circuits, thereby achieving dramatic resource…

Quantum repeater chains will form the backbone of future quantum networks that distribute entanglement between network nodes. Therefore, it is important to understand the entanglement distribution performance of quantum repeater chains,…

Quantum Physics · Physics 2025-07-14 Allen Zang , Joaquin Chung , Rajkumar Kettimuthu , Martin Suchara , Tian Zhong

We investigate the time-dependent, coherent, and dissipative dynamics of bound particles in single multilevel quantum dots in the presence of sequential tunnelling transport. We focus on the nonequilibrium regime where several channels are…

Mesoscale and Nanoscale Physics · Physics 2010-02-11 Eduardo Vaz , Jordan Kyriakidis

Sequential data naturally arises from user engagement on digital platforms like social media, music streaming services, and web navigation, encapsulating evolving user preferences and behaviors through continuous information streams. A…

Machine Learning · Computer Science 2024-02-28 Fabian Spaeh , Charalampos E. Tsourakakis

This paper considers a nonstationary multiserver queuing model with abandonment and balking for inbound call centers. We present a continuous time Markov chain (CTMC) model which captures the important characteristics of an inbound call…

Performance · Computer Science 2015-06-26 Maciej Rafal Burak

In this paper we develop the elements of the theory of algorithmic randomness in continuous-time Markov chains (CTMCs). Our main contribution is a rigorous, useful notion of what it means for an individual trajectory of a CTMC to be random.…

Information Theory · Computer Science 2025-10-21 Xiang Huang , Jack H. Lutz , Neil Lutz , Andrei N. Migunov

A central task in many applications is reasoning about processes that change in a continuous time. The mathematical framework of Continuous Time Markov Processes provides the basic foundations for modeling such systems. Recently, Nodelman…

Artificial Intelligence · Computer Science 2012-07-02 Tal El-Hay , Nir Friedman , Daphne Koller , Raz Kupferman

We investigate congestion-aware control of quantum repeater nodes operating under stochastic traffic and finite memory coherence. Entanglement generation is modeled as a probabilistic process producing Werner states subject to depolarizing…

Quantum Physics · Physics 2026-03-27 Nicolò Lo Piparo , William J. Munro , Kae Nemoto

We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a…

Discrete Mathematics · Computer Science 2013-03-21 Arnab Ganguly , Tatjana Petrov , Heinz Koeppl

Quantum entanglement can be an effective diagnostic tool for probing topological phases protected by global symmetries. Recently, the notion of nontrivial topology in critical systems has been proposed and is attracting growing attention.…

Strongly Correlated Electrons · Physics 2025-08-19 Wen-Hao Zhong , Hai-Qing Lin , Xue-Jia Yu

Continuous-time Markov chains are mathematical models that are used to describe the state-evolution of dynamical systems under stochastic uncertainty, and have found widespread applications in various fields. In order to make these models…

Probability · Mathematics 2017-06-22 Thomas Krak , Jasper De Bock , Arno Siebes

We evaluate the performance of two-way quantum repeater chains with sequential entanglement swapping. Within the analysis we consider memory decoherence, gate imperfections, and imperfect link-level entanglement generation. Our main results…

The classical embeddability problem asks whether a given stochastic matrix $T$, describing transition probabilities of a $d$-level system, can arise from the underlying homogeneous continuous-time Markov process. Here, we investigate the…

In this research paper, weighted / unweighted, directed / undirected graphs are associated with interesting Discrete Time Markov Chains (DTMCs) as well as Continuous Time Markov Chains (CTMCs). The equilibrium / transient behaviour of such…

Data Structures and Algorithms · Computer Science 2012-09-18 Garimella Rama Murthy

Entanglement is the key resource for quantum technologies and is at the root of exciting many-body phenomena. However, quantifying the entanglement between two parts of a real-world quantum system is challenging when it interacts with its…

Quantum Physics · Physics 2023-03-22 Christian Carisch , Oded Zilberberg

With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In…

Quantum Physics · Physics 2025-01-10 Sanidhay Bhambay , Thirupathaiah Vasantam , Neil Walton

Modular quantum computing provides a scalable approach to overcome the limitations of monolithic quantum architectures by interconnecting multiple Quantum Processing Units (QPUs) through a quantum network. In this work, we explore and…

Quantum Physics · Physics 2025-04-30 Shahrooz Pouryousef , Reza Nejabati , Don Towsley , Ramana Kompella , Eneet Kaur

Quantum networks, which enable the transfer of quantum information across long distances, promise to provide exciting benefits and new possibilities in many areas including communication, computation, security, and metrology. These networks…

Quantum Physics · Physics 2025-07-14 Alexander Kolar , Allen Zang , Joaquin Chung , Martin Suchara , Rajkumar Kettimuthu

Continuous Time Markov Chain (CMTC) is widely used to describe and analyze systems in several knowledge areas. Steady state availability is one important analysis that can be made through Markov chain formalism that allows researchers…

Performance · Computer Science 2017-01-24 Eduardo M. Vasconcelos

In a batch of synchronized queues, customers can only be serviced all at once or not at all, implying that service remains idle if at least one queue is empty. We propose that a batch of $n$ synchronized queues in a discrete-time setting is…

Probability · Mathematics 2020-06-26 Richard Schoeffauer , Gerhard Wunder