A Short History of Rocks: or, How to Invent Quantum Computing

• URL: http://arxiv.org/abs/2503.00005v1
• Date: Fri, 14 Feb 2025 19:04:56 GMT
• Title: A Short History of Rocks: or, How to Invent Quantum Computing
• Authors: David Wakeham,
• Abstract summary: We argue that Feynman's state-based analogy is not the only way to arrive at quantum computing.<n>We imagine an alternate timeline in which John von Neumann skipped Operation Crossroads to debug a military computer, got tickled by the problem, and discovered a completely different picture of quantum computing.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This essay gives a short, informal account of the development of digital logic from the Pleistocene to the Manhattan Project, the introduction of reversible circuits, and Richard Feynman's allied proposal for quantum computing. We argue that Feynman's state-based analogy is not the only way to arrive at quantum computing, nor indeed the simplest. To illustrate, we imagine an alternate timeline in which John von Neumann skipped Operation Crossroads to debug a military computer, got tickled by the problem, and discovered a completely different picture of quantum computing -- in 1946. Feynman suggested we "quantize" state, and turn classically reversible circuits into quantum reversible, unitary ones. In contrast, we speculate that von Neumann, with his background in functional analysis and quantum logic, would seek to "quantize" the operators of Boolean algebra, and with tools made available in 1946 could successfully do so. This leads to a simpler, more flexible circuit calculus and beautiful parallels to classical logic, as we detail in a forthcoming companion paper.

Related papers

• Quantum decoherence from complex saddle points [0.0]
  Quantum decoherence is the effect that bridges quantum physics to classical physics. We present some first-principle calculations in the Caldeira-Leggett model. We also discuss how to extend our work to general models by Monte Carlo calculations.
  arXiv  Detail & Related papers  (2024-08-29T15:35:25Z)
• A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
  We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device. Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
  arXiv  Detail & Related papers  (2024-05-10T19:30:23Z)
• On the Theory of Quantum and Towards Practical Computation [0.0]
  It is an article that will bridge the vast gap between classical and quantum computation. We are indeed in luck to be living in an age where computing is being reinvented.
  arXiv  Detail & Related papers  (2024-02-07T20:50:35Z)
• Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis [31.203764035373677]
  We develop Quantivine, an interactive system for exploring and understanding quantum circuits. A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement. The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
  arXiv  Detail & Related papers  (2023-07-18T04:51:28Z)
• Quantum Computing and the Riemann Hypothesis [0.0]
  Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms. We show how to obtain functions as states in supersymmetric quantum mechanics.
  arXiv  Detail & Related papers  (2023-03-07T04:28:54Z)
• Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
  The first complete equational theory for quantum circuits has only recently been introduced. We simplify the equational theory by proving that several rules can be derived from the remaining ones. The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
  arXiv  Detail & Related papers  (2023-03-06T13:31:27Z)
• Q-Map: Quantum Circuit Implementation of Boolean Functions [0.0]
  Development of quantum techniques and algorithms is essential to exploit the full power of quantum computers. We propose a simple visual technique (we call Q-Map) for quantum realisation of classical logic circuits.
  arXiv  Detail & Related papers  (2023-02-28T20:47:31Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Universal Statistical Simulator [0.0]
  We present a quantum computer code for a Galton Board Simulator that is exponentially faster than a classical calculation. We demonstrate a straight forward implementation on a quantum computer, using only three types of quantum gate, which calculates $2n$ trajectories using $mathcalO (n2)$ resources.
  arXiv  Detail & Related papers  (2022-02-03T17:55:58Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)

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.