SearcharxivSearch

arXiv · 2105.11204

Non-trivial dynamic regimes of small (nano-scale) quantum systems

Abstract

Small (but still containing many atoms) quantum systems (traditionally termed nano-systems) are dramatically different from their macroscopic or genuine microscopic (atomic) cousins. Microscopic molecular systems (with a few atoms) obey a regular quantum dynamics (described by time dependent Schrodinger equation), whereas in macroscopic systems with continuous energy spectra, one can expect, also regular, although typically relaxation, dynamic behavior. The topic of our paper is in-between these limits. System behavior becomes non-trivial and manifests a sort of transitions between regular and chaotic dynamics. We show that such dynamic transitions occur when the Loschmidt echo time of life exceeds the typical recurrence cycle period. We illustrate this behavior in the frame work of a few versions of the exactly solvable quantum problem, proposed long ago by Zwanzig. It is based on the study of time evolution of the initially prepared vibrational state coupled to a reservoir with dense spectrum of its vibrational states. In the simplest version of the Zwanzig model, the reservoir has an equidistant spectrum, and the system - reservoir coupling matrix elements are independent of the reservoir states. We generalize the model to include into consideration the coupling of the initially prepared single state to system phonon excitations. The coupling results to temperature dependent broadening and decay of the echo components. Another generalization is to replace a single level by two states coupled to the Zwanzig reservoir. We anticipate that the basic ideas inspiring our work can be applied to a large variety of interesting for the applications nano-systems (e.g., dissipative free propagation of excitations along molecular chains, or as a model for exchange reactions).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V. A. Benderskii, E. I. Kats. 2021-05-24. Non-trivial dynamic regimes of small (nano-scale) quantum systems. https://doi.org/10.1134/s1063776121090090

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