Quantum code with translation and scale symmetries
Beni Yoshida Perimeter Institute for Theoretical Physics
Displaying 1729 - 1740 of 2239
Format results
-
-
Where is the quantum particle between two measurements
Lev Vaidman Tel Aviv University
-
Quantum Bayesianism---Something Old, Something New
Chris Fuchs University of Massachusetts Boston
-
-
The quantum world: from weird to wired
Joseph Emerson Institute for Quantum Computing (IQC)
-
Nonclassical correlations from random measurements
Yeong-Cherng Liang National Cheng Kung University
-
-
-
Purity and reversibility as a paradigm for Quantum Information Processing
Giulio Chiribella University of Hong Kong (HKU)
-
-
-
-
Quantum code with translation and scale symmetries
Beni Yoshida Perimeter Institute for Theoretical Physics
Topological phases in spin systems are exciting frontiers of research with intimate connections to quantum coding theory. However, there is a disconnection between quantum codes and the idea of topology, in the absence of geometry and physical realizability. Here, we introduce a toy model, in which quantum codes are constrained to not only have a local geometric description, but also have translation and scale symmetries. These additional physical constraints enable us to assign topologically invariant properties to geometric shapes of logical operators of the code. Topological phases of the model are analyzed by geometrically classifying logical operators. The classification scheme also has topologically universal properties which are invariant under local unitary transformations and local perturbations, and may explain how global symmetries of a system Hamiltonian give rise to topological phases in correlated spin systems. -
Where is the quantum particle between two measurements
Lev Vaidman Tel Aviv University
The Wheeler delayed choice experiment, Elitzur-Vaidman interaction-free measurement, and Hosten-Kwiat counterfactual computation will be discussed to answer Bohr's forbidden question: "Where is a quantum particle while it is inside a Mach-Zehnder Interferometer?". I will argue that the naive application of Wheeler's approach fails to explain a weak trace left by the particle and that the two-state vector description is required. -
Quantum Bayesianism---Something Old, Something New
Chris Fuchs University of Massachusetts Boston
Quantum Bayesianism is a point of view on quantum foundations that says that there is no such thing as a “measurement problem” because there is no such THING as a quantum state: Quantum states are not things---instead information. But the view doesn’t stop there; it starts there! Taking the idea seriously over the last 15 years has been the direct motivation for a number of theorems and objects in quantum information theory: from the no-broadcasting theorem, to the quantum de Finetti theorem, and even some quantum cryptographic alphabets. I will review some of this, and then move on to the holy grail of present efforts: Finding an efficient representation of quantum states in terms of a singular probability function. Doing so leads to the hard technical problem of demonstrating the existence of a certain very symmetric sets of quantum states, and holds out the hope of understanding the amount of “quantum stuff” in a physical system in terms of a single parameter. (I.e., there is the THING that the quantum state is not). -
Not altogether desperate: An exposition of Newton's Scholium Problem and the theoretical definition of duration
In the Scholium in Newton's Principia which contains the discussions about absolute space, time, and the bucket experiment, Newton also posed a problem that Julian Barbour has denoted the "Scholium problem". Newton writes there "But how are we to obtain the true motions from their causes, effects, and apparent differences, and the converse, shall be explained more at large in the following treatise. For to this end it was that I composed it". This problem was clearly considered very important by Newton who claims he wrote the Principia dedicated to this problem. Interestingly Newton never returned to the problem. In this talk we are going to give a mathematical precise formulation of the Scholium problem. A subpart of the Scholium problem consists of determining how accurate the observers clock is. We are going to start from that end and see that the problem of defining duration is inseparately intertwined with the full scholium problem. -
The quantum world: from weird to wired
Joseph Emerson Institute for Quantum Computing (IQC)
Does quantum mechanics really tell us that particles, molecules, and maybe even cats, can be in two places at once? Does it force us to deny a reality that is independent of our observation? How can scientists disagree about what quantum mechanics means and yet still agree that it is right? Joseph Emerson, co-writer of the award-winning documentary “The Quantum Tamers”, will address these questions and then describe, drawing on preview clips from the documentary, how the weirdness of the quantum world is now being harnessed for a ‘quantum information revolution’ that includes quantum teleportation, super-secure quantum communication, and the exponential power of quantum computation. -
Nonclassical correlations from random measurements
Yeong-Cherng Liang National Cheng Kung University
In this talk, I will demonstrate that correlations inconsistent with any locally causal description can be a generic feature of measurements on entangled quantum states. Specifically, spatially-separated parties who perform local measurements on a maximally-entangled state using randomly chosen measurement bases can, with significant probability, generate nonclassical correlations that violate a Bell inequality. For n parties using a Greenberger-Horne-Zeilinger state, this probability of violation rapidly tends to unity as the number of parties increases. Moreover, even with both a randomly chosen two-qubit pure state and randomly chosen measurement bases, a violation can be found about 10% of the time. Amongst other applications, our work provides a feasible alternative for the demonstration of Bell inequality violation without a shared reference frame. -
A Computational Grand-Unified Theory
Are Quantum Mechanics and Special Relativity unrelated theories? Is Quantum Field Theory an additional theoretical layer over them? Where the quantization rules and the Plank constant come from? All these questions can find answer in the computational paradigm: "the universe is a huge quantum computer". In my talk I'll take the computational-universe paradigm as genuine theoretical framework, and analyze some relevant implications. A new kind of quantum field theory emerges: "Quantum-Computational Field Theory" (QCFT). I will show how in QCFT Special Relativity unfolds from the fabric of the computational network, which also naturally embeds gauge-invariance, and even the quantization rule and the Planck constant, which thus resort to being properties of the underlying causal tapestry of space-time. In this way Quantum Mechanics remains the only theory needed to describe the computational-universe. I will analyze few simple toy-models in order to explore the mathematical structure of QCFT. The new QCFT has many advantages versus the customary field theoretical framework, solving a number of logical and mathematical problems that plague quantum field theory. One further advantage of QCFT is the possibility of changing the computational engine without changing the field-theoretical framework. One can thus consider different kind of engines, e.g. classical, quantum, super-quantum, and even input-output networks with no pre-established causal relations, which are very interesting for addressing the problem of Quantum Gravity. QCFT opens a large research line: I argue that this program should be addressed soon in the particle physics domain, before entering Quantum Gravity, notwithstanding the experimental success of the usual quantum field theory. It will also be the first test of the Lucien Hardy's program on Quantum Gravity. Reference: arXiv:1001.1088 (http://arxiv.org/abs/1001.1088)
-
Switching boxes connections in operational theories and its consequence on causality
Paolo Perinotti University of Pavia
How can we describe a device that takes two unknown operational boxes and conditionally on some input variable connects them in different orders? In order to answer this question, I will introduce maps from transformations to transformations within operational probabilistic theories with purification, and show their characterisation in terms of operational circuits. I will then proceed exploring the hierarchy of maps on maps. A particular family of maps in the hierarchy are the ones whose output is in the set of transformations. These maps can be fully characterised by their correspondence with channels with memory, and it is exactly the family of transformations that can be implemented through operational circuits. I will then show the problems that arise in defining the remainder of the hierarchy, and the reason why we cannot avoid considering its elements. The main consequence of admitting the generalised transformations as possible within the operational theory is that we cannot describe them in terms of simple causal connection of transformations in a circuit with a fixed causal structure. In quantum theory, we can understand such higher order transformations in terms of superpositions of circuits with different causal structures. The problem whether computations exploiting higher-order transformations can be efficiently simulated by a conventional circuital computer is posed. -
Purity and reversibility as a paradigm for Quantum Information Processing
Giulio Chiribella University of Hong Kong (HKU)
In this talk I will report on a recent work [arXiv:0908.1583], which investigates general probabilistic theories where every mixed state has a purification, unique up to reversible channels on the purifying system. The purification principle is equivalent to the existence of a reversible realization for every physical process, namely that to the fact that every physical process can be regarded as arising from the reversible interaction of the input system with an environment that is eventually discarded. From the purification principle one can also construct an isomorphism between transformations and bipartite states that possesses all structural properties of the Choi-Jamiolkowski isomorphism in Quantum Mechanics. Such an isomorphism allows one to prove most of the basic features of Quantum Information Processing, like e.g. no information without disturbance, no joint discrimination of all pure states, no cloning, teleportation, complementarity between correctable and deletion channels, no programming, and no bit commitment, without resorting to the mathematical framework of Hilbert spaces. -
Quantum Money
Scott Aaronson The University of Texas at Austin
Ever since there's been money, there have been people trying to counterfeit it, and governments trying to stop them. In 1969, the physicist Stephen Wiesner raised the remarkable possibility of money whose authenticity would be guaranteed by the laws of quantum mechanics. However, the question of whether one can have secure quantum money that anyone (not only the bank) can verify has remained open for forty years. In this talk, I'll tell you about progress on the question over the last two years. (1) I'll show that no publicly-verifiable quantum money scheme can have security based on quantum physics alone: like in most cryptography, one also needs a computational hardness assumption. (2) I'll show that one can have quantum money that remains hard to counterfeit, even if a counterfeiter gains access to a "black box" for verifying the money. (3) I'll describe a candidate quantum money scheme I proposed last spring, and how that scheme was recently broken by Lutomirski et al. I'll also discuss a new class of schemes that might evade the existing attacks -- schemes with the bizarre property that not even the bank can prepare the same bill twice. The talk is designed to be accessible to those without a quantum information background. Reference for (1)-(2): S. Aaronson, "Quantum copy-protection and quantum money," in Proceedings of CCC'2009, http://www.scottaaronson.com/papers/noclone-ccc.pdf. Reference for (3): A. Lutomirski, S. Aaronson, E. Farhi, D. Gosset, A. Hassidim, J. Kelner, and P. Shor. Breaking and making quantum money: toward a new quantum cryptographic protocol, Proceedings of Innovations in Computer Science (ICS), 2010. http://arxiv.org/abs/0912.3825. -
Weak Gravity and the Arrow of Time
Simon Judes Columbia University
CMB measurements reveal a very smooth early universe. We propose a mech- anism to make this smoothness natural by weakening the strength of gravity at early times, and therefore altering which initial conditions have low entropy. -
Symmetric informationally complete measurements: Can we make big ones out of small ones?
William Wootters Williams College
For a quantum system with a d-dimensional Hilbert space, a symmetric informationally complete measurement (SIC) can be thought of as a set of d^2 pure states all having the same overlap. Constructions of SICs for composite systems usually do not make use of the composite structure but treat the system as a whole. Indeed for some cases, one can prove that a SIC cannot have the symmetry that one naturally associates with the composite structure. In this talk I give one example showing how a SIC for three qubits can be constructed from SICs for the individual qubits. I ask whether the strategy used in this example might apply to other composite cases.