scholarly journals On the Non-Uniqueness of Statistical Ensembles Defining a Density Operator and a Class of Mixed Quantum States with Integrable Wigner Distribution

2021 ◽  
Vol 3 (3) ◽  
pp. 473-481
Author(s):  
Charlyne de Gosson ◽  
Maurice de Gosson
Keyword(s):  
Probability Distribution ◽  
Quantum State ◽  
Density Operator ◽  
Wigner Distribution ◽  
Quantum States ◽  
Modulation Spaces ◽  
Statistical Ensemble ◽  
Integrable Functions ◽  
Statistical Ensembles ◽  
Square Integrable Functions

It is standard to assume that the Wigner distribution of a mixed quantum state consisting of square-integrable functions is a quasi-probability distribution, i.e., that its integral is one and that the marginal properties are satisfied. However, this is generally not true. We introduced a class of quantum states for which this property is satisfied; these states are dubbed “Feichtinger states” because they are defined in terms of a class of functional spaces (modulation spaces) introduced in the 1980s by H. Feichtinger. The properties of these states were studied, giving us the opportunity to prove an extension to the general case of a result due to Jaynes on the non-uniqueness of the statistical ensemble, generating a density operator.

High-dimensional quantum state manipulation and tracking

2020 ◽  
pp. 2050045
Author(s):  
Mevludin Licina
Keyword(s):  
Probability Distribution ◽  
Quantum State ◽  
Critical Points ◽  
Theoretical Framework ◽  
Quantum Systems ◽  
Quantum States ◽  
High Dimensional ◽  
Quantum Topology ◽  
Mathematical Representations ◽  
Framework Approach

Dynamical high-dimensional quantum states can be tracked and manipulated in many cases. Using a new theoretical framework approach of manipulating quantum systems, we will show how one can manipulate and introduce parameters that allow tracking and descriptive insight in the dynamics of states. Using quantum topology and other novel mathematical representations, we will show how quantum states behave in critical points when the shift of probability distribution introduces changes.

scholarly journals The learnability of quantum states

2007 ◽  
Vol 463 (2088) ◽  
pp. 3089-3114 ◽  
Author(s):  
Scott Aaronson
Keyword(s):  
Quantum Computing ◽  
Probability Distribution ◽  
Quantum State ◽  
Learning Theory ◽  
Communication Protocols ◽  
Computational Learning Theory ◽  
Quantum States ◽  
Computational Learning ◽  
State Tomography ◽  
Long Vectors

Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n . But using ideas from computational learning theory, we show that one can do exponentially better in a statistical setting. In particular, to predict the outcomes of most measurements drawn from an arbitrary probability distribution, one needs only a number of sample measurements that grows linearly with n . This theorem has the conceptual implication that quantum states, despite being exponentially long vectors, are nevertheless ‘reasonable’ in a learning theory sense. The theorem also has two applications to quantum computing: first, a new simulation of quantum one-way communication protocols and second, the use of trusted classical advice to verify untrusted quantum advice.

scholarly journals On the Complexity of Finding the Maximum Entropy Compatible Quantum State

Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 193
Author(s):  
Serena Di Giorgio ◽  
Paulo Mateus
Keyword(s):  
Computational Complexity ◽  
Markov Chains ◽  
Maximum Entropy ◽  
Quantum State ◽  
Density Operator ◽  
Quantum States ◽  
Complexity Class ◽  
Density Operators ◽  
Quantum Markov Chains

Herein we study the problem of recovering a density operator from a set of compatible marginals, motivated by limitations of physical observations. Given that the set of compatible density operators is not singular, we adopt Jaynes’ principle and wish to characterize a compatible density operator with maximum entropy. We first show that comparing the entropy of compatible density operators is complete for the quantum computational complexity class QSZK, even for the simplest case of 3-chains. Then, we focus on the particular case of quantum Markov chains and trees and establish that for these cases, there exists a procedure polynomial in the number of subsystems that constructs the maximum entropy compatible density operator. Moreover, we extend the Chow–Liu algorithm to the same subclass of quantum states.

Assigning Values and States

2017 ◽  
Author(s):  
Richard Healey
Keyword(s):  
Quantum State ◽  
Density Operator ◽  
Entangled State ◽  
Physical Situation ◽  
Born Rule ◽  
Correct Assignment ◽  
Significant Magnitude ◽  
Good Advice ◽  
Empirical Significance ◽  
Important Idea

If a quantum state is prescriptive then what state should an agent assign, what expectations does this justify, and what are the grounds for those expectations? I address these questions and introduce a third important idea—decoherence. A subsystem of a system assigned an entangled state may be assigned a mixed state represented by a density operator. Quantum state assignment is an objective matter, but the correct assignment must be relativized to the physical situation of an actual or hypothetical agent for whom its prescription offers good advice, since differently situated agents have access to different information. However this situation is described, it is true, empirically significant magnitude claims that make the description correct, while others provide the objective grounds for the agent’s expectations. Quantum models of environmental decoherence certify the empirical significance of these magnitude claims while also licensing application of the Born rule to others without mentioning measurement.

scholarly journals A New Upper Bound for Sampling Numbers

2021 ◽  
Author(s):  
Nicolas Nagel ◽  
Martin Schäfer ◽  
Tino Ullrich
Keyword(s):  
Upper Bound ◽  
Reproducing Kernel ◽  
Reproducing Kernel Hilbert Space ◽  
Sampling Procedure ◽  
Compact Embedding ◽  
Recovery Method ◽  
Grid Sampling ◽  
Integrable Functions ◽  
Random Draw ◽  
Square Integrable Functions

AbstractWe provide a new upper bound for sampling numbers $$(g_n)_{n\in \mathbb {N}}$$ ( g n ) n ∈ N associated with the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants $$C,c>0$$ C , c > 0 (which are specified in the paper) such that $$\begin{aligned} g^2_n \le \frac{C\log (n)}{n}\sum \limits _{k\ge \lfloor cn \rfloor } \sigma _k^2,\quad n\ge 2, \end{aligned}$$ g n 2 ≤ C log ( n ) n ∑ k ≥ ⌊ c n ⌋ σ k 2 , n ≥ 2 , where $$(\sigma _k)_{k\in \mathbb {N}}$$ ( σ k ) k ∈ N is the sequence of singular numbers (approximation numbers) of the Hilbert–Schmidt embedding $$\mathrm {Id}:H(K) \rightarrow L_2(D,\varrho _D)$$ Id : H ( K ) → L 2 ( D , ϱ D ) . The algorithm which realizes the bound is a least squares algorithm based on a specific set of sampling nodes. These are constructed out of a random draw in combination with a down-sampling procedure coming from the celebrated proof of Weaver’s conjecture, which was shown to be equivalent to the Kadison–Singer problem. Our result is non-constructive since we only show the existence of a linear sampling operator realizing the above bound. The general result can for instance be applied to the well-known situation of $$H^s_{\text {mix}}(\mathbb {T}^d)$$ H mix s ( T d ) in $$L_2(\mathbb {T}^d)$$ L 2 ( T d ) with $$s>1/2$$ s > 1 / 2 . We obtain the asymptotic bound $$\begin{aligned} g_n \le C_{s,d}n^{-s}\log (n)^{(d-1)s+1/2}, \end{aligned}$$ g n ≤ C s , d n - s log ( n ) ( d - 1 ) s + 1 / 2 , which improves on very recent results by shortening the gap between upper and lower bound to $$\sqrt{\log (n)}$$ log ( n ) . The result implies that for dimensions $$d>2$$ d > 2 any sparse grid sampling recovery method does not perform asymptotically optimal.

scholarly journals Gaussian quantum states can be disentangled using symplectic rotations

2021 ◽  
Vol 111 (3) ◽  
Author(s):  
Maurice A. de Gosson
Keyword(s):  
Quantum State ◽  
Covariance Matrices ◽  
Quantum States ◽  
Weyl Quantization ◽  
Symplectic Transformation ◽  
Metaplectic Operator

AbstractWe show that every Gaussian mixed quantum state can be disentangled by conjugation with a passive symplectic transformation, that is a metaplectic operator associated with a symplectic rotation. The main tools we use are the Werner–Wolf condition on covariance matrices and the symplectic covariance of Weyl quantization. Our result therefore complements a recent study by Lami, Serafini, and Adesso.

scholarly journals Purification and redistribution of entanglement via single local filtering

2014 ◽  
Vol 12 (01) ◽  
pp. 1450004 ◽  
Author(s):  
K. O. Yashodamma ◽  
P. J. Geetha ◽  
Sudha
Keyword(s):  
Quantum State ◽  
The State ◽  
Quantum States ◽  
Local Action ◽  
Entanglement Transfer ◽  
Local Filtering

The effect of filtering operation with respect to purification and concentration of entanglement in quantum states are discussed in this paper. It is shown, through examples, that the local action of the filtering operator on a part of the composite quantum state allows for purification of the remaining part of the state. The redistribution of entanglement in the subsystems of a noise affected state is shown to be due to the action of local filtering on the non-decohering part of the system. The varying effects of the filtering parameter, on the entanglement transfer between the subsystems, depending on the choice of the initial quantum state is illustrated.

scholarly journals A generalization of the Itô formula

2002 ◽  
Vol 31 (8) ◽  
pp. 477-496
Author(s):  
Said Ngobi
Keyword(s):  
Sobolev Space ◽  
White Noise ◽  
Itô Formula ◽  
Ito Formula ◽  
Integrable Functions ◽  
Square Integrable Functions ◽  
White Noise Space

The classical Itô formula is generalized to some anticipating processes. The processes we consider are in a Sobolev space which is a subset of the space of square integrable functions over a white noise space. The proof of the result uses white noise techniques.

scholarly journals Hermite Functions and Fourier Series

Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 853
Author(s):  
Enrico Celeghini ◽  
Manuel Gadella ◽  
Mariano del Olmo
Keyword(s):  
Fourier Transform ◽  
Hermite Functions ◽  
Quantum Oscillator ◽  
Linear Combinations ◽  
Ladder Operators ◽  
Orthonormal Bases ◽  
Integrable Functions ◽  
The Fourier Transform ◽  
The One ◽  
Square Integrable Functions

Using normalized Hermite functions, we construct bases in the space of square integrable functions on the unit circle (L2(C)) and in l2(Z), which are related to each other by means of the Fourier transform and the discrete Fourier transform. These relations are unitary. The construction of orthonormal bases requires the use of the Gramm–Schmidt method. On both spaces, we have provided ladder operators with the same properties as the ladder operators for the one-dimensional quantum oscillator. These operators are linear combinations of some multiplication- and differentiation-like operators that, when applied to periodic functions, preserve periodicity. Finally, we have constructed riggings for both L2(C) and l2(Z), so that all the mentioned operators are continuous.

Sign in / Sign up

Export Citation Format

Share Document