Probability and consequences of living inside a computer simulation

• URL: http://arxiv.org/abs/2008.09275v1
• Date: Fri, 21 Aug 2020 02:41:33 GMT
• Title: Probability and consequences of living inside a computer simulation
• Authors: Alexandre Bibeau-Delisle and Gilles Brassard
• Abstract summary: It is shown that under reasonable assumptions a Drake-style equation can be obtained for the probability that our universe is the result of a deliberate simulation. We investigate the possibility of eavesdropping from the outside of such a simulation and introduce a general attack that can circumvent attempts at quantum cryptography inside the simulation.
• Score: 77.65665055163332
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is shown that under reasonable assumptions a Drake-style equation can be obtained for the probability that our universe is the result of a deliberate simulation. Evaluating loose bounds for certain terms in the equation shows that the probability is unlikely to be as high as previously reported in the literature, especially in a scenario where the simulations are recursive. Furthermore, we investigate the possibility of eavesdropping from the outside of such a simulation and introduce a general attack that can circumvent attempts at quantum cryptography inside the simulation, even if the quantum properties of the simulation are genuine.

Related papers

• Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques [0.0]
  We conduct an in-depth analysis of the cost of simulating Abelian and non-Abelian lattice gauge theories. We provide explicit circuit constructions, as well as T-gate counts and qubit counts for the entire simulation.
  arXiv  Detail & Related papers  (2024-05-16T19:36:49Z)
• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Shadow Simulation of Quantum Processes [6.081549199234747]
  We show that the performance of shadow process simulation exceeds that of conventional process simulation protocols in a variety of scenarios. Remarkably, there exist scenarios where shadow simulation provides increased statistical accuracy without any increase in the number of required samples.
  arXiv  Detail & Related papers  (2024-01-26T15:13:43Z)
• A Relative Church-Turing-Deutsch Thesis from Special Relativity and Undecidability [0.0]
  We show that computing the time, space, or error accumulated by the global simulator are simulation properties and therefore are undecidable. These simulation properties give rise to special relativistic effects in the relative model which we use to construct a Church-Turing-Deutsch thesis.
  arXiv  Detail & Related papers  (2022-06-13T18:58:41Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Quantum Simulation of Chiral Phase Transitions [62.997667081978825]
  We construct a quantum simulation for the $(+1)$ dimensional NJL model at finite temperature and finite chemical potential. We observe consistency among digital quantum simulation, exact diagonalization, and analytical solution, indicating further applications of quantum computing in simulating QCD thermodynamics.
  arXiv  Detail & Related papers  (2021-12-07T19:04:20Z)
• Likelihood-Free Inference in State-Space Models with Unknown Dynamics [71.94716503075645]
  We introduce a method for inferring and predicting latent states in state-space models where observations can only be simulated, and transition dynamics are unknown. We propose a way of doing likelihood-free inference (LFI) of states and state prediction with a limited number of simulations.
  arXiv  Detail & Related papers  (2021-11-02T12:33:42Z)
• Discrete-event simulation of an extended Einstein-Podolsky-Rosen-Bohm experiment [0.0]
  This model satisfies Einstein's criterion of locality and generates data in an event-by-event and cause-and-effect manner. We show that quantum theory can describe the statistics of the simulation data for a certain range of model parameters only.
  arXiv  Detail & Related papers  (2020-05-12T12:07:52Z)
• Discrete-event simulation of quantum walks [0.0]
  We use discrete-event simulation on a digital computer to study two different models of experimentally realizable quantum walks. The simulation models comply with Einstein locality, are as "realistic" as the one of the simple random walk in that the particles follow well-defined trajectories, are void of concepts such as particle-wave duality and wave-function collapse.
  arXiv  Detail & Related papers  (2020-05-07T11:59:48Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.