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

CRC Press eBooks

Quantum Trajectories and Entanglement

Edward R. Floyd

Published Apr 19, 2016• 0 citations
Publisher
DOI
10.1201/b10287-8

Related papers

Quantum trajectories for entanglement phenomena

Edward R. Floyd

Bulletin of the American Physical Society•Nov 13, 2009•0 citations

Toward the Advantages of Quantum Trajectories on Entanglement Distribution in Quantum Networks

Ruiqing Xu, Ri‐Gui Zhou, Yaochong Li

Quantum mechanics allows an information carrier to traverse through multiple trajectories of communication channels simultaneously, this leads us to quantum trajectories where alternative causal orders of communication channels being traversed are in a superposition, so that the relative orders of communication channels become indefinite. It has been shown that entanglement distribution process over quantum trajectory with an EPR pair being prepared by a sender enables quantum teleportation process to be heralded as a noiseless communication process with probability, the heralded result of which is unachievable in classical trajectory with a definite causal order of communication channels. In this work, we investigate the potential advantage of quantum trajectory on the generation of link-level entanglement, the basic element of quantum networks. To this aim, the performance of entanglement distribution process over multiple quantum trajectories where an EPR pair is prepared by a communication provider is analyzed. Besides, the application of entanglement purification protocol on quantum trajectory is first analyzed to reduce the effect of noise on link-level entanglement. The analysis shows that the link-level entanglement generated over quantum trajectory is more robust to long-distance quantum communication, with respect to classical trajectory, which paves the way for designing effective quantum networks.

IEEE Transactions on Wireless Communications•Jan 5, 2023•8 citations

Decoherence and Quantum Trajectories

Todd A. Brun

arXiv:quant-ph/0301046•Lecture notes in physics•Dec 9, 2003•5 citations

The Entanglement-Assisted Communication Capacity Over Quantum Trajectories

Daryus Chandra, Marcello Caleffi, Angela Sara Cacciapuoti

The unique and often-weird properties of quantum mechanics allow an information carrier to propagate through multiple trajectories of quantum channels simultaneously. This ultimately leads us to quantum trajectories with an indefinite causal order of quantum channels. It has been shown that indefinite causal order enables the violation ofbottleneck capacity, which bounds the amount of the transferable classical and quantum information through a classical trajectory with a well-defined causal order of quantum channels. In this treatise, we investigate this beneficial property in the realm of both entanglement-assisted classical and quantum communications. To this aim, we derive closed-form capacity expressions of entanglement-assisted classical and quantum communication for arbitrary quantum Pauli channels over classical and quantum trajectories. We show that by exploiting the indefinite causal order of quantum channels, we obtain capacity gains over classical trajectory as well as the violation of bottleneck capacity for various practical scenarios. Furthermore, we determine the operating region where entanglement-assisted communication over quantum trajectory obtains capacity gain against classical trajectory and where the entanglement-assisted communication over quantum trajectory violates the bottleneck capacity.

arXiv:2110.08078•IEEE Transactions on Wireless Communications•Nov 2, 2021•17 citations

Efficiency of classical simulations of a noisy Grover algorithm

Raphaël Menu, Johannes Schachenmayer

We analyze the modification of entanglement dynamics in the Grover algorithm when the qubits are subjected to single-qubit amplitude-damping or phase-flip noise. We compare quantum trajectories with full density-matrix simulations, analyzing the dynamics of averaged trajectory entanglement (TE) and operator entanglement (OE), in the respective state representation. Although not a genuine entanglement measure, both TE and OE are connected to the efficiency of matrix product state simulations and thus of fundamental interest. As in many quantum algorithms, at the end of the Grover circuit entanglement decreases as the system converges towards the target product state. While we find that this is well captured in the OE dynamics, quantum trajectories rarely follow paths of reducing entanglement. Optimized unraveling schemes can lower TE slightly, however we show that deep in the circuit OE is generally smaller than TE. This implies that matrix product density operator (MPDO) simulations of quantum circuits can in general be more efficient than quantum trajectories. In addition, we investigate the noise-rate scaling of success probabilities for both amplitude-damping and phase-flip noise in Grover's algorithm.

quant-pharXiv:2602.17569•Feb 20, 2026•0 citations

Quantum Entanglement and its Applications

Aditi Sen

Current Science•Apr 1, 2017•7 citations
Quantum mechanics allows an information carrier to traverse through multiple trajectories of communication channels simultaneously, this leads us to quantum trajectories where alternative causal orders of communication channels being traversed are in a superposition, so that the relative orders of communication channels become indefinite. It has been shown that entanglement distribution process over quantum trajectory with an EPR pair being prepared by a sender enables quantum teleportation process to be heralded as a noiseless communication process with probability, the heralded result of which is unachievable in classical trajectory with a definite causal order of communication channels. In this work, we investigate the potential advantage of quantum trajectory on the generation of link-level entanglement, the basic element of quantum networks. To this aim, the performance of entanglement distribution process over multiple quantum trajectories where an EPR pair is prepared by a communication provider is analyzed. Besides, the application of entanglement purification protocol on quantum trajectory is first analyzed to reduce the effect of noise on link-level entanglement. The analysis shows that the link-level entanglement generated over quantum trajectory is more robust to long-distance quantum communication, with respect to classical trajectory, which paves the way for designing effective quantum networks.
The unique and often-weird properties of quantum mechanics allow an information carrier to propagate through multiple trajectories of quantum channels simultaneously. This ultimately leads us to quantum trajectories with an indefinite causal order of quantum channels. It has been shown that indefinite causal order enables the violation ofbottleneck capacity, which bounds the amount of the transferable classical and quantum information through a classical trajectory with a well-defined causal order of quantum channels. In this treatise, we investigate this beneficial property in the realm of both entanglement-assisted classical and quantum communications. To this aim, we derive closed-form capacity expressions of entanglement-assisted classical and quantum communication for arbitrary quantum Pauli channels over classical and quantum trajectories. We show that by exploiting the indefinite causal order of quantum channels, we obtain capacity gains over classical trajectory as well as the violation of bottleneck capacity for various practical scenarios. Furthermore, we determine the operating region where entanglement-assisted communication over quantum trajectory obtains capacity gain against classical trajectory and where the entanglement-assisted communication over quantum trajectory violates the bottleneck capacity.
We analyze the modification of entanglement dynamics in the Grover algorithm when the qubits are subjected to single-qubit amplitude-damping or phase-flip noise. We compare quantum trajectories with full density-matrix simulations, analyzing the dynamics of averaged trajectory entanglement (TE) and operator entanglement (OE), in the respective state representation. Although not a genuine entanglement measure, both TE and OE are connected to the efficiency of matrix product state simulations and thus of fundamental interest. As in many quantum algorithms, at the end of the Grover circuit entanglement decreases as the system converges towards the target product state. While we find that this is well captured in the OE dynamics, quantum trajectories rarely follow paths of reducing entanglement. Optimized unraveling schemes can lower TE slightly, however we show that deep in the circuit OE is generally smaller than TE. This implies that matrix product density operator (MPDO) simulations of quantum circuits can in general be more efficient than quantum trajectories. In addition, we investigate the noise-rate scaling of success probabilities for both amplitude-damping and phase-flip noise in Grover's algorithm.