A coin is just a two sided dice. Recently, Mochon proved that quantum weak coin flipping with an arbitrarily small bias is possible. However, the use of quantum resources to allow N remote distrustful parties to roll an N-sided dice has yet to be addressed. In this paper we show that contrary to the classical case, N-sided dice rolling with arbitrarily small bias is possible for any N. In addition, we present a six-round three-sided dice rolling protocol, achieving a bias of 0.181, which incorporates weak imbalanced coin flipping.
We generalize the problem of coin flipping to more than two outcomes and parties. We term this problem dice rolling, and study both its weak and strong variants. We prove by construction that in quantum settings (i) weak N-sided dice rolling admits an arbitrarily small bias for any value of N, and (ii) two-party strong N-sided dice rolling saturates the corresponding generalization of Kitaev's bound for any value of N. In addition, we make use of this last result to introduce a family of optimal 2m-party strong n^m-sided dice rolling protocols for any value of m and n.
One of the key challenges in quantum information is coherently manipulating the quantum state. However, it is an outstanding question whether control can be realized with low error. Only gates from the Clifford group -- containing $π$, $π/2$, and Hadamard gates -- have been characterized with high accuracy. Here, we show how the Platonic solids enable implementing and characterizing larger gate sets. We find that all gates can be implemented with low error. The results fundamentally imply arbitrary manipulation of the quantum state can be realized with high precision, providing new practical p…
In a letter to Born, Einstein wrote: "Quantum mechanics is certainly imposing. But an inner voice tells me that it is not yet the real thing. The theory says a lot, but does not really bring us any closer to the secret of the old one. I, at any rate, am convinced that He does not throw dice." In this paper we take seriously Einstein's famous metaphor, and show that we can gain considerable insight into quantum mechanics by doing something as simple as rolling dice. More precisely, we show how to perform measurements on a single die, to create typical quantum interference effects, and how to co…
Principle of Relativity involving all, not only subluminal, inertial frames leads to the disturbance of causal laws in a way known from the fundamental postulates of Quantum Theory. We show how quantum indeterminacy based on complex probability amplitudes with superposition principle emerges from Special Relativity.
We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n bits of true randomness from a seed of O(log n) uniform bits. The bits generated are certifiably random based only on a simple statistical test that can be performed by the user, and on the assumption that the devices obey the no-signaling principle. No other assumptions are placed on the devices' inner workings. A modified protocol uses a seed of O(log^3 n) uniformly random bits to generate $n$ bits of true randomness even conditioned on the state of a quantum adversary who may have had prior …
In this paper, we present a semi-loss-tolerant strong quantum coin-flipping (QCF) protocol with the best bias of 0.3536. Our manuscript applies Quantum non-demolition (QND) measurement to quantum coin-flipping protocol. Furthermore, a single photon as a single qubit is used to avoid the difficult implementation of EPR resources. We also analyze the security of our protocol obtaining the best result among all coin-flipping protocols considering loss. A semi-loss-tolerant Quantum Dice Rolling (QDR) protocol is first proposed, and the security of corresponding three-party QDR is analyzed to bette…
We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to $M \geq 2$ parties and to $N \geq 2$ outcomes for any chosen outcome biases, and show them unconditionally secure. Our results prove that the most general random secure multi-party computation, where all parties receive the output and there is no secret input by any party, can be implemented with unconditional security. Our protocols extend Kent's [A. Kent, Phys. Rev. Lett. 83, 5382 (1999)] two-party unbiased coin flipping protocol, do not require any quantum communication, are practical to implem…
Die-rolling is the cryptographic task where two mistrustful, remote parties wish to generate a random $D$-sided die-roll over a communication channel. Optimal quantum protocols for this task have been given by Aharon and Silman (New Journal of Physics, 2010) but are based on optimal weak coin-flipping protocols which are currently very complicated and not very well understood. In this paper, we first present very simple classical protocols for die-rolling which have decent (and sometimes optimal) security which is in stark contrast to coin-flipping, bit-commitment, oblivious transfer, and many…
An atom moving in a vacuum at constant velocity and parallel to a surface experiences a frictional force induced by the dissipative interaction with the quantum fluctuations of the electromagnetic field. We show that the combination of nonequilibrium dynamics, anomalous Doppler effect and spin-momentum locking of light mediates an intriguing interplay between the atom's translational and rotational motion. In turn, this deeply affects the drag force in a way that is reminiscent of classical rolling friction. Our fully non-Markovian and nonequilibrium description reveals counterintuitive featur…
Einstein initially objected to the probabilistic aspect of quantum mechanics - the idea that God is playing at dice. Later he changed his ground, and focussed instead on the point that the Copenhagen Interpretation leads to what Einstein saw as the abandonment of physical realism. We argue here that Einstein's initial intuition was perfectly sound, and that it is precisely the fact that quantum mechanics is a fundamentally probabilistic theory which is at the root of all the controversies regarding its interpretation. Probability is an intrinsically logical concept. This means that the quantum…
Generalizing de Broglie's hypothesis, we show that the basic quantum behavior of ordinary field theory can be retrieved in a semi-classical and geometrical way from the assumption of intrinsic periodicity of elementary systems. The geometrodynamical description of interactions that arises in from this approach provides an intuitive interpretation of Maldacena's conjecture and it turns out to be of the same type of the one prescribed by general relativity.
We study the dynamics of a classical scalar field that rolls down a linear potential as it interacts bi-quadratically with a quantum field. We explicitly solve the dynamical problem by using the classical-quantum correspondence (CQC). Rolling solutions on the effective potential are shown to compare very poorly with the full solution. Spatially homogeneous initial conditions maintain their homogeneity and small inhomogeneities in the initial conditions do not grow.
We discuss counterintuitive aspects of probabilities for systems of identical particles obeying quantum statistics. Quantum coins and children (two level systems) and quantum dice (many level systems) are used as examples. It is emphasized that, even in the absence of interactions, (anti)symmetrizations of multi-particle wavefunctions destroy statistical independences and often lead to dramatic departures from our intuitive expectations.
Joint Institute for Nuclear Research（联合核研究所）；Universidade de São Paulo（圣保罗大学）
The procedure of tossing quantum coins and dice is described. This case is an important example of a quantum procedure because it presents a typical framework employed in quantum information processing and quantum computing. The emphasis is on the clarification of the difference between quantum and classical conditional probabilities. These probabilities are designed for characterizing different systems, either quantum or classical, and they, generally, cannot be reduced to each other. Thus the Lüders probability cannot be treated as a generalization of the classical conditional probability. T…
With respect to the quantum anomalous Hall effect (QAHE), the detection of topological nontrivial large-Chern-number phases is an intriguing subject. Motivated by recent research on Floquet topological phases, this study proposes a periodic driving protocol to engineer large-Chern-number phases using QAHE. Herein, spinless ultracold fermionic atoms are studied in a two-dimensional optical dice lattice with nearest-neighbor hopping and a $Λ$/V-type sublattice potential subjected to a circular driving force. Results suggest that large-Chern-number phases exist with Chern numbers equal to $C=-2$,…
We start from classical general relativity coupled to matter fields. Each configuration variable and its conjugate momentum, as also space-time points, are raised to the status of matrices [equivalently operators]. These matrices obey a deterministic Lagrangian dynamics at the Planck scale. By coarse-graining this matrix dynamics over time intervals much larger than Planck time, one derives quantum theory as a low energy emergent approximation. If a sufficiently large number of degrees of freedom get entangled, spontaneous localisation takes place, leading to the emergence of classical space-t…
EMU circulation planning for Silesian Railways: case study and a quantum approach
University of Žilina（日利纳大学）；Institute of Theoretical and Applied Informatics, Polish Academy of Sciences（波兰科学院理论与应用信息学研究所）；Silesian University of Technology（西里西亚理工大学）；HUN-REN Wigner Research Centre for Physics（匈牙利研究与教育网络维格纳物理研究中心）；Eberhard Karls Universität Tübingen（蒂宾根大学）；Forschungszentrum Jülich（于利希研究中心）
For three given probability distributions describing positions of three classical coins the quantum density matrix of spin-$1/2$ state is constructed and its matrix elements are associated with triada of Malevich's squares. The superposition principle of spin-$1/2$ states is presented in the form of nonlinear addition rule for these classical coin probabilities. We illustrate the formulas by the statement"God does not play dice - God plays coins".
"God does not play dice. He flips coins instead." And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructions for the flipping of coins are contained herein. But be warned! Only those who have mastered Kitaev's formalism relating coin flipping and operator monotone functions may succeed. For those foolhardy enough to even try, a complete tutorial is included.
