SearcharxivSearch

arXiv · quant-ph/0410156

The Theory Experiment Connection: Rn Space and Inflationary Cosmology

Abstract

Based on a discussion of the theory experiment connection, it is proposed to tighten the connection by replacing the real and complex number basis of physical theories by sets R_{n},C_{n} of length 2n finite binary string numbers. The form of the numbers in R_{n} is based on the infinite hierarchy of 2n figure outputs from measurements of any physical quantity with an infinite range (distance, energy, etc.). A space and time based on these numbers is described. It corresponds to an infinite sequence of spherical scale sections R_{n,e} (e an integer). Each section has the same number of points but the size increases exponentially with increasing e. The sections converge towards an origin which is a space singularity. Iteration of an order preserving transformation, F_{<} or its inverse shows exponential expansion or contraction of the space with the origin as a source or sink of space points. The suitability of R_{n} space as a framework for inflationary cosmology is based on a constant iteration rate for F_{<} and time dependent e and n=n(t). At t=0 all space is restricted to a region of scale sections R_{n_{0},e} with n_{0} (small) and e\leq e_{0} (negative). Inflation, which occurs naturally, is stopped automatically at time t_{I} by increasing n from n_{0} to n_{I}>>n_{0}. Here n_{I} is such that the outermost Δscale sections of R_{n_{0}} space, which are moving at velocities >c at time t_{I}, are contained in the scale section R_{n_{I},0} of R_{n_{I}} space. This is needed if R_{n_{I},0} space is to be similar to the usual R space. Hubble expansion and the redshift are accounted for by a continuing slow increase in n. Comparison with experimental data suggests that the rate of increase must be at least one n unit every 30-60 million years.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Benioff. 2004-10-21. The Theory Experiment Connection: Rn Space and Inflationary Cosmology. https://doi.org/10.1117/12.620296

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