Quantum computing with classical bits
type: Item
instance of: scholarly article
title: Quantum computing with classical bits
zbMATH Open document ID: 1448.81259
publication date: 2020-06-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/1806.05960
review text: Quantum computing is based on a sequence of unitary operations acting on the wave function. Classical computing uses bits or Ising spins that can only take two values. A computation is again a series of operations on the bits. These are generally viewed as deterministic operations. Quantum operations or gates can be performed by Ising spins or classical bits, within a classical statistical setting. It is argued that classical systems realizing quantum computing have to be truly probabilistic. It is shown that there is no sharp boundary between probabilistic computation with classical bits and quantum computation with isolated qubits. Classical bit operations can do whatever quantum operations can do however without any speed up that could be achieved by a quantum computer. It is proposed that quantum operations can directly be performed by neural networks. Since neural networks operate classically, this amounts to realizing quantum statistics by classical statistical systems. Finally a general formalism for probabilistic computing for which deterministic computing and quantum computing are special limiting cases is proposed.
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 82B20
Mathematics Subject Classification ID: 81P40
Mathematics Subject Classification ID: 74D05
Mathematics Subject Classification ID: 81P65
Mathematics Subject Classification ID: 82C32
Mathematics Subject Classification ID: 92B20
zbMATH DE Number: 7210008
zbMATH Keywords: quantum computing
zbMATH Keywords: probabilistic computing
zbMATH Keywords: classical computation
zbMATH Keywords: classical statistical systems
author: Christof Wetterich
reviewed by: Andreas Wichert
describes a project that uses: Strawberry Fields
MaRDI profile type: Publication
OpenAlex ID: W2807943491
arXiv ID: 1806.05960
cites work: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Learning algorithm and application of quantum BP neural networks based on universal quantum gates
cites work: Generating three-qubit quantum circuits with neural networks
cites work: Solving the quantum many-body problem with artificial neural networks
cites work: Holography as deep learning
cites work: A Mathematical Theory of Communication
cites work: Information transport in classical statistical systems
cites work: Quantum formalism for classical statistics
cites work: Q3324796
cites work: Q5701597
cites work: Probabilistic observables, conditional correlations, and quantum physics
cites work: Proposed Experiment to Test Local Hidden-Variable Theories
cites work: Statistical mechanics of cellular automata
cites work: CLASSICAL CELLULAR AUTOMATA AND QUANTUM FIELD THEORY
cites work: The cellular automaton interpretation of quantum mechanics
cites work: Universal Quantum Simulators
cites work: Quantum Computation as Geometry
cites work: Probabilistic time
cites work: Geometric quantum mechanics
cites work: Quantum mechanics from classical statistics
cites work: Quantum particles from classical statistics
Wikidata QID: Q127200573
DOI: 10.1016/J.NUCLPHYSB.2019.114776
published in: Nuclear Physics B
description: scientific article