Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1111.2696

Experimental undecidability of macroscopic quantumness

Pawel Kurzynski·Akihito Soeda·Ravishankar Ramanathan·Andrzej Grudka·Jayne Thompson·Dagomir Kaszlikowski
View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum mechanics marks a radical departure from the classical understanding of Nature, fostering an inherent randomness which forbids a deterministic description; yet the most fundamental departure arises from something different. As shown by Bell [1] and Kochen-Specker [2], quantum mechanics portrays a picture of the world in which reality loses its objectivity and is in fact created by observation. Quantum mechanics predicts phenomena which cannot be explained by any theory with objective realism, although our everyday experience supports the hypothesis that macroscopic objects, despite being made of quantum particles, exist independently of the act of observation; in this paper we identify this behavior as classical. Here we show that this seemingly obvious classical behavior of the macroscopic world cannot be experimentally tested and belongs to the realm of ontology similar to the dispute on the interpretations of quantum mechanics [3,4]. For small systems such as a single photon [5] or a pair [6], it has been experimentally proven that a classical description cannot be sustained. Recently, there have also been experiments that claim to have demonstrated quantum behavior of relatively large objects such as interference of fullerenes [7], the violation of Leggett-Garg inequality in Josephson junction [8], and interference between two condensed clouds of atoms [9], which suggest that there is no limit to the size of the system on which the quantum-versus-classical question can be tested. These behaviors, however, are not sufficient to refute classical description in the sense of objective reality. Our findings show that once we reach the regime where an Avogadro number of particles is present, the quantum-versus-classical question cannot be answered experimentally.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Pawel Kurzynski, Akihito Soeda, Ravishankar Ramanathan, Andrzej Grudka, Jayne Thompson, Dagomir Kaszlikowski. 2011-11-11. Experimental undecidability of macroscopic quantumness. https://arxiv.org/abs/1111.2696

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↗