SearcharxivSearch

arXiv · 1501.00693

Do Spins Have Directions?

Abstract

The standard Bloch sphere representation was recently generalized to the 'extended Bloch representation' describing not only systems of arbitrary dimension, but also their measurements. This model solves the measurement problem and is based on the 'hidden-measurement interpretation', according to which the Born rule results from our lack of knowledge about the interaction between measuring apparatus and the measured entity. We present here the extended Bloch model and use it to investigate the nature of quantum spin and its relation to our Euclidean space. We show that spin eigenstates cannot generally be associated with directions in the Euclidean space, but only with generalized directions in the Blochean space, which generally is a space of higher dimension. Hence, spin entities have to be considered as genuine non-spatial entities. We also show, however, that specific vectors can be identified in the Blochean theater that are isomorphic to the Euclidean space directions, and therefore representative of them, and that spin eigenstates always have a predetermined orientation with respect to them. We use the details of our results to put forward a new view of realism, that we call 'multiplex realism', providing a specific framework with which to interpret the human observations and understanding of the component parts of the world. Elements of reality can be represented in different theaters, one being our customary Euclidean space, and another one the quantum realm, revealed to us through our sophisticated experiments, whose elements of reality, in the quantum jargon, are the eigenvalues and eigenstates. Our understanding of the component parts of the world can then be guided by looking for the possible connections, in the form of partial morphisms, between the different representations, which is precisely what we do in this article with regard to spin entities.

Explore related subjects

Keep this discovery

BibTeXRIS

Diederik Aerts, Massimiliano Sassoli de Bianchi. 2015-01-04. Do Spins Have Directions?. https://doi.org/10.1007/s00500-015-1913-0

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