Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1511.07610

Quantization of Big Bang in crypto-Hermitian Heisenberg picture

Miloslav Znojil
View original source ↗Read source document ↗Export metadata ↓

Abstract

A background-independent quantization of the Universe near its Big Bang singularity is considered using a drastically simplified toy model. Several conceptual issues are addressed. (1) The observable spatial-geometry characteristics of our empty-space expanding Universe is sampled by the time-dependent operator $Q=Q(t)$ of the distance between two space-attached observers (``Alice and Bob''). (2) For any pre-selected guess of the simple, non-covariant time-dependent observable $Q(t)$ one of the Kato's exceptional points (viz., $t=τ_{(EP)}$) is postulated {\em real-valued}. This enables us to treat it as the time of Big Bang. (3) During our ``Eon'' (i.e., at all $t>τ_{(EP)}$) the observability status of operator $Q(t)$ is mathematically guaranteed by its self-adjoint nature with respect to an {\em ad hoc} Hilbert-space metric $Θ(t) \neq I$. (4) In adiabatic approximation (i.e., in Heisenberg picture) the passage of the Universe through its $t=τ_{(EP)}$ singularity is interpreted as a quantum phase transition between the preceding and the present Eon. It is worth adding that in our model the widely accepted ``Big Bounce'' regularization of the classical Big Bang singularity after quantization gets replaced by the full-fledged quantum degeneracy. At the quantum-phase-transition singularity, operator $Q(τ_{(EP)})$ becomes unobservable and acquires a non-diagonalizable Jordan-block structure.

Explore related subjects

quant-phgr-qcmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miloslav Znojil. 2015-11-24. Quantization of Big Bang in crypto-Hermitian Heisenberg picture. https://doi.org/10.1007/978-3-319-31356-6_26

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↗