Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 17 tok/s
GPT-5 High 21 tok/s Pro
GPT-4o 90 tok/s
GPT OSS 120B 468 tok/s Pro
Kimi K2 213 tok/s Pro
2000 character limit reached

The Universe as a Quantum Computer (1405.0638v1)

Published 4 May 2014 in gr-qc

Abstract: This article presents a sequential growth model for the universe that acts like a quantum computer. The basic constituents of the model are a special type of causal set (causet) called a $c$-causet. A $c$-causet is defined to be a causet that is independent of its labeling. We characterize $c$-causets as those causets that form a multipartite graph or equivalently those causets whose elements are comparable whenever their heights are different. We show that a $c$-causet has precisely two $c$-causet offspring. It follows that there are $2n$ $c$-causets of cardinality $n+1$. This enables us to classify $c$-causets of cardinality $n+1$ in terms of $n$-bits. We then quantize the model by introducing a quantum sequential growth process. This is accomplished by replacing the $n$-bits by $n$-qubits and defining transition amplitudes for the growth transitions. We mainly consider two types of processes called stationary and completely stationary. We show that for stationary processes, the probability operators are tensor products of positive rank-1 qubit operators. Moreover, the converse of this result holds. Simplifications occur for completely stationary processes. We close with examples of precluded events.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)