SearcharxivSearch

arXiv · 2501.03275

Can the ontology of Bohmian mechanics consists only in particles? The PBR theorem says no

Abstract

The meaning of the wave function is an important unresolved issue in Bohmian mechanics. On the one hand, according to the nomological view, the wave function of the universe or the universal wave function is nomological, like a law of nature. On the other hand, the PBR theorem proves that the wave function in quantum mechanics or the effective wave function in Bohmian mechanics is ontic, representing the ontic state of a physical system in the universe. It is usually thought that the nomological view of the universal wave function is compatible with the ontic view of the effective wave function, and thus the PBR theorem has no implications for the nomological view. In this paper, I argue that this is not the case, and these two views are in fact incompatible. This means that if the effective wave function is ontic as the PBR theorem proves, then the universal wave function cannot be nomological, and the ontology of Bohmian mechanics cannot consist only in particles. This incompatibility result holds true not only for Humeanism and dispositionalism but also for primitivism about laws of nature, which attributes a fundamental ontic role to the universal wave function. Moreover, I argue that although the nomological view can be held by rejecting one key assumption of the PBR theorem, the rejection will lead to serious problems, such as that the results of measurements and their probabilities cannot be explained in ontology in Bohmian mechanics. Finally, I briefly discuss three psi-ontologies, namely a physical field in a fundamental high-dimensional space, a multi-field in three-dimensional space, and RDMP (Random Discontinuous Motion of Particles) in three-dimensional space, and argue that the RDMP ontology can answer the objections to the psi-ontology raised by the proponents of the nomological view.

Explore related subjects

Keep this discovery

BibTeXRIS

Shan Gao. 2025-01-05. Can the ontology of Bohmian mechanics consists only in particles? The PBR theorem says no. https://doi.org/10.1007/s10701-023-00731-9

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

KEEP EXPLORING

Related papers

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

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

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