Definitive Proof of the Classical Multiverse!

• URL: http://arxiv.org/abs/2503.22768v1
• Date: Fri, 28 Mar 2025 03:13:31 GMT
• Title: Definitive Proof of the Classical Multiverse!
• Authors: Brian R. La Cour, Noah A. Davis,
• Abstract summary: We investigate whether a similar computation on a digital computer can demonstrate the existence of a classical multiverse.<n>We describe a classical algorithm for efficiently sampling from a $dn$-dimensional discrete probability distribution.<n>We conclude that classical, as well as quantum, computation occurs in many parallel universes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent astonishing experiments with quantum computers have demonstrated unambiguously the existence of a quantum multiverse, where calculations of mind-boggling complexity are effortlessly computed in just a few minutes. Here, we investigate whether a similar computation on a digital computer can demonstrate the existence of a classical multiverse. To this end we describe a classical algorithm for efficiently sampling from a $d^n$-dimensional discrete probability distribution representing $n$ digits of $d$ possible values with strong statistical dependence. Although the full distribution for large $n$ quickly becomes intractable, probabilities for given samples can be computed quite efficiently. This allows us to compute exact empirical linear cross-entropy benchmark (XEB) values. Results on a low-end laptop for $d=2$ show excellent agreement with the true XEB for $n \le 30$ and large positive values of the exact empirical XEB for $n \le 1023$ computed over one million samples. We conclude that classical, as well as quantum, computation occurs in many parallel universes.

Related papers

• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• On the average-case complexity of learning output distributions of quantum circuits [55.37943886895049]
  We show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model. This learning model is widely used as an abstract computational model for most generic learning algorithms.
  arXiv  Detail & Related papers  (2023-05-09T20:53:27Z)
• Replicable Clustering [57.19013971737493]
  We propose algorithms for the statistical $k$-medians, statistical $k$-means, and statistical $k$-centers problems by utilizing approximation routines for their counterparts in a black-box manner. We also provide experiments on synthetic distributions in 2D using the $k$-means++ implementation from sklearn as a black-box that validate our theoretical results.
  arXiv  Detail & Related papers  (2023-02-20T23:29:43Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Efficient classical simulation of cluster state quantum circuits with alternative inputs [0.0]
  In cluster state quantum computation input qubits are initialised in the equator' of the Bloch sphere. Finally the qubits are measured adaptively using $Z$ measurements or measurements of $cos(theta)X + sin(theta)Y$ operators.
  arXiv  Detail & Related papers  (2022-01-19T15:28:48Z)
• Solving the sampling problem of the Sycamore quantum circuits [6.0604034858265345]
  We study the problem of generating independent samples from the output distribution of Google's Sycamore quantum circuits with a target fidelity. We propose a new method to classically solve this problem by contracting the corresponding tensor network just once. For the Sycamore quantum supremacy circuit with $53$ qubits and $20$ cycles, we have generated one million uncorrelated bitstrings.
  arXiv  Detail & Related papers  (2021-11-04T17:13:09Z)
• Enhancing the Quantum Linear Systems Algorithm using Richardson Extrapolation [0.8057006406834467]
  We present a quantum algorithm to solve systems of linear equations of the form $Amathbfx=mathbfb$. The algorithm achieves an exponential improvement with respect to $N$ over classical methods.
  arXiv  Detail & Related papers  (2020-09-09T18:00:09Z)
• Emulating Quantum Interference with Generalized Ising Machines [0.0]
  This paper presents an exact and general procedure for mapping any sequence of quantum gates onto a network of probabilistic p-bits. We can view this structure as a Boltzmann machine whose states each represent a Feynman path leading from an initial configuration of qubits to a final configuration. Our results for mapping an arbitrary quantum circuit to a Boltzmann machine with a complex energy function should help push the boundaries of the simulability of quantum circuits with probabilistic resources.
  arXiv  Detail & Related papers  (2020-07-14T22:10:29Z)
• Faster classical Boson Sampling [0.15229257192293197]
  We present an algorithm for Boson Sampling whose average-case time complexity is much faster when $m$ is proportional to $n$. This result further increases the problem size needed to establish quantum computational supremacy via Boson Sampling.
  arXiv  Detail & Related papers  (2020-05-07T20:01:02Z)
• Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits [8.401078947103475]
  Google's noisy quantum simulation of a 53 qubit circuit $C$ achieved a fidelity value of $(2.24pm0.21)times10-3$. Our results can be considered as an evidence that fooling the linear XEB test might be easier than achieving a full simulation of quantum circuit.
  arXiv  Detail & Related papers  (2020-05-05T18:01:48Z)
• Quantum Coupon Collector [62.58209964224025]
  We study how efficiently a $k$-element set $Ssubseteq[n]$ can be learned from a uniform superposition $|Srangle of its elements. We give tight bounds on the number of quantum samples needed for every $k$ and $n$, and we give efficient quantum learning algorithms.
  arXiv  Detail & Related papers  (2020-02-18T16:14:55Z)

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.