Quantum computational speedup and retrocausality

• URL: http://arxiv.org/abs/2505.08346v4
• Date: Mon, 07 Jul 2025 09:36:32 GMT
• Title: Quantum computational speedup and retrocausality
• Authors: Giuseppe Castagnoli,
• Abstract summary: Involving only the measurements of commuting observables should be subject to classical logic.<n>This would allow flanking their customary quantum description with a classical logic description.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Involving only the measurements of commuting observables - the problem-setting and the corresponding solution - quantum algorithms should be subject to classical logic. This would allow flanking their customary quantum description with a classical logic description, with surprising consequences. In the classical logic description of the quantum algorithm, very simply, it is as if the problem-solver knew in advance, before beginning her problem-solving action, one of the possible halves of the information that specifies the solution of the problem she will produce and measure in the future and could use this knowledge to produce the solution with fewer computation steps. This is a causal loop whose retrocausal character turns out to be implicit in the very notion of quantum state superposition, both an essential ingredient of the quantum computational speedup and one of the pillars of quantum mechanics. Indeed, the key point of the work is that the classical logic description of a quantum state superposition must resort to a logical form of retrocausality that in turn must be physically implicit in the superposition itself. The existence of retrocausality in ordinary quantum physics implies e different way of viewing physical reality. It explains in a unified way all quantum speedups and quantum nonlocality. It highlights the teleological character of quantum algorithms, that is, their being evolutions toward a goal (the solution of the problem) with an attractor in the solution they will produce in the future (the solution again). Under the quantum cosmological assumption, it provides a plausible physical basis to the teleological character of natural evolutions.

Related papers

• Counterfactuals in Macroscopic Quantum Physics: Irreversibility, Measurement and Locality [0.0]
  We argue that measurement, irreversibility and locality can all appear to challenge the universality of quantum theory.<n>We find novel features of quantum thermodynamics relating to irreversibility, information erasure and coherence.<n>This reveals new ways of characterising the quantum information stored in entanglement and quantum branching structure.
  arXiv  Detail & Related papers  (2025-05-28T20:14:17Z)
• Super Quantum Mechanics [37.69303106863453]
  We introduce Super Quantum Mechanics (SQM) as a theory that considers states in Hilbert space subject to multiple quadratic constraints.<n>In this case, the stationary SQM problem is a quantum inverse problem with multiple applications in machine learning and artificial intelligence.
  arXiv  Detail & Related papers  (2025-01-25T19:41:04Z)
• Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability [0.0]
  This work is to express "quantum computation" by introducing specially-featured quantum connectives and quantum quantifiers.<n>We demonstrate that quantum first-order logics possess an ability of expressing bounded-error quantum logarithmic-time computability.
  arXiv  Detail & Related papers  (2025-01-21T09:58:59Z)
• Towards Entropic Constraints on Quantum Speedups [0.0]
  Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information theory gives us a multitude of metrics we might choose from to measure how fundamentally 'quantum' is the behavior of a quantum computer running an algorithm.
  arXiv  Detail & Related papers  (2024-11-05T19:00:04Z)
• An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems [14.955338558971787]
  We present the first provable exponential separation between quantum and quantum-inspired classical algorithms for the basic problem of solving a linear system.<n>From the current state-of-affairs, it is unclear whether we can hope for exponential quantum speedups for any natural machine learning task.
  arXiv  Detail & Related papers  (2024-11-04T13:49:26Z)
• Computable and noncomputable in the quantum domain: statements and conjectures [0.70224924046445]
  We consider an approach to the question of describing a class of problems whose solution can be accelerated by a quantum computer. The unitary operation that transforms the initial quantum state into the desired one must be decomposable into a sequence of one- and two-qubit gates.
  arXiv  Detail & Related papers  (2024-03-25T15:47:35Z)
• Quantum Algorithm for Reversing Unknown Unitary Evolutions [8.630679964089696]
  Reversing an unknown quantum evolution is of central importance to quantum information processing and fundamental physics.<n>We introduce the Quantum Unitary Reversal Algorithm (QURA), a deterministic and exact approach to universally reverse arbitrary unknown unitary transformations.
  arXiv  Detail & Related papers  (2024-03-07T17:59:11Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Practical limitations of quantum data propagation on noisy quantum processors [0.9362259192191963]
  We show that owing to the noisy nature of current quantum processors, such a quantum algorithm will require single- and two-qubit gates with very low error probability to produce reliable results. Specifically, we provide the upper bounds on how the relative error in variational parameters' propagation scales with the probability of noise in quantum hardware.
  arXiv  Detail & Related papers  (2023-06-22T17:12:52Z)
• Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem [0.0]
  This work revisits quantum algorithms for the well-known welded tree problem. It proposes a very succinct quantum algorithm based on the simplest coined quantum walks.
  arXiv  Detail & Related papers  (2023-04-17T16:03:50Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• On the Common Logical Structure of Classical and Quantum Mechanics [0.0]
  We show that quantum theory does satisfy the classical distributivity law once the full meaning of quantum propositions is properly taken into account. We show that the lattice of statistical propositions in classical mechanics follows the same structure, yielding an analogue non-commutative sublattice of classical propositions.
  arXiv  Detail & Related papers  (2022-06-21T18:31:53Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• About the description of physical reality of Bell's experiment [91.3755431537592]
  A hidden variables model complying with the simplest form of Local Realism was recently introduced. It reproduces Quantum Mechanics' predictions for an even ideally perfect Bell's experiment. A new type of quantum computer does not exist yet, not even in theory.
  arXiv  Detail & Related papers  (2021-09-06T15:55:13Z)
• On quantum neural networks [91.3755431537592]
  We argue that the concept of a quantum neural network should be defined in terms of its most general function. Our reasoning is based on the use of the Feynman path integral formulation in quantum mechanics.
  arXiv  Detail & Related papers  (2021-04-12T18:30:30Z)
• Tossing Quantum Coins and Dice [0.0]
  This case is an important example of a quantum procedure because it presents a typical framework employed in quantum information processing and quantum computing. The emphasis is on the clarification of the difference between quantum and classical conditional probabilities.
  arXiv  Detail & Related papers  (2021-03-31T11:39:56Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• A Quantum Interpretation of Bunched Logic for Quantum Separation Logic [22.507329566323982]
  We develop a program logic where pre- and post-conditions are BI formulas describing quantum states. We exercise the logic for proving the security of quantum one-time pad and secret sharing.
  arXiv  Detail & Related papers  (2021-01-30T22:24:36Z)
• Operational Resource Theory of Imaginarity [48.7576911714538]
  We show that quantum states are easier to create and manipulate if they only have real elements. As an application, we show that imaginarity plays a crucial role for state discrimination.
  arXiv  Detail & Related papers  (2020-07-29T14:03:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.