The quantum speed up as advanced cognition of the solution

DOI10.1007/S10773-008-9859-YzbMATH Open1173.81302arXiv0809.4545OpenAlexW2062528634MaRDI QIDQ732306FDOQ732306

Authors: Giuseppe Castagnoli 

Publication date: 9 October 2009

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Abstract: With reference to a search in a database of size N, Grover states: "What is the reason that one would expect that a quantum mechanical scheme could accomplish the search in O(square root of N) steps? It would be insightful to have a simple two line argument for this without having to describe the details of the search algorithm". The answer provided in this work is: "because any quantum algorithm takes the time taken by a classical algorithm that knows in advance 50% of the information that specifies the solution of the problem". This empirical fact, unnoticed so far, holds for both quadratic and exponential speed ups and is theoretically justified in three steps: (i) once the physical representation is extended to the production of the problem on the part of the oracle and to the final measurement of the computer register, quantum computation is reduction on the solution of the problem under a relation representing problem-solution interdependence, (ii) the speed up is explained by a simple consideration of time symmetry, it is the gain of information about the solution due to backdating, to before running the algorithm, a time-symmetric part of the reduction on the solution; this advanced knowledge of the solution reduces the size of the solution space to be explored by the algorithm, (iii) if I is the information acquired by measuring the content of the computer register at the end of the algorithm, the quantum algorithm takes the time taken by a classical algorithm that knows in advance 50% of I, which brings us to the initial statement.

Full work available at URL: https://arxiv.org/abs/0809.4545

Recommendations

• The mechanism of quantum computation
• Theory of the quantum speed-up
• Quantum one go computation and the physical computation level of biological information processing
• Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics
• Quantum algorithms know in advance 50\% of the Solution they will find in the future

zbMATH Keywords

quantum computationquantum measurementquantum consciousnessmany bodyquantum speed up

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Conservative logic
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Title not available (Why is that?)
• Quantum algorithms revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of the quantum speed-up
• Title not available (Why is that?)
• Title not available (Why is that?)
• The mechanism of quantum computation

Cited In (7)

• Theory of the quantum speed-up
• The 50\% advanced information rule of the quantum algorithms
• Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics
• Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup
• Quantum one go computation and the physical computation level of biological information processing
• Quantum algorithms know in advance 50\% of the Solution they will find in the future
• A relational time-symmetric framework for analyzing the quantum computational speedup

This page was built for publication: The quantum speed up as advanced cognition of the solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732306)