Hidden Variable Model Research Articles

Hidden variable model for quantum computation with magic states on qudits of any dimension

It was recently shown that a hidden variable model can be constructed for universal quantum computation with magic states on qubits. Here we show that this result can be extended, and a hidden variable model can be defined for quantum computation with magic states on qudits with any Hilbert space dimension. This model leads to a classical simulation algorithm for universal quantum computation.

Geometric interpretation and experimental test of Leggett inequalities with nonmaximally entangled states.

Leggett inequality states that nonlocal hidden-variable models might still be incompatible with the predictions of quantum physics. However, its theoretical and experimental demonstration is only in the scenario of 2-dimensional maximally entangled systems. An open question remains as to whether the Leggett inequality can be violated by nonmaximally entangled states. Here, we answer this question both in theory and experiment. Specifically, from the point of view of geometry, we theoretically map the problem of maximizing the correlation measure in the Leggett inequality to maximizing the sum of an ellipse's diameter and semi-diameter axes, accordingly, demonstrating that the violation of the Leggett inequality requires a more robust entanglement than that of Bell's theory. Experimentally, by leveraging the controllable photonic orbital angular momentum entanglement, we demonstrate the violation of Leggett-type inequalities by more than 8.7 and 4.5 standard deviations under concurrence C = 0.95 and 0.9, respectively. Our observations indicate that, the requirement for quantum correlation should be increased to exclude a particular class of non-local hidden variable theories that abide by Leggett's model, providing insights into the boundaries of quantum correlation and the limitations imposed by non-local hidden variables.

Hidden variables, free choice, context-independence and all that.

This paper provides a systematic account of the hidden variable models (HVMs) formulated to describe systems of random variables with mutually exclusive contexts. Any such system can be described either by a model with free choice but generally context-dependent mapping of the hidden variables into observable ones, or by a model with context-independent mapping but generally compromised free choice. These two types of HVMs are equivalent, one can always be translated into another. They are also unfalsifiable, applicable to all possible systems. These facts, the equivalence and unfalsifiability, imply that freedom of choice and context-independent mapping are no assumptions at all, and they tell us nothing about freedom of choice or physical influences exerted by contexts as these notions would be understood in science and philosophy. The conjunction of these two notions, however, defines a falsifiable HVM that describes non-contextuality when applied to systems with no disturbance or to consistifications of arbitrary systems. This HVM is most adequately captured by the term 'context-irrelevance', meaning that no distribution in the model changes with context. This article is part of the theme issue 'Quantum contextuality, causality and freedom of choice'.

Generalized Bell Scenarios: Disturbing Consequences on Local-Hidden-Variable Models.

Bell nonlocality and Kochen-Specker contextuality are among the main topics in the foundations of quantum theory. Both of them are related to stronger-than-classical correlations, with the former usually referring to spatially separated systems, while the latter considers a single system. In recent works, a unified framework for these phenomena was presented. This article reviews, expands, and obtains new results regarding this framework. Contextual and disturbing features inside the local models are explored, which allows for the definition of different local sets with a non-trivial relation among them. The relations between the set of quantum correlations and these local sets are also considered, and post-quantum local behaviours are found. Moreover, examples of correlations that are both local and non-contextual but such that these two classical features cannot be expressed by the same hidden variable model are shown. Extensions of the Fine-Abramsky-Brandenburger theorem are also discussed.

Bell's theorem in time without inequalities

Bell's theorem revealed that a local hidden-variable model cannot completely reproduce the quantum mechanical predictions. Bell's inequality provides an upper bound under the locality and reality assumptions that can be violated by correlated measurement statistics of quantum mechanics. Greenberger, Horne, and Zeilinger (GHZ) gave a more compelling proof of Bell's theorem without inequalities by considering perfect correlations rather than statistical correlations. In this work, we present a temporal analogue of GHZ argument that establishes Bell's theorem in time without inequalities.

Device-independent and semi-device-independent entanglement certification in broadcast Bell scenarios

It has recently been shown that by broadcasting the subsystems of a bipartite quantum state, one can activate Bell nonlocality and significantly improve noise tolerance bounds for device-independent entanglement certification. In this work we strengthen these results and explore new aspects of this phenomenon. First, we prove new results related to the activation of Bell nonlocality. We construct Bell inequalities tailored to the broadcast scenario, and show how broadcasting can lead to even stronger notions of Bell nonlocality activation. In particular, we exploit these ideas to show that bipartite states admitting a local hidden-variable model for general measurements can lead to genuine tripartite nonlocal correlations. We then study device-independent entanglement certification in the broadcast scenario, and show through semidefinite programming techniques that device-independent entanglement certification is possible for the two-qubit Werner state in essentially the entire range of entanglement. Finally, we extend the concept of EPR steering to the broadcast scenario, and present novel examples of activation of the two-qubit isotropic state. Our results pave the way for broadcast-based device-independent and semi-device-independent protocols.

Graph-theoretic approach to Bell experiments with low detection efficiency

Bell inequality tests where the detection efficiency is below a certain threshold ηcrit can be simulated with local hidden-variable models. Here, we introduce a method to identify Bell tests requiring low ηcrit and relatively low dimension d of the local quantum systems. The method has two steps. First, we show a family of bipartite Bell inequalities for which, for correlations produced by maximally entangled states, ηcrit can be upper bounded by a function of some invariants of graphs, and use it to identify correlations that require small ηcrit. We present examples in which, for maximally entangled states, ηcrit≤0.516 for d=16, ηcrit≤0.407 for d=28, and ηcrit≤0.326 for d=32. We also show evidence that the upper bound for ηcrit can be lowered down to 0.415 for d=16 and present a method to make the upper bound of ηcrit arbitrarily small by increasing the dimension and the number of settings. All these upper bounds for ηcrit are valid (as it is the case in the literature) assuming no noise. The second step is based on the observation that, using the initial state and measurement settings identified in the first step, we can construct Bell inequalities with smaller ηcrit and better noise robustness. For that, we use a modified version of Gilbert's algorithm that takes advantage of the automorphisms of the graphs used in the first step. We illustrate its power by explicitly developing an example in which ηcrit is 12.38% lower and the required visibility is 14.62% lower than the upper bounds obtained in the first step. The tools presented here may allow for developing high-dimensional loophole-free Bell tests and loophole-free Bell nonlocality over long distances.

Quantum computational advantage attested by nonlocal games with the cyclic cluster state

We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner. In these games, the circuit depth needed to prepare a cyclic cluster state and measure a subset of its Pauli stabilizers on a quantum computer is compared to that of classical Boolean circuits with the same, nearest-neighboring gate connectivity. Using a circuit-based trapped-ion quantum computer, we prepare and measure a six-qubit cyclic cluster state with an overall fidelity of 60.6% and 66.4%, before and after correcting for measurement-readout errors, respectively. Our experimental results indicate that while this fidelity readily passes conventional (or depth-0) Bell bounds for local hidden-variable models, it is on the cusp of demonstrating a higher probability of success than what is possible by depth-1 classical circuits. Our games offer a practical and scalable set of quantitative benchmarks for quantum computers in the pre-fault-tolerant regime as the number of qubits available increases.

Context-independent mapping and free choice are equivalent: a general proof

Free choice (or statistical independence) assumption in a hidden variable model (HVM) means that the settings chosen by experimenters do not depend on the values of the hidden variable. The assumption of context-independent (CI) mapping in an HVM means that the results of a measurement do not depend on settings for other measurements. If the measurements are spacelike separated, this assumption is known as local causality. Both free choice and CI mapping assumptions are considered necessary for derivation of the Bell-type criteria of contextuality/nonlocality. It is known, however, for a variety of special cases, that the two assumptions are not logically independent. We show here, in complete generality, for any system of random variables with or without disturbance/signaling, that an HVM that postulates CI mapping is equivalent to an HVM that postulates free choice. If one denies the possibility that a given empirical scenario can be described by an HVM in which measurements depend on other measurements’ settings, free choice violations should be denied too, and vice versa.

Imitating Quantum Probabilities: Beyond Bell’s Theorem and Tsirelson Bounds

Local hidden-variable model of singlet-state correlations discussed in Czachor (Acta Phys Polon A 139:70, 2021a) is shown to be a particular case of an infinite hierarchy of local hidden-variable models based on an infinite hierarchy of calculi. Violation of Bell-type inequalities can be interpreted as a ‘confusion of languages’ problem, a result of mixing different but neighboring levels of the hierarchy. Mixing of non-neighboring levels results in violations beyond the Tsirelson bounds.

Witnessing Bell violations through probabilistic negativity

Bell's theorem shows that no local hidden-variable model can explain the measurement statistics of a quantum system shared between two parties, thus ruling out a classical (local) understanding of nature. In this paper we demonstrate that by relaxing the positivity restriction in the hidden-variable probability distribution it is possible to derive quasiprobabilistic Bell inequalities whose sharp upper bound is written in terms of a negativity witness of said distribution. This provides an analytic solution for the amount of negativity necessary to violate the Clauser-Horne-Shimony-Holt inequality by an arbitrary amount, therefore revealing the amount of negativity required to emulate the quantum statistics in a Bell test.

Analysis of the superdeterministic Invariant-set theory in a hidden-variable setting

A recent proposal for a superdeterministic account of quantum mechanics, named Invariant-set theory, appears to bring ideas from several diverse fields like chaos theory, number theory and dynamical systems to quantum foundations. However, a clear cut hidden-variable model has not been developed, which makes it difficult to assess the Proposal from a quantum foundational perspective. In this article, we first build a hidden-variable model based on the Proposal, and then critically analyse several aspects of the Proposal using the model. We show that several arguments related to counter-factual measurements, nonlocality, non-commutativity of quantum observables, measurement independence etcetera that appear to work in the Proposal fail when considered in our model. We further show that our model is not only superdeterministic but also nonlocal, with an ontic quantum state. We argue that the bit string defined in the model is a hidden variable and that it contains redundant information. Lastly, we apply the analysis developed in a previous work (Sen I, Valentini A, 2020 Proc. R. Soc. A , 476 , 20200214) to illustrate the issue of superdeterministic conspiracy in the model. Our results lend further support to the view that superdeterminism is unlikely to solve the puzzle posed by the Bell correlations.

Entanglement-based quantum communication complexity beyond Bell nonlocality

Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks, such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be minimised—a key motivation behind the communication complexity problem (CCP). Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. Furthermore, the connection between quantum CCPs and non-locality provides an information-theoretic insight into fundamental quantum mechanics. Here we connect quantum CCPs with a generalised non-locality framework—beyond Bell’s paradigmatic theorem—by incorporating the underlying causal structure, which governs the distributed task, into a so-called non-local hidden-variable model. We prove that a new class of communication complexity tasks can be associated with Bell-like inequalities, whose violation is both necessary and sufficient for a quantum gain. We experimentally implement a multipartite CCP akin to the guess-your-neighbour-input scenario, and demonstrate a quantum advantage when multipartite Greenberger-Horne-Zeilinger (GHZ) states are shared among three users.

Proposal for a Bell test in cavity optomagnonics

We present a proposal to test Bell inequality in the emerging field of cavity optomagnonics, where a sphere of ferromagnetic crystal supports two optical whispering gallery modes and one magnon mode. The two optical modes are driven by two laser pulses, respectively. Entanglement between magnon mode and one of the two optical modes will be generated by the first pulse, and the state of magnon mode is subsequently mapped into another optical mode via the second pulse. Hence correlated photon-photon pairs is created out of the cavity. A Bell test can be implemented using these pairs, which enables us to test local hidden-variable models at macroscopic optomagnonical system. Our results show that a significant violation of Bell inequality can be obtained in the experimentally relevant weak-coupling regime. The violation of Bell inequality not only verifies the entanglement between magnons and photons, but also implies that cavity optomagnonics is a promising platform for quantum information processing tasks.

Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence

We study hidden-variable models from quantum mechanics and their abstractions in purely probabilistic and relational frameworks by means of logics of dependence and independence, which are based on team semantics. We show that common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae. Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria. We also discuss the ‘no-go’ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property.

Fast selection of nonlinear mixed effect models using penalized likelihood

Nonlinear Mixed effects models are hidden variables models that are widely used in many fields such as pharmacometrics. In such models, the distribution characteristics of hidden variables can be specified by including several parameters such as covariates or correlations which must be selected. Recent development of pharmacogenomics has brought averaged/high dimensional problems to the field of nonlinear mixed effects modeling for which standard covariates selection techniques like stepwise methods are not well suited. The selection of covariates and correlation parameters using a penalized likelihood approach is proposed. The penalized likelihood problem is solved using a stochastic proximal gradient algorithm to avoid inner-outer iterations. Speed of convergence of the proximal gradient algorithm is improved using component-wise adaptive gradient step sizes. The practical implementation and tuning of the proximal gradient algorithm are explored using simulations. Calibration of regularization parameters is performed by minimizing the Bayesian Information Criterion using particle swarm optimization, a zero-order optimization procedure. The use of warm restart and parallelization allowed computing time to be reduced significantly. The performance of the proposed method compared to the traditional grid search strategy is explored using simulated data. Finally, an application to real data from two pharmacokinetics studies is provided, one studying an antifibrinolytic and the other studying an antibiotic.

Modified quantum delayed-choice experiment without quantum control or entanglement assistance

Wheeler's delayed-choice experiment delays the decision to observe either the wave or particle behavior of a photon until after it has entered the interferometer, and the quantum delayed-choice experiment provides the possibility of observing the wave and particle behaviors with a single experimental setup by introducing quantum control. We here propose a modified quantum delayed-choice experiment without quantum control or entanglement assistance, in which a photon can be prepared in a wave-particle superposition state and the morphing behavior of wave-to-particle transition can be observed easily. It is demonstrated that the presented scheme can allow us to rule out classical hidden-variable models in a device-independent manner via violating dimension witness. We also extend the scheme to the situation of two degrees of freedom, first constructing a hybrid quantum delayed-choice experiment which enables a photon respectively exhibits wave and particle behaviors in different degrees of freedom, and then proposing a scheme to prepare the single-photon wave-particle entanglement. This study is not only meaningful to explore the wave-particle complementarity of photons, but also provides potential for the research of the single-particle nonlocality from the perspective of the wave-particle degree of freedom.

Dynamic hidden-variable network models.

Models of complex networks often incorporate node-intrinsic properties abstracted as hidden variables. The probability of connections in the network is then a function of these variables. Real-world networks evolve over time and many exhibit dynamics of node characteristics as well as of linking structure. Here we introduce and study natural temporal extensions of static hidden-variable network models with stochastic dynamics of hidden variables and links. The dynamics is controlled by two parameters: one that tunes the rate of change of hidden variables and another that tunes the rate at which node pairs reevaluate their connections given the current values of hidden variables. Snapshots of networks in the dynamic models are equivalent to networks generated by the static models only if the link reevaluation rate is sufficiently larger than the rate of hidden-variable dynamics or if an additional mechanism is added whereby links actively respond to changes in hidden variables. Otherwise, links are out of equilibrium with respect to hidden variables and network snapshots exhibit structural deviations from the static models. We examine the level of structural persistence in the considered models and quantify deviations from staticlike behavior. We explore temporal versions of popular static models with community structure, latent geometry, and degree heterogeneity. While we do not attempt to directly model real networks, we comment on interesting qualitative resemblances to real systems. In particular, we speculate that links in some real networks are out of equilibrium with respect to hidden variables, partially explaining the presence of long-ranged links in geometrically embedded systems and intergroup connectivity in modular systems. We also discuss possible extensions, generalizations, and applications of the introduced class of dynamic network models.

Non-Contextual and Local Hidden-Variable Model for the Peres–Mermin and Greenberger–Horne–Zeilinger Systems

A hidden-variable model for quantum-mechanical spin, as represented by the Pauli spin operators, is proposed for systems illustrating the well-known no-hidden-variables arguments by Peres and Mermin (1990) and by Greenberger, Horne, and Zeilinger (1989). Both arguments rely on an assumption of non-contextuality; the latter argument can also be phrased as a non-locality argument, using a locality assumption. The model suggested here is compatible with both assumptions. This is possible because the scalar values of spin observables are replaced by vectors that are components of orientations.

Quantum uncertainty as classical uncertainty of real-deterministic variables constructed from complex weak values and a global random variable

What does it take for real-deterministic $c$-valued (i.e., classical, commuting) variables to comply with the Heisenberg uncertainty principle? Here, we construct a class of real-deterministic $c$-valued variables out of the weak values obtained via a nonperturbing weak measurement of quantum operators with a postselection over a complete set of state vectors basis, which always satisfies the Kennard-Robertson-Schr\"odinger uncertainty relation. First, we introduce an auxiliary global random variable and couple it to the imaginary part of the weak value to convert the incompatibility between the quantum operator and the basis into the fluctuation of an ``error term,'' and then superimpose it onto the real part of the weak value. We show that this class of ``$c$-valued physical quantities'' provides a real-deterministic contextual hidden-variable model for the quantum expectation value of a certain class of operators. We then show that the Schr\"odinger and the Kennard-Robertson lower bounds can be obtained separately by imposing the classical uncertainty relation to the $c$-valued physical quantities associated with a pair of Hermitian operators. Within the representation, the complementarity between two incompatible quantum observables manifests the absence of a basis wherein the error terms of the associated two $c$-valued physical quantities simultaneously vanish. Furthermore, quantum uncertainty principle is captured by a specific irreducible epistemic restriction between the two $c$-valued physical quantities, foreign in classical mechanics, constraining the allowed form of their joint distribution. We then suggest an epistemic interpretation of the two terms decomposing the $c$-valued physical quantity as the optimal estimate under the epistemic restriction and the associated estimation error, and discuss the classical limit.