Structural constraint on delayed-choice quantum eraser architectures
- URL: http://arxiv.org/abs/2605.24994v1
- Date: Sun, 24 May 2026 10:46:14 GMT
- Title: Structural constraint on delayed-choice quantum eraser architectures
- Abstract summary: We show that four intuitive properties -- statistical independence of the choice, absence of losses, deterministic routing conditioned on the choice, and distinct conditional detection distributions -- cannot be simultaneously satisfied.<n>This incompatibility provides a transparent classification of DCQE schemes and clarifies how conditional interference patterns arise without invoking exotic mechanisms.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Delayed-choice quantum eraser (DCQE) experiments are often presented as challenging classical causal intuitions by correlating detection events with choices implemented at later times. While it is well understood that post-selection plays a crucial role in producing the observed interference patterns, the structural features underlying such correlations are rarely analyzed within a unified framework. In this work, we introduce a simple probabilistic constraint applicable to idealized DCQE architectures. We show that four intuitive properties -- statistical independence of the choice, absence of losses, deterministic routing conditioned on the choice, and distinct conditional detection distributions -- cannot be simultaneously satisfied. This incompatibility provides a transparent classification of DCQE schemes and clarifies how conditional interference patterns arise without invoking exotic mechanisms.
Related papers
- Leggett--Garg Tests in Neural Dynamics: Probing Non-Diffusive Stochastic Structure in Single Neurons [0.0]
We show that persistent dynamics can produce oscillatory temporal correlations capable of violating Leggett-Garg inequalities.<n>The resulting temporal correlations indicate persistence, memory, and contextual temporal structure mathematically analogous to that encountered in quantum systems.<n>These tests offer a possible experimental probe of contextual and non-Markovian structure in neural dynamics without requiring claims of microscopic quantum coherence in the brain.
arXiv Detail & Related papers (2026-05-12T13:49:48Z) - FACTOR: Counterfactual Training-Free Test-Time Adaptation for Open-Vocabulary Object Detection [63.91351553178842]
FACTOR is a training-free Test-time adaptation for Open-vocabulary object detection.<n>It quantifies attribute sensitivity, semantic relevance, and prediction variation to selectively suppress attribute-dependent predictions.<n>Experiments on PASCAL-C, COCO-C, and FoggyCityscapes show that FACTOR consistently outperforms prior TTA methods.
arXiv Detail & Related papers (2026-05-05T02:31:18Z) - Towards Unsupervised Causal Representation Learning via Latent Additive Noise Model Causal Autoencoders [1.9732490977700972]
Unsupervised representation learning seeks to recover latent generative factors.<n>Disentangling causal variables from observational data is impossible without supervision.<n>We propose the Latent Additive Noise Model Causal Autoencoder (LANCA) as a strong inductive bias for unsupervised discovery.
arXiv Detail & Related papers (2025-12-15T10:52:30Z) - Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences.
We show that selection structure is identifiable without any parametric assumptions or interventional experiments.
We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
arXiv Detail & Related papers (2024-06-29T20:56:34Z) - Probabilistic Learning of Multivariate Time Series with Temporal Irregularity [21.361823581838355]
Real-world time series often suffer from temporal irregularities, including nonuniform intervals and misaligned variables.<n>We propose an end-to-end framework that models temporal irregularities while capturing the joint distribution of variables at arbitrary continuous-time points.
arXiv Detail & Related papers (2023-06-15T14:08:48Z) - Invariant Causal Set Covering Machines [48.169632766444906]
Rule-based models, such as decision trees, appeal to practitioners due to their interpretable nature.<n>However, the learning algorithms that produce such models are often vulnerable to spurious associations and thus, they are not guaranteed to extract causally-relevant insights.<n>We propose Invariant Causal Set Covering Machines, an extension of the classical Set Covering Machine algorithm for conjunctions/disjunctions of binary-valued rules that provably avoids spurious associations.
arXiv Detail & Related papers (2023-06-07T20:52:01Z) - Probabilities Are Not Enough: Formal Controller Synthesis for Stochastic
Dynamical Models with Epistemic Uncertainty [68.00748155945047]
Capturing uncertainty in models of complex dynamical systems is crucial to designing safe controllers.
Several approaches use formal abstractions to synthesize policies that satisfy temporal specifications related to safety and reachability.
Our contribution is a novel abstraction-based controller method for continuous-state models with noise, uncertain parameters, and external disturbances.
arXiv Detail & Related papers (2022-10-12T07:57:03Z) - Local Constraint-Based Causal Discovery under Selection Bias [8.465604845422238]
We consider the problem of discovering causal relations from independence constraints selection bias in addition to confounding is present.
We focus instead on local patterns of independence relations, where we find no sound method for only three variable that can include background knowledge.
Y-Structure patterns are shown to be sound in predicting causal relations from data under selection bias, where cycles may be present.
arXiv Detail & Related papers (2022-03-03T16:52:22Z) - Exploiting Independent Instruments: Identification and Distribution
Generalization [3.701112941066256]
We exploit the independence for distribution generalization by taking into account higher moments.
We prove that the proposed estimator is invariant to distributional shifts on the instruments.
These results hold even in the under-identified case where the instruments are not sufficiently rich to identify the causal function.
arXiv Detail & Related papers (2022-02-03T21:49:04Z) - Discovering Latent Causal Variables via Mechanism Sparsity: A New
Principle for Nonlinear ICA [81.4991350761909]
Independent component analysis (ICA) refers to an ensemble of methods which formalize this goal and provide estimation procedure for practical application.
We show that the latent variables can be recovered up to a permutation if one regularizes the latent mechanisms to be sparse.
arXiv Detail & Related papers (2021-07-21T14:22:14Z) - 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) - Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values.
We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions.
For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
arXiv Detail & Related papers (2020-08-19T16:04:34Z)
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.