Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2011.14680 · Physical Review A

Unobservable causal loops as a way to explain both the quantum computational speedup and quantum nonlocality

Giuseppe Castagnoli

Published Sep 2, 2021• 8 citations
arXivHTMLPDF

Abstract

We consider the reversible processes between two one-to-one correlated measurement outcomes which underlie both problem solving and quantum nonlocality. In the former case, the two outcomes are the setting and the solution of the problem; in the latter, they are those of measuring a pair of maximally entangled observables whose subsystems are space separate. We argue that the quantum description of these processes mathematically describes the correlation but leaves the causal structure that physically ensures it free of violating the time symmetry required of the description of a reversible process. It would therefore be incomplete and could be completed by time symmetrizing it. This is done by assuming that the two measurements evenly contribute to selecting the pair of correlated measurement outcomes. Time symmetrization leaves the ordinary quantum description unaltered but shows that it is the quantum superposition of unobservable time-symmetrization instances whose causal structure is completely defined. Each instance is a causal loop: Causation goes from the initial to the final measurement outcome and then back from the final to the initial outcome. In the speedup, all is as if the problem solver knew in advance half of the information about the solution she will produce in the future and could use this knowledge to produce the solution with fewer computation steps. In nonlocality, the measurement on either subsystem retrocausally and locally changes the state of both subsystems when the two were not yet spatially separate. This locally causes the correlation between the two future measurement outcomes.

DOI
10.1103/physreva.104.032203

Related papers

The quantum mechanical notion of unobservable causal loop and the anthropic principle

Giuseppe Castagnoli

It can be argued that the ordinary description of the reversible quantum process between two one-to-one correlated measurement outcomes is incomplete because, by not specifying the direction of causality, it allows causal structures that violate the time symmetry that is required of a reversible process. This also means that it can be completed simply by time-symmetrizing it, namely by requiring that the initial and final measurements evenly contribute to the selection of their correlated pair of outcomes. This leaves the description unaltered but shows that it is the quantum superposition of unobservable time-symmetrized instances whose causal structure is completely defined. Each instance consists of a causal loop: the final measurement that changes backwards in time the input state of the unitary transformation that leads to the state immediately before it. In former works, we have shown that such loops exactly explain the quantum computational speedup and quantum nonlocality. In this work we show that they lead to a completion of the anthropic principle that allows a universe evolution with quantum speedup.

arXiv:2103.03173•Mar 4, 2021•0 citations

Discussing the explanation of the quantum speed up

Giuseppe Castagnoli

In former work, we showed that a quantum algorithm is the sum over the histories of a classical algorithm that knows in advance 50% of the information about the solution of the problem - each history is a possible way of getting the advanced information and a possible result of computing the missing information. We gave a theoretical justification of this 50% advanced information rule and checked that it holds for a large variety of quantum algorithms. Now we discuss the theoretical justification in further detail and counter a possible objection. We show that the rule is the generalization of a simple, well known, explanation of quantum nonlocality - where logical correlation between measurement outcomes is physically backed by a causal/deterministic/local process with causality allowed to go backward in time with backdated state vector reduction. The possible objection is that quantum algorithms often produce the solution of the problem in an apparently deterministic way (when their unitary part produces an eigenstate of the observable to be measured and measurement produces the corresponding eigenvalue - the solution - with probability 1), while the present explanation of the speed up relies on the nondeterministic character of quantum measurement. We show that this objection would mistake the nondeterministic production of a definite outcome for a deterministic production.

arXiv:0910.2313•Oct 13, 2009•0 citations

Completing the physical representation of quantum algorithms explains their computational speedup

Giuseppe Castagnoli

The usual representation of quantum algorithms, limited to the problem solving process, is incomplete as it lacks the initial measurement. Completing it involves three steps: (i) representing the problem setting process, (ii) relativizing this representation to Alice, the problem solver, to whom the problem setting must be concealed, (iii) representing the reversibility of the computation process by symmetrizing it for time reversal. The latter step shows that all is as if Alice, before beginning her problem solving action, knew half of the information that specifies the solution of the problem she will read in the future. An optimal quantum algorithm is a sum over classical histories in each of which Alice knows in advance one of the possible halves of the solution and performs the computation steps (oracle queries) necessary to identify the missing half. This explains the quantum computational speedup and allows to predict the speedup offered by the optimal quantum solution of any oracle problem.

•May 7, 2017•0 citations

On the Relation Between Quantum Computational Speedup and Retrocausality

Giuseppe Castagnoli

We investigate the reason for the quantum speedup (quantum algorithms require fewer computation steps than their classical counterparts). We extend the representation of the quantum algorithm to the process of setting the problem, namely choosing the function computed by the black box. The initial measurement selects a setting at random, Bob (the problem setter) unitarily changes it into the desired one. With reference to the observer dependent quantum states of relational quantum mechanics, this representation is with respect to Bob and any external observer, it cannot be with respect to Alice (the problem solver). It would tell her the function computed by the black box, which to her should be hidden. To Alice, the projection of the quantum state due to the initial measurement is retarded at the end of her problem solving action, so that the algorithm input state remains one of complete ignorance of the setting. By black box computations, she unitarily sends it into the output state that, for each possible setting, encodes the corresponding solution, acquired by the final measurement. Mathematically, we can ascribe to the final measurement the selection of any fraction R of the random outcome of the initial measurement. This projects the input state to Alice on one of lower entropy where she knows the corresponding fraction of the problem setting. Given the appropriate value of R, the quantum algorithm is a sum over classical histories in each of which Alice, knowing in advance one of the R-th parts of the setting, performs the black box computations still required to identify the solution. Given a quantum algorithm, this retrocausality model provides the value of R that explains its speed up; in the major quantum algorithms, R is 1/2 or slightly above it. Conversely, given the problem, R=1/2 always yields the order of magnitude of the number of black box computations required to solve it in an optimal quantum way. Quanta 2016; 5: 34–52.

Quanta•Jan 10, 2016•8 citations

Entanglement Without Nonlocality: Quantum Correlations as Incomplete Sequences

Brănescu, Gabriel

Quantum entanglement appears nonlocal: measuring one particle instantaneously determines outcomes for its distant partner, seemingly defying relativistic causality. Building on prior work, we propose that this "paradox" dissolves when particles are recognized not as point-objects but as spatial termini of single, extended correlation sequences. These sequences remain genuinely incomplete – indeterminate in any measurement basis – until measurement supplies the boundary conditions that complete the entire pattern. No information propagates between termini because they were never separate entities. Measurement doesn't reveal hidden properties; it finishes an incomplete structure through the enforcement of local invariants via irreversible interaction with macroscopic systems. This framework explains why superposition exists, why certain observables become classical (position, momentum, and energy), and why quantum behavior dominates at small scales while classical behavior emerges at large scales. The approach eliminates longstanding paradoxes without exotic ontology: no hidden variables, no parallel worlds, no consciousness-dependent collapse, no violation of relativity. We derive testable predictions and resolve the measurement problem: there is no discontinuous collapse, only thermodynamically irreversible completion of correlation sequences. Most provocatively, this analysis reinforces a claim from prior work: if laws are emergent attractors rather than eternal axioms, the search for a "theory of everything" unifying quantum mechanics and general relativity may rest on a category error.

•Nov 24, 2025•0 citations

Hidden causal loops, macroscopic realism and Einstein-Podolsky-Rosen-Bell nonlocality: forward-backward stochastic simulations

M. D. Reid, P. D. Drummond

We analyze quantum measurement and entanglement by solving the dynamics of stochastic amplitudes that propagate both forward and backward in time. The model allows simulation of Einstein-Podolsky-Rosen and Bell correlations, and reveals consistency with a weak form of local realism defined after the unitary interactions determining the measurement settings. Bell violations emerge due to a breakdown of a subset of Bell's local-realism conditions. Our results elucidate how hidden causal loops can explain Bell nonlocality, without requiring retrocausality at a macroscopic level.

arXiv:2303.02373•Mar 4, 2023•4 citations
We consider the reversible processes between two one-to-one correlated measurement outcomes which underlie both problem solving and quantum nonlocality. In the former case, the two outcomes are the setting and the solution of the problem; in the latter, they are those of measuring a pair of maximally entangled observables whose subsystems are space separate. We argue that the quantum description of these processes mathematically describes the correlation but leaves the causal structure that physically ensures it free of violating the time symmetry required of the description of a reversible process. It would therefore be incomplete and could be completed by time symmetrizing it. This is done by assuming that the two measurements evenly contribute to selecting the pair of correlated measurement outcomes. Time symmetrization leaves the ordinary quantum description unaltered but shows that it is the quantum superposition of unobservable time-symmetrization instances whose causal structure is completely defined. Each instance is a causal loop: Causation goes from the initial to the final measurement outcome and then back from the final to the initial outcome. In the speedup, all is as if the problem solver knew in advance half of the information about the solution she will produce in the future and could use this knowledge to produce the solution with fewer computation steps. In nonlocality, the measurement on either subsystem retrocausally and locally changes the state of both subsystems when the two were not yet spatially separate. This locally causes the correlation between the two future measurement outcomes.
It can be argued that the ordinary description of the reversible quantum process between two one-to-one correlated measurement outcomes is incomplete because, by not specifying the direction of causality, it allows causal structures that violate the time symmetry that is required of a reversible process. This also means that it can be completed simply by time-symmetrizing it, namely by requiring that the initial and final measurements evenly contribute to the selection of their correlated pair of outcomes. This leaves the description unaltered but shows that it is the quantum superposition of unobservable time-symmetrized instances whose causal structure is completely defined. Each instance consists of a causal loop: the final measurement that changes backwards in time the input state of the unitary transformation that leads to the state immediately before it. In former works, we have shown that such loops exactly explain the quantum computational speedup and quantum nonlocality. In this work we show that they lead to a completion of the anthropic principle that allows a universe evolution with quantum speedup.
In former work, we showed that a quantum algorithm is the sum over the histories of a classical algorithm that knows in advance 50% of the information about the solution of the problem - each history is a possible way of getting the advanced information and a possible result of computing the missing information. We gave a theoretical justification of this 50% advanced information rule and checked that it holds for a large variety of quantum algorithms. Now we discuss the theoretical justification in further detail and counter a possible objection. We show that the rule is the generalization of a simple, well known, explanation of quantum nonlocality - where logical correlation between measurement outcomes is physically backed by a causal/deterministic/local process with causality allowed to go backward in time with backdated state vector reduction. The possible objection is that quantum algorithms often produce the solution of the problem in an apparently deterministic way (when their unitary part produces an eigenstate of the observable to be measured and measurement produces the corresponding eigenvalue - the solution - with probability 1), while the present explanation of the speed up relies on the nondeterministic character of quantum measurement. We show that this objection would mistake the nondeterministic production of a definite outcome for a deterministic production.
The usual representation of quantum algorithms, limited to the problem solving process, is incomplete as it lacks the initial measurement. Completing it involves three steps: (i) representing the problem setting process, (ii) relativizing this representation to Alice, the problem solver, to whom the problem setting must be concealed, (iii) representing the reversibility of the computation process by symmetrizing it for time reversal. The latter step shows that all is as if Alice, before beginning her problem solving action, knew half of the information that specifies the solution of the problem she will read in the future. An optimal quantum algorithm is a sum over classical histories in each of which Alice knows in advance one of the possible halves of the solution and performs the computation steps (oracle queries) necessary to identify the missing half. This explains the quantum computational speedup and allows to predict the speedup offered by the optimal quantum solution of any oracle problem.
We investigate the reason for the quantum speedup (quantum algorithms require fewer computation steps than their classical counterparts). We extend the representation of the quantum algorithm to the process of setting the problem, namely choosing the function computed by the black box. The initial measurement selects a setting at random, Bob (the problem setter) unitarily changes it into the desired one. With reference to the observer dependent quantum states of relational quantum mechanics, this representation is with respect to Bob and any external observer, it cannot be with respect to Alice (the problem solver). It would tell her the function computed by the black box, which to her should be hidden. To Alice, the projection of the quantum state due to the initial measurement is retarded at the end of her problem solving action, so that the algorithm input state remains one of complete ignorance of the setting. By black box computations, she unitarily sends it into the output state that, for each possible setting, encodes the corresponding solution, acquired by the final measurement. Mathematically, we can ascribe to the final measurement the selection of any fraction R of the random outcome of the initial measurement. This projects the input state to Alice on one of lower entropy where she knows the corresponding fraction of the problem setting. Given the appropriate value of R, the quantum algorithm is a sum over classical histories in each of which Alice, knowing in advance one of the R-th parts of the setting, performs the black box computations still required to identify the solution. Given a quantum algorithm, this retrocausality model provides the value of R that explains its speed up; in the major quantum algorithms, R is 1/2 or slightly above it. Conversely, given the problem, R=1/2 always yields the order of magnitude of the number of black box computations required to solve it in an optimal quantum way. Quanta 2016; 5: 34–52.
Quantum entanglement appears nonlocal: measuring one particle instantaneously determines outcomes for its distant partner, seemingly defying relativistic causality. Building on prior work, we propose that this "paradox" dissolves when particles are recognized not as point-objects but as spatial termini of single, extended correlation sequences. These sequences remain genuinely incomplete – indeterminate in any measurement basis – until measurement supplies the boundary conditions that complete the entire pattern. No information propagates between termini because they were never separate entities. Measurement doesn't reveal hidden properties; it finishes an incomplete structure through the enforcement of local invariants via irreversible interaction with macroscopic systems. This framework explains why superposition exists, why certain observables become classical (position, momentum, and energy), and why quantum behavior dominates at small scales while classical behavior emerges at large scales. The approach eliminates longstanding paradoxes without exotic ontology: no hidden variables, no parallel worlds, no consciousness-dependent collapse, no violation of relativity. We derive testable predictions and resolve the measurement problem: there is no discontinuous collapse, only thermodynamically irreversible completion of correlation sequences. Most provocatively, this analysis reinforces a claim from prior work: if laws are emergent attractors rather than eternal axioms, the search for a "theory of everything" unifying quantum mechanics and general relativity may rest on a category error.
We analyze quantum measurement and entanglement by solving the dynamics of stochastic amplitudes that propagate both forward and backward in time. The model allows simulation of Einstein-Podolsky-Rosen and Bell correlations, and reveals consistency with a weak form of local realism defined after the unitary interactions determining the measurement settings. Bell violations emerge due to a breakdown of a subset of Bell's local-realism conditions. Our results elucidate how hidden causal loops can explain Bell nonlocality, without requiring retrocausality at a macroscopic level.