Quantumbionet

Zizzi's Papers

"Massimo and Paola"

I, Quantum Robot: Quantum Mind control on a Quantum Computer

(Submitted on 25 Dec 2008 (v1), last revised 28 May 2009 (this version, v2))

Abstract: The logic which describes quantum robots is not orthodox quantum logic, but a deductive calculus which reproduces the quantum tasks (computational processes, and actions) taking into account quantum superposition and quantum entanglement. A way toward the realization of intelligent quantum robots is to adopt a quantum metalanguage to control quantum robots. A physical implementation of a quantum metalanguage might be the use of coherent states in brain signals.

Turning the Liar paradox into a metatheorem of Basic logic

We show that self-referentiality can be formalized in Basic logic by means of a new connective: @, called "entanglement". In fact, the property of non-idempotence of the connective @ is a metatheorem, which states that a self-referential sentence loses its own identity. This prevents having self-referential paradoxes in the corresponding metalanguage.

Basic Logic and Quantum Entanglement

As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But...can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.

Emergent Consciousness: From the Early Universe to Our Mind

Journal-ref: NeuroQuantology,Vol.3(2003)295-311

In a previous paper (gr-qc/9907063) we described the early inflationary universe in terms of quantum information. In this paper, we analize those results in more detail, and we stress the fact that, during inflation, the universe can be described as a superposed state of quantum registers. The self-reduction of the superposed quantum state is consistent with the Penrose's Objective Reduction (OR) model. The quantum gravity threshold is reached at the end of inflation, and corresponds to a superposed state of 10^9 quantum registers. This is also the number of superposed tubulins-qubits in our brain, which undergo the Penrose-Hameroff's Orchestrated Objective Reduction, (Orch OR), leading to a conscious event. Then, an analogy naturally arises between the very early quantum computing universe,and our mind.

A Minimal Model for Quantum Gravity

Journal-ref: Mod.Phys.Lett. A20 (2005) 645-653

We argue that the model of a quantum computer with N qubits on a quantum space background, which is a fuzzy sphere with n=2^N elementary cells, can be viewed as the minimal model for Quantum Gravity. In fact, it is discrete, has no free parameters, is Lorentz invariant, naturally realizes the Holographic Principle, and defines a subset of punctures of spin networks' edges of Loop Quantum Gravity labelled by spins j=2^(N-1)-1/2. In this model, the discrete area spectrum of the cells, which is not equally spaced, is given in units of the minimal area of Loop Quantum Gravity (for j=1/2), and provides a discrete emission spectrum for quantum black holes. When the black hole emits one string of N bits encoded in one of the n cells, its horizon area decreases of an amount equal to the area of one cell.

Spacetime at the Planck Scale: The Quantum Computer View

Journal-ref: The Foundations of Quantum Mechanics (C. Garola, A. Rossi, S. Sozzo Editors) Cesena 2004, pg. 345-358

We assume that space-time at the Planck scale is discrete, quantised in Planck units and "qubitsed" (each pixel of Planck area encodes one qubit), that is, quantum space-time can be viewed as a quantum computer. Within this model, one finds that quantum space-time itself is entangled, and can quantum-evaluate Boolean functions which are the laws of Physics in their discrete and fundamental form.

The Early Universe as a Quantum Growing Network

We consider a quantum gravity register that is a particular quantum memory register which grows with time, and whose qubits are pixels of area of quantum de Sitter horizons. At each time step, the vacuum state of this quantum register grows because of the uncertainty in quantum information induced by the vacuum quantum fluctuations. The resulting virtual states, (responsible for the speed up of growth, i.e., inflation), are operated on by quantum logic gates and transformed into qubits. The model of quantum growing network (QGN) described here is exactly solvable, and (apart from its cosmological implications), can be regarded as the first attempt toward a future model for the quantum World-Wide Web. We also show that the bound on the speed of computation, the bound on clock precision, and the holographic bound, are saturated by the QGN.

Back

Credits: apnetwork.it