SearcharxivSearch

arXiv · 1812.11447

Symphony on Strong Field Approximation

Abstract

This paper has been prepared by the Symphony collaboration (University of Warsaw, Uniwersytet Jagiello\'nski, DESY/CNR and ICFO) on the occasion of the 25th anniversary of the "simple man's models" which underlie most of the phenomena that occur when intense ultrashort laser pulses interact with matter. The phenomena in question include High-Harmonic Generation, Above-Threshold Ionization, and Non-Sequential Multielectron Ionization. "Simple man's models" provide, both an intuitive basis for understanding the numerical solutions of the time-dependent Schr\"odinger equation, and the motivation for the powerful analytic approximations generally known as the Strong Field Approximation (SFA). In this paper we first review the SFA in the form developed by us in the last 25 years. In this approach SFA is a method to solve the TDSE using a systematic perturbation theory in a part of the Hamiltonian describing continuum-continuum transitions in the presence of the laser field. In this review we focus on recent applications of SFA to HHG, ATI and NSMI from multi-electron atoms and from multi-atom. The main novel part of the presented theory concerns generalizations of SFA to: (i) time-dependent treatment of two-electron atoms, allowing for studies of an interplay between Electron Impact Ionization (EII) and Resonant Excitation with Subsequent Ionization (RESI); (ii) time-dependent treatment in the single active electron (SAE) approximation of "large" molecules and targets which are themselves undergoing dynamics during the HHG or ATI process. In particular, we formulate the general expressions for the case of arbitrary molecules, combining input from quantum chemistry and quantum dynamics. We formulate also theory of time-dependent separable molecular potentials to model analytically the dynamics of realistic electronic wave packets for molecules in strong laser fields.

Explore related subjects

Keep this discovery

BibTeXRIS

Kasra Amini, Jens Biegert, Francesca Calegari, Alexis Chacón, Marcelo F. Ciappina, Alexandre Dauphin, Dmitry K. Efimov, Carla Figueira de Morisson Faria, Krzysztof Giergiel, Piotr Gniewek, Alexandra S. Landsman, Michał Lesiuk, Michał Mandrysz, Andrew S. Maxwell, Robert Moszyński, Lisa Ortmann, Jose Antonio Pérez-Hernández, Antonio Picón, Emilio Pisanty, Jakub Prauzner-Bechcicki, Krzysztof Sacha, Noslen Suárez, Amelle Zaïr, Jakub Zakrzewski, Maciej Lewenstein. 2018-12-29. Symphony on Strong Field Approximation. https://doi.org/10.1088/1361-6633%2Fab2bb1

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