SearcharxivSearch

arXiv · 0706.1452

Reconstructing vibrational states in warm molecules using four-wave mixing with femtosecond laser pulses

Abstract

We propose a method to reconstruct the vibrational quantum state of molecules excited by a general excitation laser pulse. Unlike existing methods, we do not require the molecules before excitation to be in a pure state, allowing us to treat the important case of initially thermally excited molecules. Even if only a single initial level is appreciably populated, initial levels with small populations can still give major contributions to the unknown vibrational state, making it essential to take them into account. In addition to the excitation pulse, the method uses two incident, short laser pulses in a non-co-linear geometry to create four-wave mixing in the molecules. The measurements used in the reconstruction are spectra of the outgoing four-wave mixing pulse at different time delays of the excitation laser pulse. An important point is that the method does not require detailed knowledge of molecular transition moments between excited states nor of any of the incoming laser pulses, but circumvents this requirement by using one or more calibration laser pulses in a separate experiment either before or after the main data are recorded. The only requirements for the calibration laser pulses are that the constant parts of their spectrums should together cover the spectral range of the excitation laser pulse, and the constant part of each should have sufficient spectral overlap with one other calibration pulse to populate two of the same levels. Finally, we discuss the extension of the reconstruction method in this paper to more general situations, hereby presenting the new idea of quantum state reconstruction through perturbations with calibration.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anders S. Mouritzen, Olga Smirnova, Stefanie Grafe, Rune Lausten, Albert Stolow. 2007-06-11. Reconstructing vibrational states in warm molecules using four-wave mixing with femtosecond laser pulses. https://arxiv.org/abs/0706.1452

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