Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1602.06100

Delayed Choice Experiments and the Bohm Approach

B. J. Hiley·R. E. Callaghan
View original source ↗Read source document ↗Export metadata ↓

Abstract

The delayed choice experiments of the type introduced by Wheeler and extended by Englert, Scully, Süssmann and Walther [ESSW], and others, have formed a rich area for investigating the puzzling behaviour of particles undergoing quantum interference. The surprise provided by the original delayed choice experiment, led Wheeler to the conclusion that "no phenomenon is a phenomenon until it is an observed phenomenon", a radical explanation which implied that "the past has no existence except as it is recorded in the present". However Bohm, Dewdney and Hiley have shown that the Bohm interpretation gives a straightforward account of the behaviour of the particle without resorting to such a radical explanation. The subsequent modifications of this experiment led both Aharonov and Vaidman and [ESSW] to conclude that the resulting Bohm-type trajectories in these new situations produce unacceptable properties. For example, if a cavity is placed in one arm of the interferometer, it will be excited by a particle travelling down the {\em other} arm. In other words it is the particle that does {\em not} go through the cavity that gives up its energy! If this analysis is correct, this behaviour would be truly bizarre and could only be explained by an extreme non-local transfer of energy that is even stronger than that required in an EPR-type processes. In this paper we show that this conclusion is not correct and that if the Bohm interpretation is used correctly, it gives a {\em local} explanation, which actually corresponds exactly to the standard quantum mechanics explanation offered by Englert, Scully, Süssmann and Walther [ESSW].

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

B. J. Hiley, R. E. Callaghan. 2016-02-19. Delayed Choice Experiments and the Bohm Approach. https://doi.org/10.1088/0031-8949%2F74%2F3%2F007

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗