Search arXivSearch

arXiv · 2306.11436

A tomographic approach to the sum uncertainty relation and quantum entanglement in continuous variable systems

Abstract

Entropic uncertainty relations (EURs) have been examined in various contexts, primarily in qubit systems, including their links with entanglement, as they subsume the Heisenberg uncertainty principle. With their genesis in the Shannon entropy, EURs find applications in quantum information and quantum optics. EURs are state-dependent, and the state has to be reconstructed from tomograms (which are histograms readily available from experiments). This is a challenge when the Hilbert space is large, as in continuous variable (CV) and certain hybrid quantum (HQ) systems. An alternative approach is to extract information about the unknown quantum state directly from appropriate tomograms. Many variants of EURs can be computed from tomograms. In the literature many tomographic entanglement indicators (TEIs) that can be calculated from tomograms have been defined. The objectives of this work are as follows: (i) Use the tomographic approach to investigate the links between EURs and TEIs in CV and HQ systems as they evolve in time. (ii) Identify the TEI that most closely tracks the temporal evolution of EURs. We consider two generic systems. The first is a multilevel atom modeled as a nonlinear oscillator interacting with a quantized radiation field. The second is the $Λ$-atom interacting with two radiation fields. The former model accommodates investigations on the role of the initial state of the field and the ratio of the strengths of interaction and nonlinearity in the connection between TEIs and EURs. The second model opens up the possibility of examining the connection between mixed state bipartite entanglement and EURs, when the number of atomic levels is finite. Since the tomogram respects the requirements of classical probability theory, this effort also sheds light on the extent to which TEIs reflect the temporal behaviour of those EURs which are rooted in the Shannon entropy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Soumyabrata Paul, S. Lakshmibala, V. Balakrishnan, S. Ramanan. 2023-06-20. A tomographic approach to the sum uncertainty relation and quantum entanglement in continuous variable systems. https://doi.org/10.3389/frqst.2023.1131798

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

KEEP EXPLORING

Related papers

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

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

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