Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · quant-ph/0004052

Quantum to Classical Transition from the Cosmic Background Radiation

M. C. de Oliveira·N. G. Almeida·S. S. Mizrahi·M. H. Y. Moussa
View original source ↗Read source document ↗Export metadata ↓

Abstract

We have revisited the Ghirardi-Rimini-Weber-Pearle (GRWP) approach for continuous dynamical evolution of the state vector for a macroscopic object. Our main concern is to recover the decoupling of the state vector dynamics for the center-of-mass (CM) and internal motion, as in the GRWP model, but within the framework of the standard cosmology. In this connection we have taken the opposite direction of the GRWP argument, that the cosmic background radiation (CBR) has originated from a fundamental stochastic hitting process. We assume the CBR as a clue of the Big Bang, playing a main role in the decoupling of the state vector dynamics of the CM and internal motion. In our model, instead of describing a continuous spontaneous localization (CSL) of a system of massive particles as proposed by Ghirardi, Pearle and Rimini, the Itô stochastic equation accounts for the intervention of the CBR on the system of particles. Essentially, this approach leads to a pre-master equation for both the CBR and particles degrees of freedom. The violation of the principle of energy conservation characteristic of the CSL model is avoided as well as the additional assumption on the size of the GRWP's localization width necessary to reach the decoupling between the collective and internal motions. Moreover, realistic estimation for the decoherence time, exhibiting an interesting dependence on the CBR temperature, is obtained. From the formula for the decoherence time it is possible to analyze the transition from micro to macro dynamics in both the early hot Universe and the nowadays cold one. The entropy of the system under decoherence is analyzed and the emergent `pointer basis' is discussed. In spite of not having imposed a privileged basis, in our model the position still emerges as the preferred observable as in the CSL model.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

M. C. de Oliveira, N. G. Almeida, S. S. Mizrahi, M. H. Y. Moussa. 2000-04-12. Quantum to Classical Transition from the Cosmic Background Radiation. https://doi.org/10.1103/physreva.62.012108

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↗