Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Speed of the Wavefunction Collapse

A. Furtado Neto

Published Aug 1, 2015• 0 citations
OpenAlex

Abstract

Speed of the wavefunction collapse is calculated assuming the universe is a vast cellular automaton.

Related papers

The universe remembers no wavefunction collapse

Ovidiu Cristinel Stoica

arXiv:1607.02076•Quantum Studies Mathematics and Foundations•Sep 6, 2017•16 citations

Fundamental collapse in cellular automaton process

Yehuda Gavriel Roth

In this paper, we show that quantum states and operators are well-adapted to describe a cellular automaton (CA) process. Using quantum mechanical terminology, we reveal a fundamental collapse that is naturally embedded in the CA evolution. We further suggest that our formalism can be useful in the field of artificial intelligence.

Journal of Physics Communications•Mar 22, 2019•6 citations

Does consciousness really collapse the wave function?

Fred H. Thaheld

arXiv:quant-ph/0509042•Biosystems•Apr 11, 2005•27 citations

On the Speed of Quantum Computation

Tino Gramß

Feynman and Margolus have shown that a closed, locally interacting quantum system is capable of performing deterministic computation. Feynman's system computes in a serial way. Margolus was able to extend Feynman's ideas to get quantum description of a cellular automaton, i.e. a model which calculates in parallel. In this article, a new kind of speed limit for quantum computation is established. An upper bound on the average velocity ("instructions per second ") for both computers is derived. One would expect a cellular automaton to have a computational velocity which scales with the number k of its cells. However, the upper bound on the average velocity is only proportional to p k in this case. This does not reflect the parallelism of the cellular automaton. Whether it is possible to construct a locally interacting quantum computer that really works in parallel remains an open problem. Introduction There is a growing interest in devices computing on a scale where quantum mechanic...

•Apr 1, 1994•3 citations

Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours

Pablo J. Arrighi, Renan Fargetton, Zizhu Wang

We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any onedimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. The encoding is linear and hence does not carry any of the cost of the computation. We do this in two flavours: a weak one which requires an infinite but periodic initial configuration and a strong one which needs only a finite initial configuration.

arXiv:0704.3961•Fundamenta Informaticae•Jan 1, 2009•23 citations

Is the wavefunction collapse a physical reality?

Dipankar Home, M. A. B. Whitaker

Physics Letters A•Sep 1, 1986•2 citations
Feynman and Margolus have shown that a closed, locally interacting quantum system is capable of performing deterministic computation. Feynman's system computes in a serial way. Margolus was able to extend Feynman's ideas to get quantum description of a cellular automaton, i.e. a model which calculates in parallel. In this article, a new kind of speed limit for quantum computation is established. An upper bound on the average velocity ("instructions per second ") for both computers is derived. One would expect a cellular automaton to have a computational velocity which scales with the number k of its cells. However, the upper bound on the average velocity is only proportional to p k in this case. This does not reflect the parallelism of the cellular automaton. Whether it is possible to construct a locally interacting quantum computer that really works in parallel remains an open problem. Introduction There is a growing interest in devices computing on a scale where quantum mechanic...
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any onedimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. The encoding is linear and hence does not carry any of the cost of the computation. We do this in two flavours: a weak one which requires an infinite but periodic initial configuration and a strong one which needs only a finite initial configuration.