Quantum computing with classical bits
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. We discuss static memory materials based on Ising spins that realize quantum operations as the Hadamard or CNOT-gate for...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article (Journal) Chapter/Article |
| Language: | English |
| Published: |
15 Jun 2018
|
| In: |
Arxiv
|
| Online Access: | Verlag, Volltext: http://arxiv.org/abs/1806.05960
|
| Author Notes: | C. Wetterich, Institut für Theoretische Physik, Universität Heidelberg, Philosophenweg 16, D-69120 Heidelberg |
| Summary: | A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. We discuss static memory materials based on Ising spins that realize quantum operations as the Hadamard or CNOT-gate for the quantum subsystem. Classical spins can account for the entanglement of quantum spins. An arbitrary unitary evolution for an arbitrary number of quantum spins can be described by static memory materials for an infinite number of Ising spins. We discuss discrete subsets of unitary operations realized by a finite number of Ising spins. They may be useful for new computational structures. We suggest that features of quantum computation or more general probabilistic computation may be realized by neural networks, neuromorphic computing or the brain. We propose a general formalism for probabilistic computing for which deterministic computing and quantum computing are special limiting cases. |
|---|---|
| Item Description: | Gesehen am 23.11.2018 |
| Physical Description: | Online Resource |