Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2003.08657

Distribution of quantum entanglement: Principles and applications

Tanjung Krisnanda
View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum entanglement is a form of correlation between quantum particles that has now become a crucial part in quantum information and communication science. For example, it has been shown to enable or enhance quantum processing tasks such as quantum cryptography, quantum teleportation, and quantum computing. However, quantum entanglement is prone to decoherence as a result of interactions with environmental scatterers, making it an expensive resource. Therefore, it is crucial to understand its creation. We centre our attention to a situation where one would like to distribute quantum entanglement between principal particles that are apart. In this case, it is necessary to use ancillary systems that are communicated between them or interact with them continuously. Cubitt et al. showed that the ancillary systems need not be entangled with the principal particles in order to distribute entanglement. This has been demonstrated experimentally in the case of communicated ancillary particles and it is now known that the bound on the distributed entanglement is given by a communicated quantum discord. On the other hand, little is understood about the setting with continuous interactions, despite its abundant occurrence in nature. The main focus of this thesis is to study the distribution of quantum entanglement via continuous interactions with ancillary particles, which I will call mediators. I will present my work regarding the necessary conditions for entanglement distribution, the factors that are relevant for the distributed amount, and the speed limit to achieving maximum entanglement gain. Finally, I present some notable applications that can benefit from our work. This includes, among others, indirect probing of the quantum nature of optomechanical mirrors, photosynthetic organisms, and gravitational interactions.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tanjung Krisnanda. 2020-03-19. Distribution of quantum entanglement: Principles and applications. https://arxiv.org/abs/2003.08657

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph↗
arXiv2026

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph↗
arXiv2026

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph↗