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

  title={Completing the physical representation of quantum algorithms provides a retrocausal explanation of their speedup},
  author={Giuseppe Castagnoli},
  journal={arXiv: Quantum Physics},
  • G. Castagnoli
  • Published 7 March 2016
  • Computer Science
  • arXiv: Quantum Physics
In previous works, we showed that an optimal quantum algorithm can always be seen as a sum over classical histories in each of which the problem solver knows in advance one of the possible halves of the solution she will read in the future and performs the computation steps (oracle queries) still needed to reach it. Given an oracle problem, this retrocausal explanation of the speedup yields the order of magnitude of the number of oracle queries needed to solve it in an optimal quantum way… 



A retrocausal model of the quantum computational speedup

The representation of quantum algorithms is extended to the preparation of the problem setting and the possibility of ascribing the selection of a variable fraction R of the information that specifies the random outcome of the initial measurement to the final measurement is highlighted.

On the Relation Between Quantum Computational Speedup and Retrocausality

The reason for the quantum speedup is investigated (quantum algorithms require fewer computation steps than their classical counterparts), and the representation of the quantum algorithm is extended to the process of setting the problem, namely choosing the function computed by the black box.

Highlighting the Mechanism of the Quantum Speedup by Time-Symmetric and Relational Quantum Mechanics

It is shown that, mathematically, one can ascribe any part of the selection of the random outcome of the preparation measurement to the final Alice’s measurement, which explains the speedup of the present algorithm.

On the power of quantum computation

  • Daniel R. Simon
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.

Quantum computing, postselection, and probabilistic polynomial-time

  • S. Aaronson
  • Computer Science
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2005
It is shown that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently, or probabilistic polynomial-time, and implies, as an easy corollary, a celebrated theorem of Beigel, Reingold and Spielman that PP is closed under intersection.

Contextuality supplies the ‘magic’ for quantum computation

This work proves a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via ‘magic state’ distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer.

The mechanism of the quantum speed up

Bob chooses a function and gives to Alice the black box that computes it. Alice, without knowing Bob's choice, should find a character of the function (e. g. its period) by computing its value for

On the role of entanglement in quantum-computational speed-up

  • R. JozsaN. Linden
  • Physics, Computer Science
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 2003
It is argued that it is nevertheless misleading to view entanglement as a key resource for quantum‐computational power, as it is necessary for any quantum algorithm to offer an exponential speed‐up over classical computation.

Relational quantum mechanics

I suggest that the common unease with taking quantum mechanics as a fundamental description of nature (the “measurement problem”) could derive from the use of an incorrect notion, as the unease with

Quantum correlation between the selection of the problem and that of the solution sheds light on the mechanism of the quantum speed-up

Both the quadratic and exponential speed-ups are explained by the fact that quantum algorithms start from this advanced knowledge, which gives to Alice advanced knowledge of 50% of the information that specifies the solution.