Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physics Today

Shadows and Mirrors: Reconstructing Quantum States of Atom Motion

Dietrich G. Leibfried, Tilman Pfau, Christopher R. Monroe

Published Apr 1, 1998• 98 citations
Publisher

Abstract

Imagine that a pair of coins are tossed in a black box. The box reports only one of the following three results at random: (1) the outcome of the first coin (heads or tails), (2) the outcome of the second coin (heads or tails), or (3) whether the outcomes of the two coins matched or were different. Our task is to construct a joint probability distribution of the four possible outcomes of the coins (HH, TT, HT, TH) based on many observations of the black box outputs. Now suppose that after many trials, the black box reports that each coin comes up heads two-thirds of the time when measured individually, yet the coins never match when they are compared. (Clearly the results of the coin tosses have been correlated—perhaps a joker in the black box flips the coins and then changes the outcomes appropriately). We seek a distribution that both reflects this correlation and obeys the marginal distributions of each coin as two-thirds heads, one-third tails (see the three tables on page 23). The only way to satisfy both requirements is to force the joint probability P(TT) of getting two tails to be negative! Mathematically, this is because P(HH)+P(TT) is observed to be zero, yet we expect P(HH)to be greater than P(TT), because the individual coins are weighted toward heads.

DOI
10.1063/1.882256

Related papers

Uncertain Decisions and the Many-Minds Interpretation of Quantum Mechanics

David Papineau

Abstract Imagine you are faced with a quantum-mechanical device which will display either H or T (‘heads’, ‘tails’) when it is operated (‘spun’). You know that the single-case probability, or chance, of H is 0.8, and the chance of T is 0.2. (I could have taken a biased coin, but I wanted to make it clear that we are dealing with chances.)

Oxford University Press eBooks•Jan 16, 2003•1 citation

Correlations in a system of classical-like coins simulating spin-1/2 states in the probability representation of quantum mechanics

Vladimir N. Chernega, Olga V. Man’ko, Vladimir I. Man’ko

arXiv:1902.03613•The European Physical Journal D•Jan 1, 2019•17 citations

On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks

Dana Dachman-Soled

Two main goals of modern cryptography are to identify the minimal assumptions necessary to construct secure cryptographic primitives as well as to construct secure protocols in strong and realistic adversarial models. In this thesis, we address both of these fundamental questions. In the first part of this thesis, we present results on the black-box complexity of two basic cryptographic primitives: non-malleable encryption and optimally-fair coin tossing. Black-box reductions are reductions in which both the underlying primitive as well as the adversary are accessed only in an input-output (or black-box) manner. Most known cryptographic reductions are black-box. Moreover, black-box reductions are typically more efficient than non-black-box reductions. Thus, the black-box complexity of cryptographic primitives is a meaningful and important area of study which allows us to gain insight into the primitive. We study the black box complexity of non-malleable encryption and optimally-fair coin tossing, showing a positive result for the former and a negative one for the latter. Non-malleable encryption is a strong security notion for public-key encryption, guaranteeing that it is impossible to "maul" a ciphertext of a message m into a ciphertext of a related message. This security guarantee is essential for many applications such as auctions. We show how to transform, in a black-box manner, any public-key encryption scheme satisfying a weak form of security, semantic security, to a scheme satisfying non-malleability. Coin tossing is perhaps the most basic cryptographic primitive, allowing two distrustful parties to flip a coin whose outcome is 0 or 1 with probability 1/2. A fair coin tossing protocol is one in which the outputted bit is unbiased, even in the case where one of the parties may abort early. However, in the setting where parties may abort early, there is always a strategy for one of the parties to impose bias of Omega(1/r) in an r-round protocol. Thus, achieving bias of O(1/r) in r rounds is optimal, and it was recently shown that optimally-fair coin tossing can be achieved via a black-box reduction to oblivious transfer. We show that it cannot be achieved via a black-box reduction to one-way function, unless the number of rounds is at least Omega(n/log n), where n is the input/output length of the one-way function. In the second part of this thesis, we present protocols for multiparty computation (MPC) in the Universal Composability (UC) model that are secure against malicious, adaptive adversaries. In the standard model, security is only guaranteed in a stand-alone setting; however, nothing is guaranteed when multiple protocols are arbitrarily composed. In contrast, the UC model, introduced by (Canetti, 2000), considers the execution of an unbounded number of concurrent protocols, in an arbitrary, and adversarially controlled network environment. Another drawback of the standard model is that the adversary must decide which parties to corrupt before the execution of the protocol commences. A more realistic model allows the adversary to adaptively choose which parties to corrupt based on its evolving view during the protocol. In our work we consider the the adaptive UC model, which combines these two security requirements by allowing both arbitrary composition of protocols and adaptive corruption of parties. In our first result, we introduce an improved, efficient construction of non-committing encryption (NCE) with optimal round complexity, from a weaker primitive we introduce called trapdoor-simulatable public key encryption (PKE). NCE is a basic primitive necessary to construct protocols secure under adaptive corruptions and in particular, is used to construct oblivious transfer (OT) protocols secure against semi-honest, adaptive adversaries. Additionally, we show how to realize trapdoor-simulatable PKE from hardness of factoring Blum integers, thus achieving the first construction of NCE from hardness of factoring. In our second result, we present a compiler for transforming an OT protocol secure against a semi-honest, adaptive adversary into one that is secure against a malicious, adaptive adversary. Our compiler achieves security in the UC model, assuming access to an ideal commitment functionality, and improves over previous work achieving the same security guarantee in two ways: it uses black-box access to the underlying protocol and achieves a constant multiplicative overhead in the round complexity. Combining our two results with the work of (Ishai et al., 2008), we obtain the first black-box construction of UC and adaptively secure MPC from trapdoor-simulatable PKE and the ideal commitment functionality.

•Jan 1, 2011•0 citations

Unseen facts due to the statistical derivation of the Bell inequality and their logical consequences

Louis Sica

The Bell inequality is derived under the assumption of three physical data sets, random or deterministic. The data sets represent a laboratory realization of the three probability based variables used by Bell. For physical data as can be written on paper, the derivation of the inequality results only from principles of algebra and is independent of assumptions of locality, hidden variables and even randomness. Cross correlations of thee data sets carried out as Bell correlated three random variables results in the same inequality that is identically satisfied even by deterministic data. However, to obtain three data sets on two particles destroyed by measurement, two experimental runs are required, followed by data matching to reduce four data sets to three. If quantum mechanical probabilities are used to describe the data frequencies, the Bell inequality is satisfied. The situation is analogous to performing two sets of coin flips to compare the effect of two different coin loadings on the probabilities for heads and tails.

arXiv:2108.08283•Aug 16, 2021•0 citations

Interference Is Exophysically Absent

Interference is the hardest-to-explain property of our quantum reality. Negative probabilities ("amplitudes") have no classical analog, for averaging can never yield a zero outcome starting from nonzero components. As soon as an endophysical explanation of interference is attempted, on the other hand, the price to pay is that the phenomenon ceases to exist exo-objectively. For it remains valid only in the interface of the observer. On the interface, interference indeed arises when many different successive interface worlds are overlaid in an integrating fashion. Since the particle makes a different motion in each interface world — hitting a counter in the one and taking off from it (hitting it in negative time) in the other the net effect can indeed be destructive: a "canceling-out." Motions that either come or go act like quantum amplitudes. Interference thereby becomes "dual" to state reduction. Whereas interference fuses many successive interface worlds as we saw, state reduction "fixates" a single one in the interface at the expense of all others. World-splitting (state reduction) and world-combining (interference) occur in the interface on the same footing — depending on whether a macroscopic record (which cannot be superposed) is present or not. The prediction that interference is exophysically absent can perhaps be put to a test. The experiment is called the "unbiased quantum coin." In the original quantum coin experiment proposed by Schrödinger in 1935 (illustrated by the fate of an imaginary cat), "heads" and "tails" were defined by two equiprobable quantum events. In the modified version proposed here, "heads" is caused by an event made rarer than 50 percent by destructive interference and "tails" is caused by an event made more frequent than 50 percent by constructive interference. A deterministic "unbiasing" has then to be added — like letting every heads click but only every tenth tails click pass through by means of a computer program. The resulting "coin" is then fully acceptable as the source of a bias-free random binary sequence. The "modified quantum ordeal" obtained can possibly be put to a good use — to improve the world on the exo level. While the coin is perfectly fair endophysically, it is "more than fair" exophysically — with its "heads" events. While endophysically there is no difference to the classic Schrödinger cat experiment, the "bonus" given to the rarer outcome ("heads") becomes a real gain exophysically; for the interference-induced "dip" is exophysically absent but the compensating bonus is not. Hence a lottery based on the new unbiased quantum coin would, while being innocuous endophysically, generate more than its share of millionaires exophysically. Even though the gain would be "shielded" from being perceptible endophysically, some subtle trickle-down effect from this "exo-altruism" (since it is a gift without direct returns) cannot be ruled out. In the positive case, the existence of the exo level would be demonstrable. The proposal is related to David Deutsch's idea of subtly exploiting Everett's theory.

WORLD SCIENTIFIC eBooks•May 1, 1998•1 citation

A Critical Experiment on the Statistical Interpretation of Quantum Mechanics

Arthur E. Ruark

Consider a dynamical system with a single coordinate q, and energy E, and let [ represent the Schrodinger wave function of this system.It is commonly stated that the function

Proceedings of the National Academy of Sciences•Apr 1, 1928•1 citation
Imagine that a pair of coins are tossed in a black box. The box reports only one of the following three results at random: (1) the outcome of the first coin (heads or tails), (2) the outcome of the second coin (heads or tails), or (3) whether the outcomes of the two coins matched or were different. Our task is to construct a joint probability distribution of the four possible outcomes of the coins (HH, TT, HT, TH) based on many observations of the black box outputs. Now suppose that after many trials, the black box reports that each coin comes up heads two-thirds of the time when measured individually, yet the coins never match when they are compared. (Clearly the results of the coin tosses have been correlated—perhaps a joker in the black box flips the coins and then changes the outcomes appropriately). We seek a distribution that both reflects this correlation and obeys the marginal distributions of each coin as two-thirds heads, one-third tails (see the three tables on page 23). The only way to satisfy both requirements is to force the joint probability P(TT) of getting two tails to be negative! Mathematically, this is because P(HH)+P(TT) is observed to be zero, yet we expect P(HH)to be greater than P(TT), because the individual coins are weighted toward heads.
Two main goals of modern cryptography are to identify the minimal assumptions necessary to construct secure cryptographic primitives as well as to construct secure protocols in strong and realistic adversarial models. In this thesis, we address both of these fundamental questions. In the first part of this thesis, we present results on the black-box complexity of two basic cryptographic primitives: non-malleable encryption and optimally-fair coin tossing. Black-box reductions are reductions in which both the underlying primitive as well as the adversary are accessed only in an input-output (or black-box) manner. Most known cryptographic reductions are black-box. Moreover, black-box reductions are typically more efficient than non-black-box reductions. Thus, the black-box complexity of cryptographic primitives is a meaningful and important area of study which allows us to gain insight into the primitive. We study the black box complexity of non-malleable encryption and optimally-fair coin tossing, showing a positive result for the former and a negative one for the latter. Non-malleable encryption is a strong security notion for public-key encryption, guaranteeing that it is impossible to "maul" a ciphertext of a message m into a ciphertext of a related message. This security guarantee is essential for many applications such as auctions. We show how to transform, in a black-box manner, any public-key encryption scheme satisfying a weak form of security, semantic security, to a scheme satisfying non-malleability. Coin tossing is perhaps the most basic cryptographic primitive, allowing two distrustful parties to flip a coin whose outcome is 0 or 1 with probability 1/2. A fair coin tossing protocol is one in which the outputted bit is unbiased, even in the case where one of the parties may abort early. However, in the setting where parties may abort early, there is always a strategy for one of the parties to impose bias of Omega(1/r) in an r-round protocol. Thus, achieving bias of O(1/r) in r rounds is optimal, and it was recently shown that optimally-fair coin tossing can be achieved via a black-box reduction to oblivious transfer. We show that it cannot be achieved via a black-box reduction to one-way function, unless the number of rounds is at least Omega(n/log n), where n is the input/output length of the one-way function. In the second part of this thesis, we present protocols for multiparty computation (MPC) in the Universal Composability (UC) model that are secure against malicious, adaptive adversaries. In the standard model, security is only guaranteed in a stand-alone setting; however, nothing is guaranteed when multiple protocols are arbitrarily composed. In contrast, the UC model, introduced by (Canetti, 2000), considers the execution of an unbounded number of concurrent protocols, in an arbitrary, and adversarially controlled network environment. Another drawback of the standard model is that the adversary must decide which parties to corrupt before the execution of the protocol commences. A more realistic model allows the adversary to adaptively choose which parties to corrupt based on its evolving view during the protocol. In our work we consider the the adaptive UC model, which combines these two security requirements by allowing both arbitrary composition of protocols and adaptive corruption of parties. In our first result, we introduce an improved, efficient construction of non-committing encryption (NCE) with optimal round complexity, from a weaker primitive we introduce called trapdoor-simulatable public key encryption (PKE). NCE is a basic primitive necessary to construct protocols secure under adaptive corruptions and in particular, is used to construct oblivious transfer (OT) protocols secure against semi-honest, adaptive adversaries. Additionally, we show how to realize trapdoor-simulatable PKE from hardness of factoring Blum integers, thus achieving the first construction of NCE from hardness of factoring. In our second result, we present a compiler for transforming an OT protocol secure against a semi-honest, adaptive adversary into one that is secure against a malicious, adaptive adversary. Our compiler achieves security in the UC model, assuming access to an ideal commitment functionality, and improves over previous work achieving the same security guarantee in two ways: it uses black-box access to the underlying protocol and achieves a constant multiplicative overhead in the round complexity. Combining our two results with the work of (Ishai et al., 2008), we obtain the first black-box construction of UC and adaptively secure MPC from trapdoor-simulatable PKE and the ideal commitment functionality.
The Bell inequality is derived under the assumption of three physical data sets, random or deterministic. The data sets represent a laboratory realization of the three probability based variables used by Bell. For physical data as can be written on paper, the derivation of the inequality results only from principles of algebra and is independent of assumptions of locality, hidden variables and even randomness. Cross correlations of thee data sets carried out as Bell correlated three random variables results in the same inequality that is identically satisfied even by deterministic data. However, to obtain three data sets on two particles destroyed by measurement, two experimental runs are required, followed by data matching to reduce four data sets to three. If quantum mechanical probabilities are used to describe the data frequencies, the Bell inequality is satisfied. The situation is analogous to performing two sets of coin flips to compare the effect of two different coin loadings on the probabilities for heads and tails.
Interference is the hardest-to-explain property of our quantum reality. Negative probabilities ("amplitudes") have no classical analog, for averaging can never yield a zero outcome starting from nonzero components. As soon as an endophysical explanation of interference is attempted, on the other hand, the price to pay is that the phenomenon ceases to exist exo-objectively. For it remains valid only in the interface of the observer. On the interface, interference indeed arises when many different successive interface worlds are overlaid in an integrating fashion. Since the particle makes a different motion in each interface world — hitting a counter in the one and taking off from it (hitting it in negative time) in the other the net effect can indeed be destructive: a "canceling-out." Motions that either come or go act like quantum amplitudes. Interference thereby becomes "dual" to state reduction. Whereas interference fuses many successive interface worlds as we saw, state reduction "fixates" a single one in the interface at the expense of all others. World-splitting (state reduction) and world-combining (interference) occur in the interface on the same footing — depending on whether a macroscopic record (which cannot be superposed) is present or not. The prediction that interference is exophysically absent can perhaps be put to a test. The experiment is called the "unbiased quantum coin." In the original quantum coin experiment proposed by Schrödinger in 1935 (illustrated by the fate of an imaginary cat), "heads" and "tails" were defined by two equiprobable quantum events. In the modified version proposed here, "heads" is caused by an event made rarer than 50 percent by destructive interference and "tails" is caused by an event made more frequent than 50 percent by constructive interference. A deterministic "unbiasing" has then to be added — like letting every heads click but only every tenth tails click pass through by means of a computer program. The resulting "coin" is then fully acceptable as the source of a bias-free random binary sequence. The "modified quantum ordeal" obtained can possibly be put to a good use — to improve the world on the exo level. While the coin is perfectly fair endophysically, it is "more than fair" exophysically — with its "heads" events. While endophysically there is no difference to the classic Schrödinger cat experiment, the "bonus" given to the rarer outcome ("heads") becomes a real gain exophysically; for the interference-induced "dip" is exophysically absent but the compensating bonus is not. Hence a lottery based on the new unbiased quantum coin would, while being innocuous endophysically, generate more than its share of millionaires exophysically. Even though the gain would be "shielded" from being perceptible endophysically, some subtle trickle-down effect from this "exo-altruism" (since it is a gift without direct returns) cannot be ruled out. In the positive case, the existence of the exo level would be demonstrable. The proposal is related to David Deutsch's idea of subtly exploiting Everett's theory.