Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics

DOI10.1007/S10701-015-9968-4zbMATH Open1338.81130arXiv1308.5077OpenAlexW1906105519MaRDI QIDQ285982FDOQ285982

Authors: Giuseppe Castagnoli 

Publication date: 19 May 2016

Published in: Foundations of Physics (Search for Journal in Brave)

Abstract: Bob hides a ball in one of four drawers. Alice is to locate it. Classically she has to open up to three drawers, quantally just one. The fundamental reason for this quantum speedup is not known. The usual representation of the quantum algorithm is limited to the process of solving the problem. We extend it to the process of setting the problem. The number of the drawer with the ball becomes a unitary transformation of the random outcome of the preparation measurement. This extended, time-symmetric, representation brings in relational quantum mechanics. It is with respect to Bob and any external observer and cannot be with respect to Alice. It would tell her the number of the drawer with the ball before she opens any drawer. To Alice, the projection of the quantum state due to the preparation measurement should be retarded at the end of her search; in the input state of the search, the drawer number is determined to Bob and undetermined to Alice. We show that, mathematically, one can ascribe any part of the selection of the random outcome of the preparation measurement to the final Alice's measurement. Ascribing half of it explains the speedup of the present algorithm. This projects the input state to Alice on a state of lower entropy where she knows half of the number of the drawer with the ball in advance. The quantum algorithm turns out to be a sum over histories in each of which Alice knows in advance that the ball is in a pair of drawers and locates it by opening one of the two. In the sample of quantum algorithms examined, the part of the random outcome of the initial measurement selected by the final measurement is one half or slightly above it. Conversely, given an oracle problem, the assumption it is one half always corresponds to an existing quantum algorithm and gives the order of magnitude of the number of oracle queries required by the optimal one.

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

Recommendations

• A relational time-symmetric framework for analyzing the quantum computational speedup
• The quantum speed up as advanced cognition of the solution
• Theory of the quantum speed-up
• Quantum algorithms know in advance 50\% of the Solution they will find in the future
• Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup

zbMATH Keywords

quantum informationquantum computationquantum correlation and quantum retrocausalityquantum speeduprelational quantum mechanicstime-symmetric quantum mechanics

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Finite-dimensional groups and algebras motivated by physics and their representations (81R05)

Cites Work

• Conservative logic
• Relational quantum mechanics
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Title not available (Why is that?)
• Strengths and Weaknesses of Quantum Computing
• Title not available (Why is that?)
• Rapid solution of problems by quantum computation
• Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters
• Title not available (Why is that?)
• Theory of the quantum speed-up
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Collective Description of Electron Interactions: III. Coulomb Interactions in a Degenerate Electron Gas

Cited In (12)

• Theory of the quantum speed-up
• Quantum confidentiality query protocol based on Bell state identity
• The 50\% advanced information rule of the quantum algorithms
• A low failure rate quantum algorithm for searching maximum or minimum
• A novel quantum anonymous ranking protocol
• The quantum speed up as advanced cognition of the solution
• Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup
• NOON State Generation with Phonons in Acoustic Wave Resonators Assisted by a Nitrogen‐Vacancy‐Center Ensemble
• Detecting quantum speedup in closed and open systems
• Quantum algorithms know in advance 50\% of the Solution they will find in the future
• Quantum states as virtual singletons: converting duality into symmetry
• A relational time-symmetric framework for analyzing the quantum computational speedup

This page was built for publication: Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics

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