Modelo matemático y simulación del colapso formal SLE-GRW como una función mediante el axioma de elección para familias infinitas contables de estados cuánticos discretos (CIFDQS)
In this article the axiomatization of the GRW (Ghirardi-Rimini-Weber) formal collapse model of SLE (spontaneous localization events) is proposed using the concept of countably infinite families of discrete quantum states (CIFDQS) as a choice function using the Zermelo-Fraenkel choice axiom; also a simulation of the mathematical model is developed in QISKIT.
In this article the axiomatization of the GRW (Ghirardi-Rimini-Weber) formal collapse model of SLE (spontaneous localization events) is proposed using the concept of countably infinite families of discrete quantum states (CIFDQS) as a choice function using the Zermelo-Fraenkel choice axiom; also a simulation of the mathematical model is developed in QISKIT.
Carrying out a research program outlined by John S. Bell in 1987, we arrive at a relativistic version of the Ghirardi–Rimini–Weber (GRW) model of spon-taneous wavefunction collapse. The GRW model was proposed as a solution of the measurement problem of quantum mechanics and involves a stochastic and nonlinear modification of the Schrödinger equation. It deviates very little from the Schrödinger equation for microscopic systems but efficiently suppresses, for macroscopic systems, superpositions of macroscopically different states. As sug-gested by Bell, we take the primitive ontology, or local beables, of our model to be a discrete set of space-time points, at which the collapses are centered. This set is random with distribution determined by the initial wavefunction. Our model is nonlocal and violates Bell’s inequality though it does not make use of a preferred slicing of space-time or any other sort of synchronization of spacelike separated points. Like the GRW model, it reproduces the quantum probabilities in all cases presently testable, though it entails deviations from the quantum formalism that are in principle testable. Our model works in Minkowski space-time as well as in (well-behaved) curved background space-times. PACS numbers: 03.65.Ta; 03.65.Ud; 03.30.+p. Key words: spontaneous wave-function collapse; relativity; quantum theory without observers. 1
Spontaneous collapse models are proposed modifications to quantum mechanics which aim to solve the measurement problem. In this article, we will consider models which attempt to extend a specific spontaneous collapse model, the Ghirardi-Rimini-Weber model (GRW), to be consistent with special relativity. We will present a condition that a relativistic GRW model must meet for three cases: for a single particle, for N distinguishable particles, and for indistinguishable particles. We will then show that this relativistic condition implies that one can have a relativistic GRW model for a single particles or for distinguishable noninteracting, nonentangled particles but not otherwise.
Among several possibilities for what reality could be like in view of the empirical facts of quantum mechanics, one is provided by theories of spontaneous wave function collapse, the best known of which is the Ghirardi–Rimini–Weber (GRW) theory. We show mathematically that in GRW theory (and similar theories) there are limitations to knowledge, that is, inhabitants of a GRW universe cannot find out all the facts true of their universe. As a specific example, they cannot accurately measure the number of collapses that a given physical system undergoes during a given time interval; in fact, they cannot reliably measure whether one or zero collapses occur. Put differently, in a GRW universe certain meaningful, factual questions are empirically undecidable. We discuss several types of limitations to knowledge and compare them with those in other (no-collapse) versions of quantum mechanics, such as Bohmian mechanics. Most of our results also apply to observer-induced collapses as in orthodox quantum mechanics (as opposed to the spontaneous collapses of GRW theory). 1 Introduction 1.1 Known examples of limitations to knowledge 1.2 Remarks2 Brief Review of GRW Theories 2.1 The GRW process 2.2 GRWm 2.3 GRWf3 First Examples of Limitations to Knowledge in GRW Theories4 Measurements of Flashes in GRWf, or of Collapses in GRWm 4.1 An example in which ψ is known 4.2 Other choices of ψ 4.3 Experiments beginning before t 2 4.4 If ψ is random 4.5 Optimal way of distinguishing two density matrices 4.6 If ψ is unknown5 Measurements of m(x) in GRWmAppendix
Resumen La comprension del decaimiento exponencial irreversible desde un estado discreto a un continuo de estados, descrito mediante la teoria de perturbaciones dependiente del tiempo, es una tarea dificil dentro del aprendizaje de la teoria cuantica, debido a la complejidad de las matematicas utilizadas. En este trabajo se desarrolla un modelo sencillo, que consiste en analizar el decaimiento desde un estado discreto a un conjunto cuasi–continuo de estados. Las matematicas requeridas para comprender el modelo son sencillas, lo que permite un analisis profundo del modelo. Las condiciones fisicas que se deben verificar para poder describir una transicion producida por una perturbacion sinusoidal mediante un decaimiento exponencial, se deducen de forma sencilla
We extend the beable interpretation, due to Bell, to the Ghirardi, Rimini and Weber [GRW] model of spontaneous collapse of the wave function. In doing so we generalize results obtained by Vink, in the context of a unitary Schrödinger evolution, to the modified Schrödinger equation of Ghirardi, Pearle and Rimini [GPR]. We show that the GPR equation allows a beable interpretation for position and momentum, meaning that stochastic trajectories can be given to these dynamical variables. Keywods: beables, spontaneous collapse models
La Computación Cuántica se presenta como un paradigma de computación no clásico que hace uso de fenómenos cuánticos para la realización de cálculos computacionales. De entre sus distintas implementaciones o manifestaciones, la basada en puertas cuánticas se considera la más versátil o de aplicación general, por su posibilidad de construir circuitos a partir de componentes más elementales. Dichos componentes son las puertas cuánticas, conceptualmente equivalentes a sus homónimas en el paradigma de computación clásica o basada en bits. Mientras que las puertas lógicas clásicas permiten la transformación del estado presentado por un registro en n bits, y en ello basamos la práctica totalidad de los dispositivos electrónicos actuales, las puertas cuánticas permiten a su vez la transformación de los estados de registros de n qubits. A dichos estados, se los denomina estados cuánticos. A diferencia de lo que ocurre en el caso de un bit, que puede estar únicamente en los estados 0 o 1, un qubit puede encontrarse en cualquiera de ambos estados -denominados clásicos-, o en una superposición lineal de ambos. Dicha superposición, regida por coeficientes complejos, establece qué probabilidad tenemos de obtener el qubit un estado 0, o un estado 1, si le aplicamos un proceso de medición. En la gran variedad de formas en que podemos superponer los estados clásicos de cada n-qubit, reside la potencia de este paradigma. El modelo discreto de Computación Cuántica propone el uso de estados cuánticos que cumplen unas determinadas propiedades, simplificando así el modelo continuo y permitiendo el uso de nuevos parámetros para comprender la relación entre los distintos estados cuánticos y su transformación mediante puertas cuánticas. Concretamente, se destacan dos: el número mínimo de puertas necesarias para alcanzar un determinado estado cuántico discreto desde uno de la base computacional -complejidad c-, y el parámetro necesarios para mantener la norma unitaria del vector que representa el estado -novel k-. Su estudio será determinante par identificar familias de estados discretos con propiedades particulares, algoritmos para el uso o la exploración del modelo discreto, y conclusiones sobre la complejidad de los estados del modelo. Abstract: Quantum Computing presents itself as a non-classical computing paradigm that uses quantum phenomena to make computational calculations. Among its different implementations or manifestations, the one based on quantum gates is considered as the most versatile or general-purpose one, due to its ability to create circuits using other basic components as its building blocks. Those basic components are quantum logic gates, conceptually equivalent to their homonym counterpart in classical or bit-based computing. Whereas classical logic gates enable the transformation of any state of a register of n bits, and almost every current electronic device is based on this paradigm, quantum logic gates are used to transform the states allowed by a register of n qubits. We will refer to those states of a n-qubit as quantum states. Opposed to a bit, that can only be in either a 0 or 1 state, a qubit can be in any of those so-called classical states, but also in any linear superposition of both. That superposition, determined by complex coefficients, establishes the probability to obtain either a 0 or a 1 from the qubit, after applying a measuring procedure to it. The computational power of this paradigm is based on the huge number of configurations that every n-qubit can have. The discrete model of Quantum Computing suggets the use of quantum states that verify certain additional properties, therefore simplifying the continuous model, and en-abling the use of new parameters to understand the relationship between different quantum states, and its transformation with quantum logic gates. Specifically, two are highlighted: the minimum number of gates required to reach a quantum state from one of the computational base -complexity c-, and the parameter needed to ensure that the vector that represents a quantum state remains unitary -level k-. Their study will play a key role in identifying families of quantum states with relevant characteristics, algorithms that allow for the use or the exploration of the discrete model, and conclusions about the complexity of the states of this model.