Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup

DOI10.1007/s10701-018-0146-3zbMath1391.81059arXiv1705.02657OpenAlexW2789712908MaRDI QIDQ1643528

Giuseppe Castagnoli

Publication date: 19 June 2018

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

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

zbMATH Keywords

quantum algorithmsrelational quantum mechanicstime-symmetric quantum mechanicsretrocausalityquantum computational speedup

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

A matrix representation of quantum circuits over non-adjacent qudits ⋮ A relational time-symmetric framework for analyzing the quantum computational speedup

Cites Work

• Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics
• Can a future choice affect a past measurement's outcome?
• Conservative logic
• Quantum walks: a comprehensive review
• Relational quantum mechanics
• The elusive source of quantum speedup
• Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters
• Forrelation
• Symmetry of Physical Laws. Part III. Prediction and Retrodiction
• State complexity and quantum computation
• Irreversibility and Heat Generation in the Computing Process
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Strengths and Weaknesses of Quantum Computing
• Quantum cryptography based on Bell’s theorem
• Theory of the quantum speed-up
• On the role of entanglement in quantum-computational speed-up
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup