Decoupling Cross-Quadrature Correlations using Passive Operations

• URL: http://arxiv.org/abs/2004.03105v2
• Date: Wed, 12 Aug 2020 14:17:22 GMT
• Title: Decoupling Cross-Quadrature Correlations using Passive Operations
• Authors: Syed M. Assad, Mile Gu, Xiaoying Li, Ping Koy Lam
• Abstract summary: We show when it is possible to remove correlations between conjugate quadratures using only passive operations. Such correlations are usually undesired and arise due to experimental cross-quadrature contamination. Our proof is constructive, and whenever it is possible we obtain an explicit expression for the required passive operation.
• Score: 0.8127364542975234
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quadrature correlations between subsystems of a Gaussian quantum state are fully characterised by its covariance matrix. For example, the covariance matrix determines the amount of entanglement or decoherence of the state. Here, we establish when it is possible to remove correlations between conjugate quadratures using only passive operations. Such correlations are usually undesired and arise due to experimental cross-quadrature contamination. Using the Autonne--Takagi factorisation, we present necessary and sufficient conditions to determine when such removal is possible. Our proof is constructive, and whenever it is possible we obtain an explicit expression for the required passive operation.

Related papers

• Linear causal disentanglement via higher-order cumulants [0.0]
  We study the identifiability of linear causal disentanglement, assuming access to data under multiple contexts. We show that one perfect intervention on each latent variable is sufficient and in the worst case necessary to recover parameters under perfect interventions.
  arXiv  Detail & Related papers  (2024-07-05T15:53:16Z)
• Applications of flow models to the generation of correlated lattice QCD ensembles [69.18453821764075]
  Machine-learned normalizing flows can be used in the context of lattice quantum field theory to generate statistically correlated ensembles of lattice gauge fields at different action parameters. This work demonstrates how these correlations can be exploited for variance reduction in the computation of observables.
  arXiv  Detail & Related papers  (2024-01-19T18:33:52Z)
• Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
  This work introduces a novel principle for disentanglement we call mechanism sparsity regularization. We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors. We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
  arXiv  Detail & Related papers  (2024-01-10T02:38:21Z)
• Correlations in Disordered Solvable Tensor Network States [0.0]
  Solvable matrix product and projected entangled pair states evolved by dual and ternary-unitary quantum circuits have analytically accessible correlation functions. We compute the average behavior of a physically motivated two-point equal-time correlation function with respect to random disordered tensor network states.
  arXiv  Detail & Related papers  (2023-09-09T12:31:22Z)
• Causal Discovery via Conditional Independence Testing with Proxy Variables [35.3493980628004]
  The presence of unobserved variables, such as the latent confounder, can introduce bias in conditional independence testing. We propose a novel hypothesis-testing procedure that can effectively examine the existence of the causal relationship over continuous variables.
  arXiv  Detail & Related papers  (2023-05-09T09:08:39Z)
• Nonparametric Conditional Local Independence Testing [69.31200003384122]
  Conditional local independence is an independence relation among continuous time processes. No nonparametric test of conditional local independence has been available. We propose such a nonparametric test based on double machine learning.
  arXiv  Detail & Related papers  (2022-03-25T10:31:02Z)
• Matrix Completion via Non-Convex Relaxation and Adaptive Correlation Learning [90.8576971748142]
  We develop a novel surrogate that can be optimized by closed-form solutions. We exploit upperwise correlation for completion, and thus an adaptive correlation learning model.
  arXiv  Detail & Related papers  (2022-03-04T08:50:50Z)
• Can multipartite entanglement be characterized by two-point connected correlation functions ? [0.0]
  Multipartite entanglement in mixed quantum states can be characterized only in terms of two-point connected correlation functions. In contrast to the case of pure states, conditions to be satisfied turn out to be rather severe.
  arXiv  Detail & Related papers  (2021-08-08T11:01:12Z)
• Densely connected normalizing flows [0.0]
  Normalizing flows are mappings between inputs and latent representations with a fully factorized distribution. We address this issue by incrementally padding intermediate representations with noise. Our invertible glow-like modules express intra-unit affine coupling as a fusion of a densely connected block and Nystr"om self-attention. Experiments show significant improvements due to the proposed contributions, and reveal state-of-the-art density estimation among all generative models under moderate computing budgets.
  arXiv  Detail & Related papers  (2021-06-08T18:24:41Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.